./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 15:40:02,040 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 15:40:02,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 15:40:02,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 15:40:02,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 15:40:02,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 15:40:02,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 15:40:02,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 15:40:02,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 15:40:02,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 15:40:02,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 15:40:02,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 15:40:02,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 15:40:02,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 15:40:02,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 15:40:02,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 15:40:02,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 15:40:02,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 15:40:02,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 15:40:02,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 15:40:02,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 15:40:02,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 15:40:02,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 15:40:02,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 15:40:02,157 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 15:40:02,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 15:40:02,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 15:40:02,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 15:40:02,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 15:40:02,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 15:40:02,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 15:40:02,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 15:40:02,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 15:40:02,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 15:40:02,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 15:40:02,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 15:40:02,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 15:40:02,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 15:40:02,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 15:40:02,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 15:40:02,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 15:40:02,172 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-11-22 15:40:02,212 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 15:40:02,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 15:40:02,213 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 15:40:02,213 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 15:40:02,214 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 15:40:02,215 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 15:40:02,215 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 15:40:02,215 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-22 15:40:02,215 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-22 15:40:02,215 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-22 15:40:02,216 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-22 15:40:02,217 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-22 15:40:02,217 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-22 15:40:02,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 15:40:02,217 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-22 15:40:02,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 15:40:02,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 15:40:02,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-22 15:40:02,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-22 15:40:02,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-22 15:40:02,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 15:40:02,218 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-22 15:40:02,219 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 15:40:02,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-22 15:40:02,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 15:40:02,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 15:40:02,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 15:40:02,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 15:40:02,221 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 15:40:02,222 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-22 15:40:02,222 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e779827438904e8a0bb49f414cbe4d14072e556fff2389d3772808230457c73c [2021-11-22 15:40:02,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 15:40:02,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 15:40:02,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 15:40:02,551 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 15:40:02,552 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 15:40:02,553 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2021-11-22 15:40:02,622 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/data/ed0dea23a/838e5625e0f04cc9818bf53ec150d9e6/FLAG8ea0594ba [2021-11-22 15:40:03,136 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 15:40:03,137 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2021-11-22 15:40:03,151 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/data/ed0dea23a/838e5625e0f04cc9818bf53ec150d9e6/FLAG8ea0594ba [2021-11-22 15:40:03,487 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/data/ed0dea23a/838e5625e0f04cc9818bf53ec150d9e6 [2021-11-22 15:40:03,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 15:40:03,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 15:40:03,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 15:40:03,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 15:40:03,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 15:40:03,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:03,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b36481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03, skipping insertion in model container [2021-11-22 15:40:03,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:03,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 15:40:03,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 15:40:03,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 15:40:03,821 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 15:40:03,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 15:40:03,927 INFO L208 MainTranslator]: Completed translation [2021-11-22 15:40:03,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03 WrapperNode [2021-11-22 15:40:03,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 15:40:03,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 15:40:03,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 15:40:03,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 15:40:03,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:03,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:03,973 INFO L137 Inliner]: procedures = 109, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2021-11-22 15:40:03,974 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 15:40:03,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 15:40:03,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 15:40:03,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 15:40:03,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:03,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:03,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:03,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:03,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:03,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:03,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:04,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 15:40:04,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 15:40:04,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 15:40:04,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 15:40:04,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03" (1/1) ... [2021-11-22 15:40:04,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-22 15:40:04,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:40:04,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-22 15:40:04,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-22 15:40:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-22 15:40:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-22 15:40:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-22 15:40:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-22 15:40:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 15:40:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 15:40:04,181 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 15:40:04,183 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 15:40:04,384 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 15:40:04,390 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 15:40:04,390 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 15:40:04,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:40:04 BoogieIcfgContainer [2021-11-22 15:40:04,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 15:40:04,393 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-22 15:40:04,393 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-22 15:40:04,396 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-22 15:40:04,397 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-22 15:40:04,397 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 03:40:03" (1/3) ... [2021-11-22 15:40:04,398 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e036a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 03:40:04, skipping insertion in model container [2021-11-22 15:40:04,398 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-22 15:40:04,398 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 03:40:03" (2/3) ... [2021-11-22 15:40:04,399 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1e036a94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 03:40:04, skipping insertion in model container [2021-11-22 15:40:04,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-22 15:40:04,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 03:40:04" (3/3) ... [2021-11-22 15:40:04,400 INFO L388 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2021-11-22 15:40:04,489 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-22 15:40:04,489 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-22 15:40:04,489 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-22 15:40:04,489 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-22 15:40:04,489 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-22 15:40:04,490 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-22 15:40:04,490 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-22 15:40:04,490 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-22 15:40:04,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:40:04,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-22 15:40:04,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:40:04,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:40:04,573 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:40:04,573 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:40:04,573 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-22 15:40:04,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:40:04,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-22 15:40:04,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:40:04,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:40:04,577 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-22 15:40:04,577 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:40:04,583 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 9#L556-2true [2021-11-22 15:40:04,584 INFO L793 eck$LassoCheckResult]: Loop: 9#L556-2true assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 14#L557true assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 7#L561true assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 10#L561-2true call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 5#L565true assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 12#L565-2true call main_#t~mem25#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 4#L569true assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 9#L556-2true [2021-11-22 15:40:04,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:40:04,598 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-22 15:40:04,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:40:04,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571567599] [2021-11-22 15:40:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:04,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:40:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:40:04,832 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:40:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:40:04,935 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:40:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:40:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash -903226603, now seen corresponding path program 1 times [2021-11-22 15:40:04,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:40:04,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051663260] [2021-11-22 15:40:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:04,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:40:04,972 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:40:04,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2120725701] [2021-11-22 15:40:04,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:04,973 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:40:04,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:40:04,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:40:05,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-22 15:40:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:40:07,776 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:40:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:40:07,815 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:40:07,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:40:07,817 INFO L85 PathProgramCache]: Analyzing trace with hash 643070227, now seen corresponding path program 1 times [2021-11-22 15:40:07,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:40:07,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677066212] [2021-11-22 15:40:07,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:07,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:40:07,835 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:40:07,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2122125277] [2021-11-22 15:40:07,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:07,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:40:07,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:40:07,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:40:07,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-22 15:40:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:40:07,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-22 15:40:07,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 15:40:08,058 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-22 15:40:08,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2021-11-22 15:40:08,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 29 [2021-11-22 15:40:08,255 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 15:40:08,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2021-11-22 15:40:08,448 INFO L354 Elim1Store]: treesize reduction 228, result has 15.9 percent of original size [2021-11-22 15:40:08,449 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 119 treesize of output 107 [2021-11-22 15:40:08,619 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 15:40:08,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2021-11-22 15:40:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:40:08,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 15:40:08,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:40:08,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677066212] [2021-11-22 15:40:08,910 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 15:40:08,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122125277] [2021-11-22 15:40:08,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122125277] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:40:08,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:40:08,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 15:40:08,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171828363] [2021-11-22 15:40:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:40:23,273 WARN L227 SmtUtils]: Spent 14.35s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-22 15:40:24,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:40:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 15:40:24,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 15:40:24,923 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:40:24,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:40:24,997 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2021-11-22 15:40:24,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 15:40:25,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2021-11-22 15:40:25,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-22 15:40:25,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 24 transitions. [2021-11-22 15:40:25,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-11-22 15:40:25,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-11-22 15:40:25,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2021-11-22 15:40:25,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:40:25,016 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-11-22 15:40:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2021-11-22 15:40:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2021-11-22 15:40:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:40:25,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2021-11-22 15:40:25,047 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-11-22 15:40:25,048 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-11-22 15:40:25,048 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-22 15:40:25,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2021-11-22 15:40:25,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-22 15:40:25,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:40:25,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:40:25,050 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-22 15:40:25,050 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:40:25,051 INFO L791 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 89#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 92#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 95#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 94#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 87#L561-2 [2021-11-22 15:40:25,051 INFO L793 eck$LassoCheckResult]: Loop: 87#L561-2 call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 93#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 85#L565-2 call main_#t~mem25#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 82#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 83#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 90#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 86#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 87#L561-2 [2021-11-22 15:40:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:40:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash 28699821, now seen corresponding path program 1 times [2021-11-22 15:40:25,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:40:25,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324673588] [2021-11-22 15:40:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:25,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:40:25,069 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:40:25,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305981031] [2021-11-22 15:40:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:25,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:40:25,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:40:25,073 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:40:25,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-22 15:40:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:40:25,129 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:40:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:40:25,160 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:40:25,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:40:25,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 2 times [2021-11-22 15:40:25,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:40:25,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628879796] [2021-11-22 15:40:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:25,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:40:25,169 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:40:25,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962068684] [2021-11-22 15:40:25,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 15:40:25,170 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:40:25,170 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:40:25,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:40:25,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-22 15:40:25,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-22 15:40:25,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-22 15:40:25,249 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:40:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:40:25,275 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:40:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:40:25,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1341656857, now seen corresponding path program 1 times [2021-11-22 15:40:25,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:40:25,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940146428] [2021-11-22 15:40:25,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:25,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:40:25,304 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:40:25,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270031545] [2021-11-22 15:40:25,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:25,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:40:25,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:40:25,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:40:25,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-22 15:40:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:40:25,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-22 15:40:25,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 15:40:25,519 INFO L354 Elim1Store]: treesize reduction 119, result has 27.0 percent of original size [2021-11-22 15:40:25,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 65 [2021-11-22 15:40:25,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 66 [2021-11-22 15:40:25,870 INFO L354 Elim1Store]: treesize reduction 94, result has 34.7 percent of original size [2021-11-22 15:40:25,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 79 treesize of output 104 [2021-11-22 15:40:27,888 INFO L354 Elim1Store]: treesize reduction 8, result has 86.9 percent of original size [2021-11-22 15:40:27,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 94 [2021-11-22 15:40:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:40:28,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 15:40:28,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:40:28,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940146428] [2021-11-22 15:40:28,004 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 15:40:28,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270031545] [2021-11-22 15:40:28,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270031545] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:40:28,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:40:28,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-22 15:40:28,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072483597] [2021-11-22 15:40:28,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:40:30,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:40:30,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 15:40:30,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 15:40:30,018 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:40:30,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:40:30,057 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2021-11-22 15:40:30,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 15:40:30,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2021-11-22 15:40:30,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-22 15:40:30,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2021-11-22 15:40:30,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-11-22 15:40:30,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-11-22 15:40:30,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2021-11-22 15:40:30,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:40:30,062 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-11-22 15:40:30,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2021-11-22 15:40:30,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2021-11-22 15:40:30,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:40:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2021-11-22 15:40:30,064 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-11-22 15:40:30,064 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-11-22 15:40:30,064 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-22 15:40:30,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2021-11-22 15:40:30,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-22 15:40:30,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:40:30,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:40:30,066 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:40:30,066 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:40:30,066 INFO L791 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 163#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 168#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 167#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 164#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 165#L561-2 call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 160#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 161#L565-2 [2021-11-22 15:40:30,066 INFO L793 eck$LassoCheckResult]: Loop: 161#L565-2 call main_#t~mem25#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 158#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 159#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 166#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 171#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 170#L561-2 call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 169#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 161#L565-2 [2021-11-22 15:40:30,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:40:30,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724946, now seen corresponding path program 1 times [2021-11-22 15:40:30,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:40:30,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084226068] [2021-11-22 15:40:30,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:30,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:40:30,079 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:40:30,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1548344498] [2021-11-22 15:40:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:30,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:40:30,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:40:30,096 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:40:30,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-22 15:40:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:40:30,156 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:40:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:40:30,184 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:40:30,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:40:30,184 INFO L85 PathProgramCache]: Analyzing trace with hash -684175637, now seen corresponding path program 3 times [2021-11-22 15:40:30,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:40:30,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326548597] [2021-11-22 15:40:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:30,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:40:30,190 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:40:30,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723426530] [2021-11-22 15:40:30,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-22 15:40:30,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:40:30,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:40:30,193 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:40:30,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-22 15:40:30,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-22 15:40:30,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-22 15:40:30,245 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:40:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:40:30,276 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:40:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:40:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash 32704890, now seen corresponding path program 1 times [2021-11-22 15:40:30,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:40:30,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586654519] [2021-11-22 15:40:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:30,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:40:30,288 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:40:30,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650728857] [2021-11-22 15:40:30,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:40:30,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:40:30,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:40:30,295 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:40:30,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-22 15:40:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:40:30,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-22 15:40:30,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 15:40:30,458 INFO L354 Elim1Store]: treesize reduction 157, result has 14.2 percent of original size [2021-11-22 15:40:30,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 75 [2021-11-22 15:40:30,468 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 15:40:30,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 59 [2021-11-22 15:40:30,647 INFO L354 Elim1Store]: treesize reduction 76, result has 26.2 percent of original size [2021-11-22 15:40:30,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 71 [2021-11-22 15:40:31,113 INFO L354 Elim1Store]: treesize reduction 76, result has 26.2 percent of original size [2021-11-22 15:40:31,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 71 [2021-11-22 15:40:31,243 INFO L354 Elim1Store]: treesize reduction 290, result has 0.3 percent of original size [2021-11-22 15:40:31,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 138 treesize of output 1 [2021-11-22 15:40:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:40:31,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 15:40:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:40:31,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:40:31,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586654519] [2021-11-22 15:40:31,701 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 15:40:31,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650728857] [2021-11-22 15:40:31,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650728857] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 15:40:31,702 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-22 15:40:31,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2021-11-22 15:40:31,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405946300] [2021-11-22 15:40:31,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-22 15:40:45,629 WARN L227 SmtUtils]: Spent 13.92s on a formula simplification that was a NOOP. DAG size: 121 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-22 15:40:57,979 WARN L227 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 19 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-22 15:41:10,519 WARN L227 SmtUtils]: Spent 12.52s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-22 15:41:10,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:41:10,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-22 15:41:10,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-22 15:41:10,520 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 4 Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:41:10,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:41:10,786 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2021-11-22 15:41:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 15:41:10,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2021-11-22 15:41:10,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-22 15:41:10,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 38 transitions. [2021-11-22 15:41:10,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-11-22 15:41:10,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-11-22 15:41:10,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2021-11-22 15:41:10,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:41:10,791 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-11-22 15:41:10,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2021-11-22 15:41:10,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-11-22 15:41:10,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:41:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-11-22 15:41:10,795 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-11-22 15:41:10,795 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-11-22 15:41:10,795 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-22 15:41:10,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2021-11-22 15:41:10,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-22 15:41:10,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:41:10,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:41:10,798 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:41:10,798 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:41:10,798 INFO L791 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 313#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 321#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 329#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 314#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 315#L561-2 call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 320#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 323#L565-2 [2021-11-22 15:41:10,798 INFO L793 eck$LassoCheckResult]: Loop: 323#L565-2 call main_#t~mem25#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 331#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 330#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 328#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 327#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 325#L561-2 call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 326#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 323#L565-2 [2021-11-22 15:41:10,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:41:10,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723024, now seen corresponding path program 1 times [2021-11-22 15:41:10,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:41:10,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960472908] [2021-11-22 15:41:10,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:41:10,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:41:10,810 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:41:10,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783444740] [2021-11-22 15:41:10,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:41:10,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:41:10,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:41:10,839 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:41:10,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-22 15:41:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:41:10,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-22 15:41:10,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 15:41:10,990 INFO L354 Elim1Store]: treesize reduction 119, result has 27.0 percent of original size [2021-11-22 15:41:10,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 51 [2021-11-22 15:41:11,064 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 15:41:11,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-11-22 15:41:11,210 INFO L354 Elim1Store]: treesize reduction 43, result has 20.4 percent of original size [2021-11-22 15:41:11,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 55 [2021-11-22 15:41:11,309 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-22 15:41:11,353 INFO L354 Elim1Store]: treesize reduction 157, result has 18.7 percent of original size [2021-11-22 15:41:11,353 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 119 treesize of output 92 [2021-11-22 15:41:11,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-22 15:41:11,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2021-11-22 15:41:11,479 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-22 15:41:11,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 28 [2021-11-22 15:41:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:41:11,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-22 15:41:11,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:41:11,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960472908] [2021-11-22 15:41:11,495 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 15:41:11,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783444740] [2021-11-22 15:41:11,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783444740] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 15:41:11,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 15:41:11,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-22 15:41:11,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033995932] [2021-11-22 15:41:11,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 15:41:11,497 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-22 15:41:11,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:41:11,497 INFO L85 PathProgramCache]: Analyzing trace with hash -684175637, now seen corresponding path program 4 times [2021-11-22 15:41:11,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:41:11,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859305080] [2021-11-22 15:41:11,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:41:11,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:41:11,504 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:41:11,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478100731] [2021-11-22 15:41:11,504 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-22 15:41:11,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:41:11,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:41:11,507 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:41:11,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-22 15:41:14,384 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-22 15:41:14,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-22 15:41:14,384 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:41:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:41:14,436 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:41:34,894 WARN L227 SmtUtils]: Spent 20.46s on a formula simplification that was a NOOP. DAG size: 121 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-22 15:41:47,241 WARN L227 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 19 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-22 15:41:48,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:41:48,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-22 15:41:48,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-22 15:41:48,265 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 6 Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:41:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:41:48,293 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-11-22 15:41:48,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 15:41:48,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2021-11-22 15:41:48,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-22 15:41:48,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 32 transitions. [2021-11-22 15:41:48,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-11-22 15:41:48,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-11-22 15:41:48,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2021-11-22 15:41:48,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:41:48,299 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-11-22 15:41:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2021-11-22 15:41:48,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-11-22 15:41:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:41:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-11-22 15:41:48,303 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-11-22 15:41:48,303 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-11-22 15:41:48,303 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-22 15:41:48,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2021-11-22 15:41:48,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-22 15:41:48,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:41:48,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:41:48,306 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-22 15:41:48,306 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:41:48,320 INFO L791 eck$LassoCheckResult]: Stem: 399#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 400#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 404#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 403#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 397#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 398#L561-2 call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 395#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 396#L565-2 call main_#t~mem25#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 420#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 419#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 418#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 417#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 416#L561-2 call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 405#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 406#L565-2 [2021-11-22 15:41:48,320 INFO L793 eck$LassoCheckResult]: Loop: 406#L565-2 call main_#t~mem25#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 414#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 413#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 412#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 409#L561 assume main_#t~mem17#1 > main_#t~mem18#1;havoc main_#t~mem17#1;havoc main_#t~mem18#1;call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem19#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);main_#t~post20#1 := main_#t~mem19#1;call write~int(1 + main_#t~post20#1, main_~b~0#1.base, main_~b~0#1.offset, 4);havoc main_#t~mem19#1;havoc main_#t~post20#1; 407#L561-2 call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 408#L565 assume main_#t~mem21#1 > main_#t~mem22#1;havoc main_#t~mem21#1;havoc main_#t~mem22#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem23#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);main_#t~post24#1 := main_#t~mem23#1;call write~int(1 + main_#t~post24#1, main_~c~0#1.base, main_~c~0#1.offset, 4);havoc main_#t~mem23#1;havoc main_#t~post24#1; 406#L565-2 [2021-11-22 15:41:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:41:48,321 INFO L85 PathProgramCache]: Analyzing trace with hash 32706812, now seen corresponding path program 1 times [2021-11-22 15:41:48,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:41:48,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886648430] [2021-11-22 15:41:48,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:41:48,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:41:48,342 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:41:48,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311507618] [2021-11-22 15:41:48,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:41:48,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:41:48,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:41:48,387 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:41:48,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-22 15:41:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 15:41:48,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-22 15:41:48,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 15:41:48,479 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-22 15:41:48,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2021-11-22 15:41:48,658 INFO L354 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-11-22 15:41:48,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 35 [2021-11-22 15:41:48,695 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-22 15:41:48,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2021-11-22 15:41:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:41:48,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 15:41:48,837 INFO L354 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2021-11-22 15:41:48,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 74 [2021-11-22 15:41:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 15:41:48,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 15:41:48,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886648430] [2021-11-22 15:41:48,916 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-22 15:41:48,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311507618] [2021-11-22 15:41:48,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311507618] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 15:41:48,917 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-22 15:41:48,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-11-22 15:41:48,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003671180] [2021-11-22 15:41:48,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-22 15:41:48,918 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-22 15:41:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:41:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash -684175637, now seen corresponding path program 5 times [2021-11-22 15:41:48,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:41:48,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865354925] [2021-11-22 15:41:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:41:48,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:41:48,941 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:41:48,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494659401] [2021-11-22 15:41:48,947 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-22 15:41:48,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:41:48,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:41:48,963 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:41:48,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-22 15:41:49,027 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-22 15:41:49,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-22 15:41:49,027 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:41:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:41:49,068 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:42:01,729 WARN L227 SmtUtils]: Spent 11.06s on a formula simplification that was a NOOP. DAG size: 19 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-11-22 15:42:14,600 WARN L227 SmtUtils]: Spent 12.44s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-22 15:42:14,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 15:42:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-22 15:42:14,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-22 15:42:14,602 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 5 Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:42:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 15:42:14,721 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-11-22 15:42:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-22 15:42:14,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 39 transitions. [2021-11-22 15:42:14,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2021-11-22 15:42:14,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 39 transitions. [2021-11-22 15:42:14,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-11-22 15:42:14,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-11-22 15:42:14,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2021-11-22 15:42:14,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-22 15:42:14,725 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-11-22 15:42:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2021-11-22 15:42:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2021-11-22 15:42:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 15:42:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-11-22 15:42:14,729 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-11-22 15:42:14,741 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-11-22 15:42:14,741 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-22 15:42:14,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2021-11-22 15:42:14,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2021-11-22 15:42:14,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-22 15:42:14,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-22 15:42:14,743 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1] [2021-11-22 15:42:14,743 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 15:42:14,744 INFO L791 eck$LassoCheckResult]: Stem: 554#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 555#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post16#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~post20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~post24#1, main_#t~mem25#1, main_#t~mem26#1, main_~MAX~0#1.base, main_~MAX~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset, main_~c~0#1.base, main_~c~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~MAX~0#1.base, main_~MAX~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call write~int(1000, main_~MAX~0#1.base, main_~MAX~0#1.offset, 4);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset, 4);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 4);call write~int(1, main_~c~0#1.base, main_~c~0#1.offset, 4); 560#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 582#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 581#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 580#L561-2 call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 579#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 578#L565-2 call main_#t~mem25#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 550#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 551#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 559#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 556#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 557#L561-2 call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 552#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 553#L565-2 call main_#t~mem25#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 558#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 577#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 576#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 575#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 566#L561-2 [2021-11-22 15:42:14,744 INFO L793 eck$LassoCheckResult]: Loop: 566#L561-2 call main_#t~mem21#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem22#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 574#L565 assume !(main_#t~mem21#1 > main_#t~mem22#1);havoc main_#t~mem21#1;havoc main_#t~mem22#1; 563#L565-2 call main_#t~mem25#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem26#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 572#L569 assume !(main_#t~mem25#1 > main_#t~mem26#1);havoc main_#t~mem25#1;havoc main_#t~mem26#1; 570#L556-2 assume !false;call main_#t~mem6#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem7#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem9#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset, 4);call main_#t~mem12#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset, 4); 568#L557 assume !(main_#t~mem6#1 * main_#t~mem7#1 * main_#t~mem8#1 == main_#t~mem9#1 * main_#t~mem10#1 * main_#t~mem11#1 + main_#t~mem12#1 * main_#t~mem13#1 * main_#t~mem14#1);havoc main_#t~mem6#1;havoc main_#t~mem7#1;havoc main_#t~mem8#1;havoc main_#t~mem9#1;havoc main_#t~mem10#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;havoc main_#t~mem13#1;havoc main_#t~mem14#1;call main_#t~mem15#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);main_#t~post16#1 := main_#t~mem15#1;call write~int(1 + main_#t~post16#1, main_~a~0#1.base, main_~a~0#1.offset, 4);havoc main_#t~mem15#1;havoc main_#t~post16#1;call main_#t~mem17#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset, 4);call main_#t~mem18#1 := read~int(main_~MAX~0#1.base, main_~MAX~0#1.offset, 4); 565#L561 assume !(main_#t~mem17#1 > main_#t~mem18#1);havoc main_#t~mem17#1;havoc main_#t~mem18#1; 566#L561-2 [2021-11-22 15:42:14,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:42:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1050456877, now seen corresponding path program 1 times [2021-11-22 15:42:14,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:42:14,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437023025] [2021-11-22 15:42:14,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:42:14,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:42:14,756 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:42:14,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619523087] [2021-11-22 15:42:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:42:14,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:42:14,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:42:14,775 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:42:14,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-22 15:42:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:42:14,879 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 15:42:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 15:42:14,940 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 15:42:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 15:42:14,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1510934149, now seen corresponding path program 1 times [2021-11-22 15:42:14,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 15:42:14,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893369296] [2021-11-22 15:42:14,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:42:14,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 15:42:14,947 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-22 15:42:14,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [318093925] [2021-11-22 15:42:14,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 15:42:14,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-22 15:42:14,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 15:42:14,952 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-22 15:42:14,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2ad832ec-fde8-4aa7-936b-cff364c04ee2/bin/uautomizer-w2VwFs6gM0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process