./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 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF --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-53f42b1 [2021-11-20 06:36:42,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:36:42,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:36:42,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:36:42,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:36:42,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:36:42,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:36:42,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:36:42,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:36:42,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:36:42,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:36:42,990 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:36:42,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:36:42,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:36:42,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:36:42,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:36:43,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:36:43,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:36:43,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:36:43,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:36:43,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:36:43,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:36:43,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:36:43,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:36:43,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:36:43,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:36:43,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:36:43,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:36:43,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:36:43,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:36:43,030 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:36:43,031 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:36:43,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:36:43,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:36:43,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:36:43,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:36:43,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:36:43,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:36:43,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:36:43,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:36:43,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:36:43,039 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-11-20 06:36:43,093 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:36:43,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:36:43,095 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:36:43,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:36:43,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:36:43,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:36:43,098 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:36:43,098 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-20 06:36:43,098 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-20 06:36:43,098 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-20 06:36:43,099 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-20 06:36:43,100 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-20 06:36:43,100 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-20 06:36:43,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:36:43,100 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 06:36:43,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:36:43,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:36:43,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-20 06:36:43,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-20 06:36:43,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-20 06:36:43,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:36:43,102 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-20 06:36:43,102 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:36:43,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-20 06:36:43,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:36:43,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:36:43,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:36:43,105 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:36:43,105 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:36:43,106 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-20 06:36:43,106 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_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/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_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF 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-20 06:36:43,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:36:43,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:36:43,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:36:43,385 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:36:43,386 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:36:43,387 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2021-11-20 06:36:43,488 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/data/5cebb2b94/0e3b5d6f5d2349f9bf6b600ee7f75fdb/FLAG3851549ce [2021-11-20 06:36:43,994 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:36:43,995 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2021-11-20 06:36:44,010 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/data/5cebb2b94/0e3b5d6f5d2349f9bf6b600ee7f75fdb/FLAG3851549ce [2021-11-20 06:36:44,321 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/data/5cebb2b94/0e3b5d6f5d2349f9bf6b600ee7f75fdb [2021-11-20 06:36:44,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:36:44,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:36:44,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:36:44,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:36:44,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:36:44,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d272757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44, skipping insertion in model container [2021-11-20 06:36:44,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:36:44,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:36:44,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:36:44,761 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:36:44,819 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:36:44,854 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:36:44,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44 WrapperNode [2021-11-20 06:36:44,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:36:44,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:36:44,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:36:44,855 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:36:44,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,896 INFO L137 Inliner]: procedures = 109, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2021-11-20 06:36:44,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:36:44,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:36:44,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:36:44,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:36:44,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:36:44,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:36:44,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:36:44,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:36:44,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44" (1/1) ... [2021-11-20 06:36:44,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:36:44,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:36:44,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:36:44,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-20 06:36:45,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 06:36:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 06:36:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 06:36:45,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:36:45,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:36:45,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:36:45,078 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:36:45,079 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:36:45,258 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:36:45,263 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:36:45,264 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-20 06:36:45,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:36:45 BoogieIcfgContainer [2021-11-20 06:36:45,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:36:45,276 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-20 06:36:45,276 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-20 06:36:45,279 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-20 06:36:45,280 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:36:45,280 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 06:36:44" (1/3) ... [2021-11-20 06:36:45,289 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55e1031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 06:36:45, skipping insertion in model container [2021-11-20 06:36:45,289 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:36:45,289 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:36:44" (2/3) ... [2021-11-20 06:36:45,290 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55e1031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 06:36:45, skipping insertion in model container [2021-11-20 06:36:45,290 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:36:45,290 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:36:45" (3/3) ... [2021-11-20 06:36:45,291 INFO L388 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2021-11-20 06:36:45,362 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-20 06:36:45,362 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-20 06:36:45,362 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-20 06:36:45,362 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-20 06:36:45,362 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-20 06:36:45,362 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-20 06:36:45,363 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-20 06:36:45,363 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-20 06:36:45,403 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-20 06:36:45,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-20 06:36:45,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:36:45,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:36:45,434 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-20 06:36:45,434 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:36:45,434 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-20 06:36:45,434 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-20 06:36:45,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-20 06:36:45,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:36:45,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:36:45,437 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-11-20 06:36:45,437 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:36:45,444 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-20 06:36:45,444 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-20 06:36:45,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:36:45,450 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-11-20 06:36:45,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:36:45,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871214779] [2021-11-20 06:36:45,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:45,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:36:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:36:45,637 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:36:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:36:45,698 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:36:45,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:36:45,701 INFO L85 PathProgramCache]: Analyzing trace with hash -903226603, now seen corresponding path program 1 times [2021-11-20 06:36:45,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:36:45,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914594168] [2021-11-20 06:36:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:45,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:36:45,717 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:36:45,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871062006] [2021-11-20 06:36:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:45,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:36:45,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:36:45,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:36:45,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-20 06:36:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:36:48,461 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:36:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:36:48,518 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:36:48,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:36:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash 643070227, now seen corresponding path program 1 times [2021-11-20 06:36:48,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:36:48,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179928792] [2021-11-20 06:36:48,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:48,522 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:36:48,554 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:36:48,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298313340] [2021-11-20 06:36:48,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:36:48,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:36:48,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:36:48,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:36:48,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-20 06:36:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:36:48,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-20 06:36:48,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:36:48,845 INFO L354 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2021-11-20 06:36:48,846 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-20 06:36:48,896 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-20 06:36:49,151 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 06:36:49,152 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-20 06:36:49,369 INFO L354 Elim1Store]: treesize reduction 228, result has 15.9 percent of original size [2021-11-20 06:36:49,371 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-20 06:36:49,532 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 06:36:49,533 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-20 06:36:49,835 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-20 06:36:49,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:36:49,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:36:49,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179928792] [2021-11-20 06:36:49,837 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:36:49,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298313340] [2021-11-20 06:36:49,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298313340] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:36:49,839 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:36:49,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:36:49,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352220193] [2021-11-20 06:36:49,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:37:04,127 WARN L227 SmtUtils]: Spent 14.28s 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-20 06:37:16,441 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-20 06:37:29,632 WARN L227 SmtUtils]: Spent 12.69s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-20 06:37:29,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:37:29,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:37:29,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:37:29,660 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-20 06:37:29,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:37:29,725 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2021-11-20 06:37:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:37:29,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2021-11-20 06:37:29,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-20 06:37:29,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 20 states and 24 transitions. [2021-11-20 06:37:29,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-11-20 06:37:29,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-11-20 06:37:29,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2021-11-20 06:37:29,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:37:29,740 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-11-20 06:37:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2021-11-20 06:37:29,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2021-11-20 06:37:29,764 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-20 06:37:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2021-11-20 06:37:29,765 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-11-20 06:37:29,766 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-11-20 06:37:29,766 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-20 06:37:29,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2021-11-20 06:37:29,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-20 06:37:29,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:37:29,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:37:29,768 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-20 06:37:29,768 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:37:29,768 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-20 06:37:29,768 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-20 06:37:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:37:29,769 INFO L85 PathProgramCache]: Analyzing trace with hash 28699821, now seen corresponding path program 1 times [2021-11-20 06:37:29,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:37:29,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764448098] [2021-11-20 06:37:29,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:29,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:37:29,786 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:37:29,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509691436] [2021-11-20 06:37:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:29,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:37:29,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:37:29,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:37:29,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-20 06:37:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:37:29,875 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:37:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:37:29,901 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:37:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:37:29,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1453675845, now seen corresponding path program 2 times [2021-11-20 06:37:29,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:37:29,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049642085] [2021-11-20 06:37:29,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:29,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:37:29,911 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:37:29,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531773591] [2021-11-20 06:37:29,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:37:29,912 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:37:29,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:37:29,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:37:29,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-20 06:37:29,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-20 06:37:29,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:37:29,999 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:37:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:37:30,026 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:37:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:37:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1341656857, now seen corresponding path program 1 times [2021-11-20 06:37:30,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:37:30,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411428723] [2021-11-20 06:37:30,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:30,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:37:30,048 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:37:30,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1263102849] [2021-11-20 06:37:30,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:30,048 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:37:30,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:37:30,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:37:30,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-20 06:37:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:37:30,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-20 06:37:30,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:37:30,213 INFO L354 Elim1Store]: treesize reduction 119, result has 27.0 percent of original size [2021-11-20 06:37:30,214 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-20 06:37:30,219 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-20 06:37:30,553 INFO L354 Elim1Store]: treesize reduction 94, result has 34.7 percent of original size [2021-11-20 06:37:30,554 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-20 06:37:32,579 INFO L354 Elim1Store]: treesize reduction 8, result has 86.9 percent of original size [2021-11-20 06:37:32,579 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-20 06:37:32,692 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-20 06:37:32,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:37:32,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:37:32,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411428723] [2021-11-20 06:37:32,693 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:37:32,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263102849] [2021-11-20 06:37:32,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263102849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:37:32,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:37:32,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-20 06:37:32,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838424890] [2021-11-20 06:37:32,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:37:45,708 WARN L227 SmtUtils]: Spent 13.01s 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-20 06:37:58,921 WARN L227 SmtUtils]: Spent 12.57s 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-20 06:37:58,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:37:58,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:37:58,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:37:58,922 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-20 06:37:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:37:58,951 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2021-11-20 06:37:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:37:58,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2021-11-20 06:37:58,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-20 06:37:58,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 19 transitions. [2021-11-20 06:37:58,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2021-11-20 06:37:58,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2021-11-20 06:37:58,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2021-11-20 06:37:58,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:37:58,954 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-11-20 06:37:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2021-11-20 06:37:58,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2021-11-20 06:37:58,956 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-20 06:37:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2021-11-20 06:37:58,956 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-11-20 06:37:58,956 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2021-11-20 06:37:58,957 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-20 06:37:58,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2021-11-20 06:37:58,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-20 06:37:58,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:37:58,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:37:58,958 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:37:58,974 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:37:58,974 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-20 06:37:58,975 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-20 06:37:58,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:37:58,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1810724946, now seen corresponding path program 1 times [2021-11-20 06:37:58,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:37:58,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042658987] [2021-11-20 06:37:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:58,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:37:59,007 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:37:59,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [734110318] [2021-11-20 06:37:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:59,009 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:37:59,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:37:59,014 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:37:59,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-20 06:37:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:37:59,073 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:37:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:37:59,105 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:37:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:37:59,105 INFO L85 PathProgramCache]: Analyzing trace with hash -684175637, now seen corresponding path program 3 times [2021-11-20 06:37:59,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:37:59,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266164966] [2021-11-20 06:37:59,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:59,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:37:59,112 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:37:59,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1034604054] [2021-11-20 06:37:59,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:37:59,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:37:59,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:37:59,114 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:37:59,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-20 06:37:59,174 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-11-20 06:37:59,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:37:59,175 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:37:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:37:59,209 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:37:59,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:37:59,210 INFO L85 PathProgramCache]: Analyzing trace with hash 32704890, now seen corresponding path program 1 times [2021-11-20 06:37:59,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:37:59,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175906251] [2021-11-20 06:37:59,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:59,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:37:59,222 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:37:59,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1811064842] [2021-11-20 06:37:59,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:37:59,223 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:37:59,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:37:59,237 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:37:59,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-20 06:37:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:37:59,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 35 conjunts are in the unsatisfiable core [2021-11-20 06:37:59,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:37:59,396 INFO L354 Elim1Store]: treesize reduction 157, result has 14.2 percent of original size [2021-11-20 06:37:59,396 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-20 06:37:59,417 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 06:37:59,417 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-20 06:37:59,645 INFO L354 Elim1Store]: treesize reduction 76, result has 26.2 percent of original size [2021-11-20 06:37:59,646 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-20 06:38:00,122 INFO L354 Elim1Store]: treesize reduction 76, result has 26.2 percent of original size [2021-11-20 06:38:00,123 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-20 06:38:00,260 INFO L354 Elim1Store]: treesize reduction 290, result has 0.3 percent of original size [2021-11-20 06:38:00,261 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-20 06:38:00,267 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-20 06:38:00,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:38:00,684 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-20 06:38:00,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:38:00,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175906251] [2021-11-20 06:38:00,684 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:38:00,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811064842] [2021-11-20 06:38:00,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811064842] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:38:00,685 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:38:00,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2021-11-20 06:38:00,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394519126] [2021-11-20 06:38:00,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:38:03,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:38:03,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-20 06:38:03,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-11-20 06:38:03,124 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-20 06:38:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:38:03,365 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2021-11-20 06:38:03,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 06:38:03,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2021-11-20 06:38:03,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-20 06:38:03,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 38 transitions. [2021-11-20 06:38:03,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2021-11-20 06:38:03,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2021-11-20 06:38:03,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2021-11-20 06:38:03,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:38:03,371 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-11-20 06:38:03,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2021-11-20 06:38:03,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2021-11-20 06:38:03,373 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-20 06:38:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-11-20 06:38:03,374 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-11-20 06:38:03,374 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-11-20 06:38:03,374 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-20 06:38:03,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2021-11-20 06:38:03,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-20 06:38:03,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:38:03,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:38:03,377 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:38:03,377 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:38:03,377 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-20 06:38:03,377 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-20 06:38:03,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:03,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1810723024, now seen corresponding path program 1 times [2021-11-20 06:38:03,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:38:03,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131759294] [2021-11-20 06:38:03,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:03,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:38:03,389 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:38:03,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [425370173] [2021-11-20 06:38:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:03,390 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:38:03,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:38:03,401 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:38:03,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-20 06:38:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:38:03,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-20 06:38:03,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:38:03,540 INFO L354 Elim1Store]: treesize reduction 119, result has 27.0 percent of original size [2021-11-20 06:38:03,540 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-20 06:38:03,592 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 06:38:03,592 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-20 06:38:03,725 INFO L354 Elim1Store]: treesize reduction 43, result has 20.4 percent of original size [2021-11-20 06:38:03,726 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-20 06:38:03,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-20 06:38:03,885 INFO L354 Elim1Store]: treesize reduction 157, result has 18.7 percent of original size [2021-11-20 06:38:03,885 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-20 06:38:03,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:38:03,962 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-20 06:38:04,029 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-11-20 06:38:04,029 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-20 06:38:04,046 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-20 06:38:04,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:38:04,046 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:38:04,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131759294] [2021-11-20 06:38:04,047 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:38:04,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425370173] [2021-11-20 06:38:04,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425370173] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:38:04,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:38:04,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:38:04,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379093248] [2021-11-20 06:38:04,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:38:04,048 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:38:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash -684175637, now seen corresponding path program 4 times [2021-11-20 06:38:04,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:38:04,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242171185] [2021-11-20 06:38:04,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:04,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:38:04,054 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:38:04,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112144543] [2021-11-20 06:38:04,055 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:38:04,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:38:04,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:38:04,064 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:38:04,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 06:38:06,855 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:38:06,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:38:06,855 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:38:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:38:06,896 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:38:19,813 WARN L227 SmtUtils]: Spent 12.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-20 06:38:20,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:38:20,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:38:20,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:38:20,987 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-20 06:38:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:38:21,015 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-11-20 06:38:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:38:21,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2021-11-20 06:38:21,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-20 06:38:21,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 32 transitions. [2021-11-20 06:38:21,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-11-20 06:38:21,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-11-20 06:38:21,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2021-11-20 06:38:21,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:38:21,021 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-11-20 06:38:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2021-11-20 06:38:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-11-20 06:38:21,024 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-20 06:38:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-11-20 06:38:21,025 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-11-20 06:38:21,025 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-11-20 06:38:21,025 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-20 06:38:21,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2021-11-20 06:38:21,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-11-20 06:38:21,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:38:21,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:38:21,027 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-20 06:38:21,028 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:38:21,028 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-20 06:38:21,028 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-20 06:38:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:21,028 INFO L85 PathProgramCache]: Analyzing trace with hash 32706812, now seen corresponding path program 1 times [2021-11-20 06:38:21,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:38:21,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884554873] [2021-11-20 06:38:21,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:21,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:38:21,038 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:38:21,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363854443] [2021-11-20 06:38:21,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:21,039 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:38:21,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:38:21,049 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:38:21,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 06:38:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:38:21,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:38:21,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:38:21,135 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-20 06:38:21,136 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-20 06:38:21,286 INFO L354 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2021-11-20 06:38:21,287 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-20 06:38:21,320 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-11-20 06:38:21,320 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-20 06:38:21,327 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-20 06:38:21,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:38:21,430 INFO L354 Elim1Store]: treesize reduction 30, result has 11.8 percent of original size [2021-11-20 06:38:21,431 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-20 06:38:21,496 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-20 06:38:21,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:38:21,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884554873] [2021-11-20 06:38:21,497 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-11-20 06:38:21,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363854443] [2021-11-20 06:38:21,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363854443] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:38:21,497 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:38:21,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-11-20 06:38:21,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749669120] [2021-11-20 06:38:21,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:38:21,498 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:38:21,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash -684175637, now seen corresponding path program 5 times [2021-11-20 06:38:21,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:38:21,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364170798] [2021-11-20 06:38:21,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:21,499 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:38:21,505 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:38:21,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2004331259] [2021-11-20 06:38:21,506 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:38:21,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:38:21,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:38:21,514 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:38:21,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-20 06:38:21,564 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-11-20 06:38:21,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-11-20 06:38:21,565 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:38:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:38:21,599 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:38:28,864 WARN L227 SmtUtils]: Spent 5.89s 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-20 06:38:28,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:38:28,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 06:38:28,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-20 06:38:28,866 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-20 06:38:28,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:38:28,945 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-11-20 06:38:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:38:28,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 39 transitions. [2021-11-20 06:38:28,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2021-11-20 06:38:28,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 39 transitions. [2021-11-20 06:38:28,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2021-11-20 06:38:28,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2021-11-20 06:38:28,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 39 transitions. [2021-11-20 06:38:28,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:38:28,949 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-11-20 06:38:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 39 transitions. [2021-11-20 06:38:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2021-11-20 06:38:28,952 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-20 06:38:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-11-20 06:38:28,953 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-11-20 06:38:28,953 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-11-20 06:38:28,953 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-20 06:38:28,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2021-11-20 06:38:28,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2021-11-20 06:38:28,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:38:28,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:38:28,955 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1] [2021-11-20 06:38:28,955 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:38:28,956 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-20 06:38:28,956 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-20 06:38:28,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1050456877, now seen corresponding path program 1 times [2021-11-20 06:38:28,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:38:28,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822546842] [2021-11-20 06:38:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:28,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:38:28,966 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:38:28,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2095602655] [2021-11-20 06:38:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:28,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:38:28,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:38:29,003 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:38:29,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-20 06:38:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:38:29,104 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:38:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:38:29,160 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:38:29,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:38:29,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1510934149, now seen corresponding path program 1 times [2021-11-20 06:38:29,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:38:29,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265858736] [2021-11-20 06:38:29,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:29,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:38:29,166 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-11-20 06:38:29,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763537729] [2021-11-20 06:38:29,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:38:29,167 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:38:29,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:38:29,169 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:38:29,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7edea91-2b11-439d-b505-63371a8f06df/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process