./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array13_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_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/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_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array13_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/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_0ad5334a-eb9b-47b3-ab3d-9606caea420b/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 bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:06:07,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:06:07,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:06:07,476 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:06:07,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:06:07,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:06:07,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:06:07,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:06:07,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:06:07,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:06:07,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:06:07,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:06:07,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:06:07,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:06:07,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:06:07,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:06:07,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:06:07,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:06:07,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:06:07,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:06:07,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:06:07,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:06:07,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:06:07,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:06:07,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:06:07,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:06:07,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:06:07,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:06:07,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:06:07,525 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:06:07,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:06:07,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:06:07,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:06:07,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:06:07,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:06:07,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:06:07,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:06:07,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:06:07,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:06:07,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:06:07,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:06:07,541 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-11-20 06:06:07,567 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:06:07,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:06:07,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:06:07,568 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:06:07,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:06:07,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:06:07,570 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:06:07,570 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-11-20 06:06:07,570 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-11-20 06:06:07,571 INFO L138 SettingsManager]: * Use old map elimination=false [2021-11-20 06:06:07,571 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-11-20 06:06:07,571 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-11-20 06:06:07,571 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-11-20 06:06:07,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:06:07,572 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 06:06:07,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:06:07,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:06:07,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-11-20 06:06:07,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-11-20 06:06:07,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-11-20 06:06:07,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:06:07,573 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-11-20 06:06:07,573 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:06:07,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-11-20 06:06:07,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:06:07,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:06:07,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:06:07,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:06:07,575 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:06:07,576 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-11-20 06:06:07,576 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_0ad5334a-eb9b-47b3-ab3d-9606caea420b/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_0ad5334a-eb9b-47b3-ab3d-9606caea420b/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 -> bcb4bc0abad87560c498c61782d3ccf631503b41762d0db8553a6c831cbdcaff [2021-11-20 06:06:07,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:06:07,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:06:07,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:06:07,893 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:06:07,894 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:06:07,895 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/termination-15/array13_alloca.i [2021-11-20 06:06:07,989 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/data/d4b276960/c7b7cb2a42844ad3ab8b781072ce50f8/FLAGfd93b9e49 [2021-11-20 06:06:08,541 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:06:08,542 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/sv-benchmarks/c/termination-15/array13_alloca.i [2021-11-20 06:06:08,552 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/data/d4b276960/c7b7cb2a42844ad3ab8b781072ce50f8/FLAGfd93b9e49 [2021-11-20 06:06:08,854 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/data/d4b276960/c7b7cb2a42844ad3ab8b781072ce50f8 [2021-11-20 06:06:08,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:06:08,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:06:08,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:06:08,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:06:08,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:06:08,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:06:08" (1/1) ... [2021-11-20 06:06:08,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@adfc0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:08, skipping insertion in model container [2021-11-20 06:06:08,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:06:08" (1/1) ... [2021-11-20 06:06:08,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:06:08,915 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:06:09,325 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:06:09,342 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:06:09,403 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:06:09,453 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:06:09,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:09 WrapperNode [2021-11-20 06:06:09,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:06:09,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:06:09,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:06:09,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:06:09,465 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:06:09" (1/1) ... [2021-11-20 06:06:09,489 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:06:09" (1/1) ... [2021-11-20 06:06:09,515 INFO L137 Inliner]: procedures = 151, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2021-11-20 06:06:09,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:06:09,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:06:09,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:06:09,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:06:09,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:09" (1/1) ... [2021-11-20 06:06:09,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:09" (1/1) ... [2021-11-20 06:06:09,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:09" (1/1) ... [2021-11-20 06:06:09,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:09" (1/1) ... [2021-11-20 06:06:09,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:09" (1/1) ... [2021-11-20 06:06:09,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:09" (1/1) ... [2021-11-20 06:06:09,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:09" (1/1) ... [2021-11-20 06:06:09,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:06:09,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:06:09,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:06:09,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:06:09,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:09" (1/1) ... [2021-11-20 06:06:09,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:06:09,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:09,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:09,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-11-20 06:06:09,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 06:06:09,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 06:06:09,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 06:06:09,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:06:09,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:06:09,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:06:09,734 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:06:09,736 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:06:09,883 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:06:09,889 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:06:09,889 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-20 06:06:09,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:09 BoogieIcfgContainer [2021-11-20 06:06:09,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:06:09,892 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-11-20 06:06:09,892 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-11-20 06:06:09,895 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-11-20 06:06:09,896 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:06:09,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 06:06:08" (1/3) ... [2021-11-20 06:06:09,897 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b80bb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 06:06:09, skipping insertion in model container [2021-11-20 06:06:09,898 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:06:09,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:09" (2/3) ... [2021-11-20 06:06:09,898 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b80bb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 06:06:09, skipping insertion in model container [2021-11-20 06:06:09,898 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-11-20 06:06:09,898 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:09" (3/3) ... [2021-11-20 06:06:09,900 INFO L388 chiAutomizerObserver]: Analyzing ICFG array13_alloca.i [2021-11-20 06:06:09,956 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-11-20 06:06:09,956 INFO L360 BuchiCegarLoop]: Hoare is false [2021-11-20 06:06:09,956 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-11-20 06:06:09,956 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-11-20 06:06:09,956 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-11-20 06:06:09,956 INFO L364 BuchiCegarLoop]: Difference is false [2021-11-20 06:06:09,957 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-11-20 06:06:09,957 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-11-20 06:06:09,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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:06:10,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-20 06:06:10,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:10,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:10,012 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-20 06:06:10,012 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-20 06:06:10,012 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-11-20 06:06:10,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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:06:10,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2021-11-20 06:06:10,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:10,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:10,015 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-11-20 06:06:10,015 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-11-20 06:06:10,022 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 11#L367true assume !(main_~length~0#1 < 1); 8#L367-2true call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 5#L369true assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 6#L370-3true [2021-11-20 06:06:10,023 INFO L793 eck$LassoCheckResult]: Loop: 6#L370-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 13#L372true assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 16#L370-2true main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 6#L370-3true [2021-11-20 06:06:10,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:10,029 INFO L85 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2021-11-20 06:06:10,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:10,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624406022] [2021-11-20 06:06:10,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:10,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:10,145 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:10,174 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:10,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:10,177 INFO L85 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2021-11-20 06:06:10,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:10,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092538046] [2021-11-20 06:06:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:10,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:10,194 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:10,219 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2021-11-20 06:06:10,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:10,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052413098] [2021-11-20 06:06:10,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:10,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:10,265 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:10,303 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:10,581 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:06:10,582 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:06:10,582 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:06:10,582 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:06:10,582 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:06:10,582 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:06:10,582 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:06:10,583 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:06:10,583 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration1_Lasso [2021-11-20 06:06:10,583 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:06:10,583 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:06:10,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:06:10,960 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:06:10,963 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:06:10,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:06:10,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:10,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:10,974 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:06:10,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:06:10,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:06:10,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:06:10,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:06:10,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:06:10,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:06:10,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:06:10,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-11-20 06:06:11,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:06:11,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:11,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:06:11,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:11,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:11,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:06:11,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:06:11,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:06:11,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:06:11,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:06:11,066 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:06:11,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:06:11,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-11-20 06:06:11,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:06:11,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:11,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:06:11,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:11,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:11,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:06:11,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-11-20 06:06:11,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:06:11,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:06:11,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:06:11,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:06:11,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:06:11,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:06:11,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:06:11,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:06:11,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:11,189 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:06:11,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:11,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:11,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:06:11,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-11-20 06:06:11,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:06:11,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:06:11,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:06:11,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:06:11,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:06:11,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:06:11,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:06:11,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:06:11,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:11,258 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:06:11,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:11,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:11,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:06:11,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:06:11,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:06:11,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:06:11,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:06:11,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:06:11,279 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:06:11,279 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:06:11,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-11-20 06:06:11,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:06:11,338 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:11,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:06:11,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:11,341 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:11,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:06:11,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:06:11,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:06:11,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:06:11,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:06:11,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:06:11,363 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:06:11,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-11-20 06:06:11,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:06:11,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:11,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:06:11,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:11,413 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:11,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:06:11,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:06:11,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:06:11,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:06:11,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:06:11,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:06:11,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:06:11,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-11-20 06:06:11,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:06:11,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:11,493 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:06:11,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:11,495 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:11,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-11-20 06:06:11,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:06:11,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:06:11,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:06:11,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:06:11,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:06:11,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:06:11,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:06:11,553 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:06:11,590 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2021-11-20 06:06:11,590 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-11-20 06:06:11,592 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:06:11,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:11,593 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:11,605 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:06:11,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-11-20 06:06:11,627 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-20 06:06:11,627 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:06:11,627 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1, ULTIMATE.start_main_~arr~0#1.offset) = -4*ULTIMATE.start_main_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_1 - 1*ULTIMATE.start_main_~arr~0#1.offset Supporting invariants [] [2021-11-20 06:06:11,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:11,678 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-11-20 06:06:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:11,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 06:06:11,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:11,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:06:11,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:11,807 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:06:11,837 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-11-20 06:06:11,839 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:06:11,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Result 35 states and 50 transitions. Complement of second has 7 states. [2021-11-20 06:06:11,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-11-20 06:06:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:06:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2021-11-20 06:06:11,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2021-11-20 06:06:11,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:06:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2021-11-20 06:06:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:06:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2021-11-20 06:06:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:06:11,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2021-11-20 06:06:11,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:11,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2021-11-20 06:06:11,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-11-20 06:06:11,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-11-20 06:06:11,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2021-11-20 06:06:11,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:11,907 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-11-20 06:06:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2021-11-20 06:06:11,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-20 06:06:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 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:06:11,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2021-11-20 06:06:11,932 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-11-20 06:06:11,932 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2021-11-20 06:06:11,932 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-11-20 06:06:11,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2021-11-20 06:06:11,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:11,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:11,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:11,934 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:11,934 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:06:11,934 INFO L791 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 114#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 121#L367 assume !(main_~length~0#1 < 1); 115#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 116#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 117#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 118#L370-4 main_~j~0#1 := 0; 119#L378-2 [2021-11-20 06:06:11,934 INFO L793 eck$LassoCheckResult]: Loop: 119#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 120#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 119#L378-2 [2021-11-20 06:06:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:11,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2021-11-20 06:06:11,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:11,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070957209] [2021-11-20 06:06:11,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:11,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:11,984 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:06:11,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:11,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070957209] [2021-11-20 06:06:11,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070957209] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:06:11,986 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:06:11,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 06:06:11,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953138457] [2021-11-20 06:06:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:06:11,989 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:06:11,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2021-11-20 06:06:11,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:11,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021209944] [2021-11-20 06:06:11,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:11,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:11,995 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:12,001 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:12,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:12,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:06:12,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:06:12,079 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:06:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:12,108 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2021-11-20 06:06:12,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 06:06:12,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2021-11-20 06:06:12,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:12,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2021-11-20 06:06:12,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-11-20 06:06:12,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2021-11-20 06:06:12,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2021-11-20 06:06:12,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:12,116 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2021-11-20 06:06:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2021-11-20 06:06:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2021-11-20 06:06:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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:06:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-11-20 06:06:12,119 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-11-20 06:06:12,119 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-11-20 06:06:12,119 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-11-20 06:06:12,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-11-20 06:06:12,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:12,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:12,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:12,122 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:12,122 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:06:12,123 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 154#L367 assume !(main_~length~0#1 < 1); 148#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 149#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 150#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 155#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 157#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 156#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 151#L370-4 main_~j~0#1 := 0; 152#L378-2 [2021-11-20 06:06:12,123 INFO L793 eck$LassoCheckResult]: Loop: 152#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 153#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 152#L378-2 [2021-11-20 06:06:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2021-11-20 06:06:12,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:12,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975432018] [2021-11-20 06:06:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:12,129 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:12,156 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:12,185 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2021-11-20 06:06:12,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:12,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13809657] [2021-11-20 06:06:12,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:12,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:12,190 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:12,202 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:12,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2021-11-20 06:06:12,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:12,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455033196] [2021-11-20 06:06:12,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:12,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:12,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:12,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455033196] [2021-11-20 06:06:12,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455033196] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:12,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340006625] [2021-11-20 06:06:12,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:12,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:12,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:12,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:12,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:12,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-20 06:06:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:12,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:06:12,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:12,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-20 06:06:12,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2021-11-20 06:06:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:12,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:12,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 16 [2021-11-20 06:06:12,827 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 29 treesize of output 27 [2021-11-20 06:06:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:12,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340006625] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:06:12,851 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:06:12,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 15 [2021-11-20 06:06:12,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922877653] [2021-11-20 06:06:12,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:06:12,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:12,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-11-20 06:06:12,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-11-20 06:06:12,898 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 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:06:13,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:13,041 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2021-11-20 06:06:13,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 06:06:13,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2021-11-20 06:06:13,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-20 06:06:13,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 30 transitions. [2021-11-20 06:06:13,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-11-20 06:06:13,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-11-20 06:06:13,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2021-11-20 06:06:13,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:13,056 INFO L681 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-11-20 06:06:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2021-11-20 06:06:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2021-11-20 06:06:13,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 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:06:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2021-11-20 06:06:13,064 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-11-20 06:06:13,065 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-11-20 06:06:13,065 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-11-20 06:06:13,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2021-11-20 06:06:13,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:13,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:13,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:13,069 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:13,069 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:06:13,070 INFO L791 eck$LassoCheckResult]: Stem: 271#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 279#L367 assume !(main_~length~0#1 < 1); 273#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 274#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 275#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 280#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 284#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 281#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 282#L370-4 main_~j~0#1 := 0; 288#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 276#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 277#L378-2 [2021-11-20 06:06:13,070 INFO L793 eck$LassoCheckResult]: Loop: 277#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 285#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 277#L378-2 [2021-11-20 06:06:13,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:13,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2021-11-20 06:06:13,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:13,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116610780] [2021-11-20 06:06:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:13,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:13,094 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:13,116 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:13,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2021-11-20 06:06:13,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:13,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638989331] [2021-11-20 06:06:13,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:13,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:13,126 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:13,137 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:13,138 INFO L85 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2021-11-20 06:06:13,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:13,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752557607] [2021-11-20 06:06:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:13,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:13,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:13,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752557607] [2021-11-20 06:06:13,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752557607] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:13,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364738520] [2021-11-20 06:06:13,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:13,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:13,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:13,295 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:13,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-20 06:06:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:13,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-20 06:06:13,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:13,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:13,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364738520] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:06:13,478 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:06:13,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2021-11-20 06:06:13,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091594921] [2021-11-20 06:06:13,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:06:13,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:13,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 06:06:13,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-11-20 06:06:13,522 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 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:06:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:13,713 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2021-11-20 06:06:13,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:06:13,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2021-11-20 06:06:13,717 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-20 06:06:13,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 38 states and 50 transitions. [2021-11-20 06:06:13,722 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-11-20 06:06:13,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-11-20 06:06:13,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 50 transitions. [2021-11-20 06:06:13,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:13,723 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2021-11-20 06:06:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 50 transitions. [2021-11-20 06:06:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2021-11-20 06:06:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 33 states have internal predecessors, (45), 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:06:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2021-11-20 06:06:13,732 INFO L704 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-11-20 06:06:13,732 INFO L587 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-11-20 06:06:13,732 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-11-20 06:06:13,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2021-11-20 06:06:13,734 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-20 06:06:13,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:13,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:13,735 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:13,735 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:06:13,736 INFO L791 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 439#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 447#L367 assume main_~length~0#1 < 1;main_~length~0#1 := 1; 440#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 441#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 442#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 449#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 458#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 459#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 460#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 455#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 456#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 443#L370-4 main_~j~0#1 := 0; 444#L378-2 [2021-11-20 06:06:13,736 INFO L793 eck$LassoCheckResult]: Loop: 444#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 454#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 444#L378-2 [2021-11-20 06:06:13,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:13,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1080825110, now seen corresponding path program 1 times [2021-11-20 06:06:13,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:13,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898460548] [2021-11-20 06:06:13,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:13,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:13,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:13,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898460548] [2021-11-20 06:06:13,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898460548] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:13,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788310872] [2021-11-20 06:06:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:13,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:13,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:13,893 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:13,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-20 06:06:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:13,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:06:13,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:14,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-20 06:06:14,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788310872] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:06:14,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:06:14,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2021-11-20 06:06:14,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631487894] [2021-11-20 06:06:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:06:14,010 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:06:14,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:14,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2021-11-20 06:06:14,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:14,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968938099] [2021-11-20 06:06:14,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:14,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:14,022 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:14,029 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:14,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:14,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:06:14,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-11-20 06:06:14,075 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:06:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:14,097 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2021-11-20 06:06:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 06:06:14,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2021-11-20 06:06:14,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:14,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 21 states and 27 transitions. [2021-11-20 06:06:14,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-11-20 06:06:14,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-11-20 06:06:14,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-11-20 06:06:14,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:14,108 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-11-20 06:06:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-11-20 06:06:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-11-20 06:06:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 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:06:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2021-11-20 06:06:14,113 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-11-20 06:06:14,113 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-11-20 06:06:14,113 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-11-20 06:06:14,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2021-11-20 06:06:14,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:14,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:14,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:14,116 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:14,117 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:06:14,117 INFO L791 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 547#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 554#L367 assume !(main_~length~0#1 < 1); 548#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 549#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 550#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 555#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 558#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 556#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 557#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 565#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 562#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 553#L370-4 main_~j~0#1 := 0; 552#L378-2 [2021-11-20 06:06:14,117 INFO L793 eck$LassoCheckResult]: Loop: 552#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 559#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 552#L378-2 [2021-11-20 06:06:14,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1781889688, now seen corresponding path program 1 times [2021-11-20 06:06:14,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:14,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249591550] [2021-11-20 06:06:14,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:14,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:14,138 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:14,153 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:14,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2021-11-20 06:06:14,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:14,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527381884] [2021-11-20 06:06:14,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:14,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:14,158 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:14,161 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:14,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959589, now seen corresponding path program 1 times [2021-11-20 06:06:14,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:14,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491347210] [2021-11-20 06:06:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:14,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:14,320 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:06:14,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:14,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491347210] [2021-11-20 06:06:14,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491347210] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:14,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418656188] [2021-11-20 06:06:14,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:14,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:14,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:14,329 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:14,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-20 06:06:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:14,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:06:14,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:14,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-20 06:06:14,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:06:14,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:06:14,514 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 06:06:14,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 06:06:14,672 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-20 06:06:14,673 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 27 treesize of output 13 [2021-11-20 06:06:14,685 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:06:14,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:15,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_36| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-11-20 06:06:15,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 28 [2021-11-20 06:06:15,774 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:06:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-20 06:06:15,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418656188] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:06:15,814 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:06:15,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 21 [2021-11-20 06:06:15,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046049226] [2021-11-20 06:06:15,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:06:15,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:15,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-20 06:06:15,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=311, Unknown=1, NotChecked=38, Total=462 [2021-11-20 06:06:15,858 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 9 Second operand has 22 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 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:06:16,262 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_36| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2021-11-20 06:06:16,689 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_36| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_36| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_36| (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2021-11-20 06:06:16,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:16,759 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2021-11-20 06:06:16,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-11-20 06:06:16,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 69 transitions. [2021-11-20 06:06:16,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:16,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 69 transitions. [2021-11-20 06:06:16,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-11-20 06:06:16,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-11-20 06:06:16,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 69 transitions. [2021-11-20 06:06:16,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:16,763 INFO L681 BuchiCegarLoop]: Abstraction has 53 states and 69 transitions. [2021-11-20 06:06:16,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 69 transitions. [2021-11-20 06:06:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2021-11-20 06:06:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 27 states have internal predecessors, (39), 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:06:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2021-11-20 06:06:16,767 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-11-20 06:06:16,767 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2021-11-20 06:06:16,767 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-11-20 06:06:16,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 39 transitions. [2021-11-20 06:06:16,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:16,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:16,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:16,769 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:16,769 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:06:16,769 INFO L791 eck$LassoCheckResult]: Stem: 739#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 740#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 748#L367 assume !(main_~length~0#1 < 1); 741#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 742#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 743#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 749#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 758#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 750#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 751#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 753#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 755#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 744#L370-4 main_~j~0#1 := 0; 745#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 746#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 747#L378-2 [2021-11-20 06:06:16,770 INFO L793 eck$LassoCheckResult]: Loop: 747#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 757#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 747#L378-2 [2021-11-20 06:06:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1295959587, now seen corresponding path program 1 times [2021-11-20 06:06:16,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:16,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122890209] [2021-11-20 06:06:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:16,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:16,780 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:16,792 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2021-11-20 06:06:16,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:16,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148876915] [2021-11-20 06:06:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:16,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:16,797 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:16,800 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:16,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:16,801 INFO L85 PathProgramCache]: Analyzing trace with hash 123354080, now seen corresponding path program 1 times [2021-11-20 06:06:16,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:16,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644463328] [2021-11-20 06:06:16,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:16,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:16,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:16,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644463328] [2021-11-20 06:06:16,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644463328] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:16,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403319693] [2021-11-20 06:06:16,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:16,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:16,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:16,886 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:16,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-20 06:06:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:16,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:06:16,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:17,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-20 06:06:17,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2021-11-20 06:06:17,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:17,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:17,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 14 [2021-11-20 06:06:17,175 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 28 treesize of output 24 [2021-11-20 06:06:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:17,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403319693] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:06:17,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:06:17,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2021-11-20 06:06:17,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947962332] [2021-11-20 06:06:17,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:06:17,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 06:06:17,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-11-20 06:06:17,251 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. cyclomatic complexity: 15 Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 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:06:17,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:17,391 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2021-11-20 06:06:17,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 06:06:17,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2021-11-20 06:06:17,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-20 06:06:17,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 50 transitions. [2021-11-20 06:06:17,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-11-20 06:06:17,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-11-20 06:06:17,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 50 transitions. [2021-11-20 06:06:17,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:17,394 INFO L681 BuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2021-11-20 06:06:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 50 transitions. [2021-11-20 06:06:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2021-11-20 06:06:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 32 states have internal predecessors, (45), 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:06:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2021-11-20 06:06:17,397 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2021-11-20 06:06:17,397 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 45 transitions. [2021-11-20 06:06:17,397 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-11-20 06:06:17,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 45 transitions. [2021-11-20 06:06:17,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:17,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:17,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:17,398 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:17,398 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:06:17,399 INFO L791 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 929#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 936#L367 assume !(main_~length~0#1 < 1); 930#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 931#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 932#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 937#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 947#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 938#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 939#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 941#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 943#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 933#L370-4 main_~j~0#1 := 0; 934#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 949#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 946#L378-2 [2021-11-20 06:06:17,399 INFO L793 eck$LassoCheckResult]: Loop: 946#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 945#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 946#L378-2 [2021-11-20 06:06:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2021-11-20 06:06:17,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:17,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827055877] [2021-11-20 06:06:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:17,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:17,410 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:17,419 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:17,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:17,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 7 times [2021-11-20 06:06:17,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:17,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025098193] [2021-11-20 06:06:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:17,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:17,424 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:17,427 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2021-11-20 06:06:17,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:17,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376117] [2021-11-20 06:06:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:17,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:17,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:17,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376117] [2021-11-20 06:06:17,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376117] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:17,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087515678] [2021-11-20 06:06:17,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:06:17,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:17,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:17,526 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:17,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-20 06:06:17,576 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:06:17,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:06:17,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:06:17,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:17,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2021-11-20 06:06:17,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-11-20 06:06:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:17,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:17,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 18 [2021-11-20 06:06:17,799 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 35 treesize of output 31 [2021-11-20 06:06:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:17,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087515678] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:06:17,823 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:06:17,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2021-11-20 06:06:17,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13127442] [2021-11-20 06:06:17,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:06:17,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-20 06:06:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:06:17,865 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. cyclomatic complexity: 16 Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 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:06:17,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:17,969 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2021-11-20 06:06:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:06:17,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2021-11-20 06:06:17,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-20 06:06:17,971 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 66 transitions. [2021-11-20 06:06:17,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-11-20 06:06:17,971 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-11-20 06:06:17,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 66 transitions. [2021-11-20 06:06:17,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:17,972 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 66 transitions. [2021-11-20 06:06:17,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 66 transitions. [2021-11-20 06:06:17,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2021-11-20 06:06:17,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.4) internal successors, (56), 39 states have internal predecessors, (56), 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:06:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2021-11-20 06:06:17,975 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-11-20 06:06:17,975 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 56 transitions. [2021-11-20 06:06:17,975 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-11-20 06:06:17,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 56 transitions. [2021-11-20 06:06:17,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:17,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:17,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:17,980 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:17,980 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:06:17,981 INFO L791 eck$LassoCheckResult]: Stem: 1127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1135#L367 assume !(main_~length~0#1 < 1); 1129#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1130#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1131#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1136#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1146#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1137#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1138#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1139#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1163#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1144#L370-4 main_~j~0#1 := 0; 1166#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1134#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1133#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1141#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1148#L378-2 [2021-11-20 06:06:17,981 INFO L793 eck$LassoCheckResult]: Loop: 1148#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1149#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1148#L378-2 [2021-11-20 06:06:17,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash 123354082, now seen corresponding path program 2 times [2021-11-20 06:06:17,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:17,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747516997] [2021-11-20 06:06:17,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:17,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:17,999 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:18,024 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 8 times [2021-11-20 06:06:18,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:18,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348156335] [2021-11-20 06:06:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:18,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:18,032 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:18,036 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1715810139, now seen corresponding path program 2 times [2021-11-20 06:06:18,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:18,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005306868] [2021-11-20 06:06:18,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:18,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:18,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:18,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005306868] [2021-11-20 06:06:18,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005306868] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:18,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757639219] [2021-11-20 06:06:18,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:06:18,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:18,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:18,205 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:18,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-20 06:06:18,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:06:18,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:06:18,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-20 06:06:18,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:18,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:18,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757639219] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:06:18,448 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:06:18,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2021-11-20 06:06:18,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892017119] [2021-11-20 06:06:18,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:06:18,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:18,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 06:06:18,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2021-11-20 06:06:18,494 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. cyclomatic complexity: 21 Second operand has 20 states, 20 states have (on average 2.0) internal successors, (40), 20 states have internal predecessors, (40), 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:06:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:18,664 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2021-11-20 06:06:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 06:06:18,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2021-11-20 06:06:18,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:18,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 43 states and 57 transitions. [2021-11-20 06:06:18,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-11-20 06:06:18,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-11-20 06:06:18,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 57 transitions. [2021-11-20 06:06:18,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:18,667 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 57 transitions. [2021-11-20 06:06:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 57 transitions. [2021-11-20 06:06:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2021-11-20 06:06:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.35) internal successors, (54), 39 states have internal predecessors, (54), 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:06:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2021-11-20 06:06:18,670 INFO L704 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2021-11-20 06:06:18,670 INFO L587 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2021-11-20 06:06:18,671 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-11-20 06:06:18,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2021-11-20 06:06:18,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:18,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:18,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:18,672 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:18,672 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:06:18,672 INFO L791 eck$LassoCheckResult]: Stem: 1357#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1358#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1366#L367 assume !(main_~length~0#1 < 1); 1359#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1360#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1361#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1367#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1396#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1395#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1394#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1373#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1368#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1369#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1371#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1386#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1384#L370-4 main_~j~0#1 := 0; 1378#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1362#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 1363#L378-2 [2021-11-20 06:06:18,672 INFO L793 eck$LassoCheckResult]: Loop: 1363#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1377#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1363#L378-2 [2021-11-20 06:06:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:18,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1062164513, now seen corresponding path program 3 times [2021-11-20 06:06:18,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:18,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569392473] [2021-11-20 06:06:18,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:18,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:18,682 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:18,692 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:18,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 9 times [2021-11-20 06:06:18,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:18,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662391018] [2021-11-20 06:06:18,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:18,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:18,696 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:18,698 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1462118108, now seen corresponding path program 3 times [2021-11-20 06:06:18,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:18,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659537887] [2021-11-20 06:06:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:18,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:18,798 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:18,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659537887] [2021-11-20 06:06:18,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659537887] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:18,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702189315] [2021-11-20 06:06:18,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:06:18,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:18,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:18,801 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:18,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-20 06:06:18,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-20 06:06:18,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:06:18,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:06:18,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:18,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-11-20 06:06:18,949 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-11-20 06:06:18,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2021-11-20 06:06:18,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 27 [2021-11-20 06:06:18,985 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-11-20 06:06:18,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 51 [2021-11-20 06:06:19,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-11-20 06:06:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-20 06:06:19,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:19,605 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0)) is different from false [2021-11-20 06:06:19,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 21 [2021-11-20 06:06:19,627 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 49 treesize of output 45 [2021-11-20 06:06:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-11-20 06:06:19,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702189315] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:06:19,662 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:06:19,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 17 [2021-11-20 06:06:19,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383664506] [2021-11-20 06:06:19,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:06:19,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:19,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-20 06:06:19,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=213, Unknown=1, NotChecked=30, Total=306 [2021-11-20 06:06:19,708 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. cyclomatic complexity: 19 Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 18 states have internal predecessors, (35), 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:06:20,215 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0))) is different from false [2021-11-20 06:06:20,703 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (not (= (* 4 |c_ULTIMATE.start_main_~i~0#1|) 4)) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0))) is different from false [2021-11-20 06:06:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:20,766 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2021-11-20 06:06:20,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:06:20,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 69 transitions. [2021-11-20 06:06:20,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-20 06:06:20,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 52 states and 69 transitions. [2021-11-20 06:06:20,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-11-20 06:06:20,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-11-20 06:06:20,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 69 transitions. [2021-11-20 06:06:20,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:06:20,769 INFO L681 BuchiCegarLoop]: Abstraction has 52 states and 69 transitions. [2021-11-20 06:06:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 69 transitions. [2021-11-20 06:06:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2021-11-20 06:06:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (59), 42 states have internal predecessors, (59), 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:06:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2021-11-20 06:06:20,773 INFO L704 BuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2021-11-20 06:06:20,773 INFO L587 BuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2021-11-20 06:06:20,773 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-11-20 06:06:20,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 59 transitions. [2021-11-20 06:06:20,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:06:20,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:06:20,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:06:20,774 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:20,774 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:06:20,775 INFO L791 eck$LassoCheckResult]: Stem: 1594#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1595#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1600#L367 assume !(main_~length~0#1 < 1); 1592#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1593#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1596#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1601#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1616#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1615#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1613#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1614#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1631#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1627#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1625#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1622#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1619#L370-4 main_~j~0#1 := 0; 1618#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1609#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1610#L378-2 [2021-11-20 06:06:20,775 INFO L793 eck$LassoCheckResult]: Loop: 1610#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1612#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1610#L378-2 [2021-11-20 06:06:20,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:20,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1119422813, now seen corresponding path program 2 times [2021-11-20 06:06:20,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:20,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927716289] [2021-11-20 06:06:20,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:20,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:20,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:20,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927716289] [2021-11-20 06:06:20,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927716289] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:20,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85857869] [2021-11-20 06:06:20,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:06:20,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:06:20,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:20,983 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:06:20,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-20 06:06:21,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:06:21,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:06:21,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-20 06:06:21,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:21,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-20 06:06:21,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:06:21,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:06:21,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:06:21,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:06:21,280 INFO L354 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2021-11-20 06:06:21,280 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 44 [2021-11-20 06:06:21,423 INFO L354 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2021-11-20 06:06:21,424 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 49 treesize of output 32 [2021-11-20 06:06:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:21,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:08:00,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 59 treesize of output 57 [2021-11-20 06:08:00,021 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 460 treesize of output 448 [2021-11-20 06:08:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:08:00,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85857869] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:08:00,340 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:08:00,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 28 [2021-11-20 06:08:00,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645055566] [2021-11-20 06:08:00,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:08:00,341 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:08:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:08:00,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 10 times [2021-11-20 06:08:00,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:08:00,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581962671] [2021-11-20 06:08:00,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:08:00,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:08:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:08:00,345 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:08:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:08:00,347 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:08:00,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:08:00,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 06:08:00,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=640, Unknown=14, NotChecked=0, Total=812 [2021-11-20 06:08:00,396 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. cyclomatic complexity: 22 Second operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 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:08:12,443 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_60| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_main_~j~0#1_57| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int)) (or (< (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* 4 |v_ULTIMATE.start_main_~j~0#1_57|)) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_57|) (< |v_ULTIMATE.start_main_~j~0#1_57| 0) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~nondet208#1|) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 0))))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (<= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0)) is different from false [2021-11-20 06:08:13,075 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_57| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet208#1|) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* 4 |v_ULTIMATE.start_main_~j~0#1_57|)) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_57|) (< |v_ULTIMATE.start_main_~j~0#1_57| 0))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-11-20 06:08:13,783 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_57| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (<= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 0) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~nondet208#1|) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 0) (< |v_ULTIMATE.start_main_~i~0#1_60| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* 4 |v_ULTIMATE.start_main_~j~0#1_57|)) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_57|) (< |v_ULTIMATE.start_main_~j~0#1_57| 0))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0))) is different from false [2021-11-20 06:08:14,496 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_57| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (<= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 0) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~nondet208#1|) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 0) (< |v_ULTIMATE.start_main_~i~0#1_60| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* 4 |v_ULTIMATE.start_main_~j~0#1_57|)) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_57|) (< |v_ULTIMATE.start_main_~j~0#1_57| 0))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0)) is different from false [2021-11-20 06:08:15,263 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|))) (and (<= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_58| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_58| 4))) 0) (<= 1 |v_ULTIMATE.start_main_~i~0#1_58|))) (forall ((|v_ULTIMATE.start_main_~j~0#1_57| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int) (|v_ULTIMATE.start_main_~i~0#1_60| Int)) (or (<= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 0) (+ (* |v_ULTIMATE.start_main_~i~0#1_60| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~nondet208#1|) (+ (* |v_ULTIMATE.start_main_~j~0#1_57| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|)) 0) (< |v_ULTIMATE.start_main_~i~0#1_60| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* 4 |v_ULTIMATE.start_main_~j~0#1_57|)) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_57|) (< |v_ULTIMATE.start_main_~j~0#1_57| 0))) (<= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (not (= (+ (* 4 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0)) (<= (select .cse0 |c_ULTIMATE.start_main_~arr~0#1.offset|) 0))) is different from false [2021-11-20 06:08:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:08:58,406 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2021-11-20 06:08:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-20 06:08:58,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 144 transitions. [2021-11-20 06:08:58,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:08:58,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 105 states and 144 transitions. [2021-11-20 06:08:58,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-11-20 06:08:58,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-11-20 06:08:58,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 144 transitions. [2021-11-20 06:08:58,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:08:58,411 INFO L681 BuchiCegarLoop]: Abstraction has 105 states and 144 transitions. [2021-11-20 06:08:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 144 transitions. [2021-11-20 06:08:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 65. [2021-11-20 06:08:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 64 states have internal predecessors, (92), 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:08:58,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2021-11-20 06:08:58,415 INFO L704 BuchiCegarLoop]: Abstraction has 65 states and 92 transitions. [2021-11-20 06:08:58,415 INFO L587 BuchiCegarLoop]: Abstraction has 65 states and 92 transitions. [2021-11-20 06:08:58,415 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-11-20 06:08:58,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 92 transitions. [2021-11-20 06:08:58,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:08:58,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:08:58,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:08:58,417 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:08:58,417 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:08:58,417 INFO L791 eck$LassoCheckResult]: Stem: 1903#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1904#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 1911#L367 assume !(main_~length~0#1 < 1); 1905#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 1906#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 1907#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1912#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1941#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1940#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1938#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1937#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1936#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 1932#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 1930#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 1926#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 1923#L370-4 main_~j~0#1 := 0; 1924#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1920#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1921#L378-2 [2021-11-20 06:08:58,417 INFO L793 eck$LassoCheckResult]: Loop: 1921#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 1922#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 1921#L378-2 [2021-11-20 06:08:58,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:08:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash 861257375, now seen corresponding path program 3 times [2021-11-20 06:08:58,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:08:58,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310785691] [2021-11-20 06:08:58,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:08:58,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:08:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:08:58,637 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:08:58,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:08:58,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310785691] [2021-11-20 06:08:58,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310785691] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:08:58,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593231833] [2021-11-20 06:08:58,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:08:58,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:08:58,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:08:58,640 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:08:58,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-20 06:08:58,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-20 06:08:58,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:08:58,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-20 06:08:58,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:08:58,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-20 06:08:58,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:08:58,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:08:58,795 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 06:08:58,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2021-11-20 06:08:58,889 INFO L354 Elim1Store]: treesize reduction 58, result has 36.3 percent of original size [2021-11-20 06:08:58,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 64 [2021-11-20 06:08:59,722 INFO L354 Elim1Store]: treesize reduction 57, result has 32.9 percent of original size [2021-11-20 06:08:59,723 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 73 [2021-11-20 06:08:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:08:59,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:09:18,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 30 [2021-11-20 06:09:18,223 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 47 treesize of output 41 [2021-11-20 06:09:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:09:18,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593231833] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:09:18,281 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:09:18,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 24 [2021-11-20 06:09:18,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490204133] [2021-11-20 06:09:18,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:09:18,282 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-11-20 06:09:18,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 11 times [2021-11-20 06:09:18,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:18,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281743663] [2021-11-20 06:09:18,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:18,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:18,286 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:09:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:18,289 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:09:18,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:09:18,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-20 06:09:18,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2021-11-20 06:09:18,339 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. cyclomatic complexity: 35 Second operand has 25 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 25 states have internal predecessors, (46), 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:09:19,360 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~j~0#1_61| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_61| 4))) 0) (< (+ (* 4 |v_ULTIMATE.start_main_~j~0#1_61|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_61|) (< |v_ULTIMATE.start_main_~j~0#1_61| 0))) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (or (< 0 |c_ULTIMATE.start_main_#t~mem209#1|) (forall ((|v_ULTIMATE.start_main_~j~0#1_61| Int)) (or (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~j~0#1_61| 4))) 0) (< (+ (* 4 |v_ULTIMATE.start_main_~j~0#1_61|) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< 0 |v_ULTIMATE.start_main_~j~0#1_61|) (< |v_ULTIMATE.start_main_~j~0#1_61| 0))))) is different from false [2021-11-20 06:09:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:09:20,597 INFO L93 Difference]: Finished difference Result 128 states and 174 transitions. [2021-11-20 06:09:20,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-20 06:09:20,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 174 transitions. [2021-11-20 06:09:20,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:09:20,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 128 states and 174 transitions. [2021-11-20 06:09:20,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2021-11-20 06:09:20,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2021-11-20 06:09:20,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 174 transitions. [2021-11-20 06:09:20,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:09:20,605 INFO L681 BuchiCegarLoop]: Abstraction has 128 states and 174 transitions. [2021-11-20 06:09:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 174 transitions. [2021-11-20 06:09:20,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 67. [2021-11-20 06:09:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 66 states have internal predecessors, (95), 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:09:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2021-11-20 06:09:20,610 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 95 transitions. [2021-11-20 06:09:20,610 INFO L587 BuchiCegarLoop]: Abstraction has 67 states and 95 transitions. [2021-11-20 06:09:20,610 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-11-20 06:09:20,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 95 transitions. [2021-11-20 06:09:20,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:09:20,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:09:20,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:09:20,612 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:09:20,612 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:09:20,612 INFO L791 eck$LassoCheckResult]: Stem: 2255#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2256#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2264#L367 assume !(main_~length~0#1 < 1); 2257#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2258#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2259#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2265#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2311#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2316#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2314#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2315#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2266#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2267#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2269#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2270#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2288#L370-4 main_~j~0#1 := 0; 2263#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2276#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2273#L378-2 [2021-11-20 06:09:20,612 INFO L793 eck$LassoCheckResult]: Loop: 2273#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2274#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2273#L378-2 [2021-11-20 06:09:20,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:20,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1484057445, now seen corresponding path program 4 times [2021-11-20 06:09:20,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:20,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312968585] [2021-11-20 06:09:20,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:20,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:20,620 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:09:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:20,642 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:09:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 12 times [2021-11-20 06:09:20,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:20,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647866232] [2021-11-20 06:09:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:20,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:20,648 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:09:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:20,656 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:09:20,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:20,657 INFO L85 PathProgramCache]: Analyzing trace with hash 250063720, now seen corresponding path program 4 times [2021-11-20 06:09:20,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:20,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819506233] [2021-11-20 06:09:20,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:20,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:20,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:09:20,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819506233] [2021-11-20 06:09:20,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819506233] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:09:20,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437132622] [2021-11-20 06:09:20,795 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:09:20,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:09:20,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:09:20,801 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:09:20,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-11-20 06:09:20,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:09:20,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:09:20,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-20 06:09:20,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:09:20,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-20 06:09:21,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:09:21,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-11-20 06:09:21,038 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-20 06:09:21,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2021-11-20 06:09:21,251 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-20 06:09:21,251 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 27 treesize of output 13 [2021-11-20 06:09:21,255 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:21,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:09:21,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_72| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (< |v_ULTIMATE.start_main_~i~0#1_72| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-11-20 06:09:22,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 30 [2021-11-20 06:09:22,587 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 82 treesize of output 78 [2021-11-20 06:09:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-20 06:09:22,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437132622] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:09:22,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:09:22,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 23 [2021-11-20 06:09:22,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741749233] [2021-11-20 06:09:22,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:09:22,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:09:22,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-11-20 06:09:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=408, Unknown=1, NotChecked=42, Total=552 [2021-11-20 06:09:22,672 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. cyclomatic complexity: 37 Second operand has 24 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 24 states have internal predecessors, (43), 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:09:23,178 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 1) (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_72| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (< |v_ULTIMATE.start_main_~i~0#1_72| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) 0)) is different from false [2021-11-20 06:09:23,725 WARN L838 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_72| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| 4)) 0) (< |v_ULTIMATE.start_main_~i~0#1_72| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (= |c_ULTIMATE.start_main_~arr~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2021-11-20 06:09:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:09:23,757 INFO L93 Difference]: Finished difference Result 118 states and 162 transitions. [2021-11-20 06:09:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-20 06:09:23,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 162 transitions. [2021-11-20 06:09:23,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:09:23,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 162 transitions. [2021-11-20 06:09:23,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-11-20 06:09:23,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-11-20 06:09:23,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 162 transitions. [2021-11-20 06:09:23,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:09:23,762 INFO L681 BuchiCegarLoop]: Abstraction has 118 states and 162 transitions. [2021-11-20 06:09:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 162 transitions. [2021-11-20 06:09:23,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 77. [2021-11-20 06:09:23,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 76 states have internal predecessors, (113), 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:09:23,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2021-11-20 06:09:23,767 INFO L704 BuchiCegarLoop]: Abstraction has 77 states and 113 transitions. [2021-11-20 06:09:23,767 INFO L587 BuchiCegarLoop]: Abstraction has 77 states and 113 transitions. [2021-11-20 06:09:23,768 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-11-20 06:09:23,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 113 transitions. [2021-11-20 06:09:23,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:09:23,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:09:23,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:09:23,770 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:09:23,770 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:09:23,770 INFO L791 eck$LassoCheckResult]: Stem: 2589#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2590#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2598#L367 assume !(main_~length~0#1 < 1); 2591#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2592#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2593#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2599#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2636#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2655#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2654#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2653#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2600#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2601#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2603#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2605#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2596#L370-4 main_~j~0#1 := 0; 2597#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2594#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2595#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2611#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2608#L378-2 [2021-11-20 06:09:23,770 INFO L793 eck$LassoCheckResult]: Loop: 2608#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2612#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2608#L378-2 [2021-11-20 06:09:23,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:23,771 INFO L85 PathProgramCache]: Analyzing trace with hash 250063722, now seen corresponding path program 5 times [2021-11-20 06:09:23,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:23,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54065075] [2021-11-20 06:09:23,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:23,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:23,797 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:09:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:23,810 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:09:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 13 times [2021-11-20 06:09:23,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:23,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078868984] [2021-11-20 06:09:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:23,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:23,814 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:09:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:23,816 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:09:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash -206930387, now seen corresponding path program 5 times [2021-11-20 06:09:23,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:23,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154330078] [2021-11-20 06:09:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:23,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:23,931 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:23,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:09:23,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154330078] [2021-11-20 06:09:23,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154330078] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:09:23,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563135259] [2021-11-20 06:09:23,932 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:09:23,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:09:23,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:09:23,934 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:09:23,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-11-20 06:09:23,992 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-11-20 06:09:23,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:09:23,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-20 06:09:23,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:09:24,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-11-20 06:09:24,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-11-20 06:09:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:24,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:09:24,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 24 [2021-11-20 06:09:24,327 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 43 treesize of output 36 [2021-11-20 06:09:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:24,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563135259] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:09:24,379 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:09:24,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2021-11-20 06:09:24,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165405226] [2021-11-20 06:09:24,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:09:24,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:09:24,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-11-20 06:09:24,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2021-11-20 06:09:24,419 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. cyclomatic complexity: 47 Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 20 states have internal predecessors, (40), 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:09:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:09:24,555 INFO L93 Difference]: Finished difference Result 90 states and 129 transitions. [2021-11-20 06:09:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:09:24,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 129 transitions. [2021-11-20 06:09:24,556 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:09:24,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 90 states and 129 transitions. [2021-11-20 06:09:24,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2021-11-20 06:09:24,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-11-20 06:09:24,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 129 transitions. [2021-11-20 06:09:24,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:09:24,558 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 129 transitions. [2021-11-20 06:09:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 129 transitions. [2021-11-20 06:09:24,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2021-11-20 06:09:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 85 states have internal predecessors, (125), 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:09:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2021-11-20 06:09:24,562 INFO L704 BuchiCegarLoop]: Abstraction has 86 states and 125 transitions. [2021-11-20 06:09:24,562 INFO L587 BuchiCegarLoop]: Abstraction has 86 states and 125 transitions. [2021-11-20 06:09:24,562 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-11-20 06:09:24,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 125 transitions. [2021-11-20 06:09:24,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:09:24,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:09:24,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:09:24,564 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:09:24,564 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:09:24,564 INFO L791 eck$LassoCheckResult]: Stem: 2909#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2910#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 2918#L367 assume !(main_~length~0#1 < 1); 2911#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 2912#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 2913#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2919#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2970#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2920#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2921#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2922#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2994#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 2992#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 2991#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 2990#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 2952#L370-4 main_~j~0#1 := 0; 2917#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2972#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2929#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2933#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 2928#L378-2 [2021-11-20 06:09:24,565 INFO L793 eck$LassoCheckResult]: Loop: 2928#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 2930#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 2928#L378-2 [2021-11-20 06:09:24,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash -559282904, now seen corresponding path program 6 times [2021-11-20 06:09:24,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:24,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510426465] [2021-11-20 06:09:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:24,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:24,580 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:09:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:24,591 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:09:24,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 14 times [2021-11-20 06:09:24,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:24,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795184438] [2021-11-20 06:09:24,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:24,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:24,595 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:09:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:24,598 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:09:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:24,598 INFO L85 PathProgramCache]: Analyzing trace with hash -599957397, now seen corresponding path program 6 times [2021-11-20 06:09:24,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:24,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412737890] [2021-11-20 06:09:24,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:24,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:24,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:09:24,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412737890] [2021-11-20 06:09:24,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412737890] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:09:24,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185775218] [2021-11-20 06:09:24,718 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-11-20 06:09:24,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:09:24,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:09:24,729 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:09:24,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2021-11-20 06:09:24,783 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-11-20 06:09:24,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:09:24,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-20 06:09:24,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:09:24,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-20 06:09:25,152 INFO L354 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2021-11-20 06:09:25,152 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 34 treesize of output 21 [2021-11-20 06:09:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:25,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:09:25,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 28 [2021-11-20 06:09:25,516 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 49 treesize of output 43 [2021-11-20 06:09:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:25,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185775218] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:09:25,543 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-20 06:09:25,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 28 [2021-11-20 06:09:25,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981312726] [2021-11-20 06:09:25,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-20 06:09:25,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:09:25,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-11-20 06:09:25,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2021-11-20 06:09:25,593 INFO L87 Difference]: Start difference. First operand 86 states and 125 transitions. cyclomatic complexity: 50 Second operand has 29 states, 28 states have (on average 1.75) internal successors, (49), 29 states have internal predecessors, (49), 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:09:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:09:26,186 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2021-11-20 06:09:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-11-20 06:09:26,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 154 transitions. [2021-11-20 06:09:26,211 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2021-11-20 06:09:26,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 154 transitions. [2021-11-20 06:09:26,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-11-20 06:09:26,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-11-20 06:09:26,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 154 transitions. [2021-11-20 06:09:26,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-20 06:09:26,213 INFO L681 BuchiCegarLoop]: Abstraction has 111 states and 154 transitions. [2021-11-20 06:09:26,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 154 transitions. [2021-11-20 06:09:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 94. [2021-11-20 06:09:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 93 states have internal predecessors, (135), 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:09:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2021-11-20 06:09:26,223 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 135 transitions. [2021-11-20 06:09:26,223 INFO L587 BuchiCegarLoop]: Abstraction has 94 states and 135 transitions. [2021-11-20 06:09:26,223 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-11-20 06:09:26,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 135 transitions. [2021-11-20 06:09:26,223 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2021-11-20 06:09:26,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:09:26,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:09:26,224 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:09:26,224 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:09:26,224 INFO L791 eck$LassoCheckResult]: Stem: 3302#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3303#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3310#L367 assume !(main_~length~0#1 < 1); 3304#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3305#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3306#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3311#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3316#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3312#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3313#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3315#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3390#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3387#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3386#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3385#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3307#L370-4 main_~j~0#1 := 0; 3308#L378-2 [2021-11-20 06:09:26,225 INFO L793 eck$LassoCheckResult]: Loop: 3308#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3309#L378 assume !(main_#t~mem210#1 > 0);havoc main_#t~mem210#1;main_#t~post212#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post212#1;havoc main_#t~post212#1; 3308#L378-2 [2021-11-20 06:09:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:26,225 INFO L85 PathProgramCache]: Analyzing trace with hash 649647838, now seen corresponding path program 2 times [2021-11-20 06:09:26,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:26,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757126198] [2021-11-20 06:09:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:26,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:26,237 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:09:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:26,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:09:26,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:26,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2310, now seen corresponding path program 1 times [2021-11-20 06:09:26,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:26,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339822053] [2021-11-20 06:09:26,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:26,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:26,257 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:09:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:26,259 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:09:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:26,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1541315747, now seen corresponding path program 7 times [2021-11-20 06:09:26,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:26,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81044895] [2021-11-20 06:09:26,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:26,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:26,272 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:09:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:09:26,296 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:09:26,755 INFO L210 LassoAnalysis]: Preferences: [2021-11-20 06:09:26,755 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-11-20 06:09:26,755 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-11-20 06:09:26,756 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-11-20 06:09:26,756 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-11-20 06:09:26,756 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:09:26,756 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-11-20 06:09:26,756 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-11-20 06:09:26,756 INFO L133 ssoRankerPreferences]: Filename of dumped script: array13_alloca.i_Iteration16_Lasso [2021-11-20 06:09:26,756 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-11-20 06:09:26,756 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-11-20 06:09:26,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:09:26,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:09:26,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:09:26,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:09:26,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:09:26,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:09:26,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:09:26,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:09:26,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:09:26,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:09:26,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-11-20 06:09:27,049 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-11-20 06:09:27,049 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-11-20 06:09:27,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:09:27,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:09:27,052 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:09:27,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-11-20 06:09:27,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:09:27,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:09:27,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:09:27,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:09:27,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:09:27,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:09:27,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:09:27,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:09:27,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:09:27,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-11-20 06:09:27,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:09:27,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:09:27,086 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:09:27,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-11-20 06:09:27,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:09:27,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:09:27,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:09:27,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:09:27,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:09:27,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:09:27,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:09:27,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:09:27,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:09:27,118 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-11-20 06:09:27,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:09:27,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:09:27,120 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:09:27,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-11-20 06:09:27,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:09:27,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:09:27,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-11-20 06:09:27,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:09:27,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:09:27,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:09:27,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-11-20 06:09:27,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-11-20 06:09:27,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:09:27,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-11-20 06:09:27,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:09:27,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:09:27,157 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:09:27,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-11-20 06:09:27,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:09:27,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:09:27,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:09:27,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:09:27,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:09:27,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:09:27,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:09:27,174 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-11-20 06:09:27,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-11-20 06:09:27,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:09:27,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:09:27,200 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:09:27,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-11-20 06:09:27,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-11-20 06:09:27,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-11-20 06:09:27,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-11-20 06:09:27,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-11-20 06:09:27,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-11-20 06:09:27,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-11-20 06:09:27,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-11-20 06:09:27,230 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-11-20 06:09:27,243 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-11-20 06:09:27,243 INFO L444 ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. [2021-11-20 06:09:27,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-11-20 06:09:27,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:09:27,244 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-11-20 06:09:27,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-11-20 06:09:27,247 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-11-20 06:09:27,256 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-11-20 06:09:27,256 INFO L513 LassoAnalysis]: Proved termination. [2021-11-20 06:09:27,256 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0#1.offset, v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2, ULTIMATE.start_main_~j~0#1) = -1*ULTIMATE.start_main_~arr~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0#1.base)_2 - 4*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2021-11-20 06:09:27,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-11-20 06:09:27,290 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2021-11-20 06:09:27,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:27,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 06:09:27,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:09:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:27,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 06:09:27,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:09:27,396 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:09:27,397 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-11-20 06:09:27,397 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 135 transitions. cyclomatic complexity: 53 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:09:27,412 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 135 transitions. cyclomatic complexity: 53. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) Result 106 states and 152 transitions. Complement of second has 5 states. [2021-11-20 06:09:27,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-11-20 06:09:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:09:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2021-11-20 06:09:27,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 16 letters. Loop has 2 letters. [2021-11-20 06:09:27,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:09:27,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 18 letters. Loop has 2 letters. [2021-11-20 06:09:27,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:09:27,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 16 letters. Loop has 4 letters. [2021-11-20 06:09:27,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-11-20 06:09:27,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 152 transitions. [2021-11-20 06:09:27,416 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:09:27,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 98 states and 140 transitions. [2021-11-20 06:09:27,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-11-20 06:09:27,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-11-20 06:09:27,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 140 transitions. [2021-11-20 06:09:27,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-11-20 06:09:27,418 INFO L681 BuchiCegarLoop]: Abstraction has 98 states and 140 transitions. [2021-11-20 06:09:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 140 transitions. [2021-11-20 06:09:27,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2021-11-20 06:09:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.4421052631578948) internal successors, (137), 94 states have internal predecessors, (137), 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:09:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2021-11-20 06:09:27,422 INFO L704 BuchiCegarLoop]: Abstraction has 95 states and 137 transitions. [2021-11-20 06:09:27,422 INFO L587 BuchiCegarLoop]: Abstraction has 95 states and 137 transitions. [2021-11-20 06:09:27,422 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-11-20 06:09:27,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 137 transitions. [2021-11-20 06:09:27,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-11-20 06:09:27,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-11-20 06:09:27,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-11-20 06:09:27,423 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:09:27,424 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-11-20 06:09:27,424 INFO L791 eck$LassoCheckResult]: Stem: 3589#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3590#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet205#1, main_#t~malloc206#1.base, main_#t~malloc206#1.offset, main_#t~nondet208#1, main_#t~mem209#1, main_#t~post207#1, main_#t~mem210#1, main_#t~post211#1, main_#t~post212#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~arr~0#1.base, main_~arr~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet205#1;havoc main_#t~nondet205#1; 3600#L367 assume !(main_~length~0#1 < 1); 3591#L367-2 call main_#t~malloc206#1.base, main_#t~malloc206#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc206#1.base, main_#t~malloc206#1.offset; 3592#L369 assume !(main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0);main_~i~0#1 := 0; 3593#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3601#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3659#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3658#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3656#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3654#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3651#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3648#L372 assume !(main_#t~mem209#1 > 0);havoc main_#t~mem209#1; 3646#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3643#L370-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet208#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet208#1;call main_#t~mem209#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3641#L372 assume main_#t~mem209#1 > 0;havoc main_#t~mem209#1;call write~int(0, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4); 3626#L370-2 main_#t~post207#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post207#1;havoc main_#t~post207#1; 3629#L370-3 assume !(main_~i~0#1 < main_~length~0#1); 3594#L370-4 main_~j~0#1 := 0; 3595#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3596#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3597#L378-2 [2021-11-20 06:09:27,424 INFO L793 eck$LassoCheckResult]: Loop: 3597#L378-2 assume !!(0 <= main_~j~0#1 && main_~j~0#1 < main_~length~0#1);call main_#t~mem210#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~j~0#1, 4); 3660#L378 assume main_#t~mem210#1 > 0;havoc main_#t~mem210#1;main_#t~post211#1 := main_~j~0#1;main_~j~0#1 := main_#t~post211#1 - 1;havoc main_#t~post211#1; 3597#L378-2 [2021-11-20 06:09:27,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash 95390747, now seen corresponding path program 4 times [2021-11-20 06:09:27,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:09:27,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067560273] [2021-11-20 06:09:27,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:09:27,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:09:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:09:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:27,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:09:27,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067560273] [2021-11-20 06:09:27,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067560273] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-20 06:09:27,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415883133] [2021-11-20 06:09:27,656 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:09:27,656 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-20 06:09:27,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:09:27,657 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-20 06:09:27,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2021-11-20 06:09:27,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ad5334a-eb9b-47b3-ab3d-9606caea420b/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2021-11-20 06:09:27,754 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:09:27,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:09:27,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-20 06:09:27,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:09:27,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-20 06:09:27,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:09:27,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:09:27,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:09:27,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:09:27,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-20 06:09:27,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-20 06:09:27,996 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-20 06:09:27,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2021-11-20 06:09:28,124 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-11-20 06:09:28,125 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 27 treesize of output 13 [2021-11-20 06:09:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:09:28,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:09:28,736 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_98| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (<= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0))) is different from false [2021-11-20 06:09:40,813 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_98| (+ |v_ULTIMATE.start_main_~i~0#1_99| 1)) (<= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_99| 4)) |ULTIMATE.start_main_#t~nondet208#1|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0))) (< |v_ULTIMATE.start_main_~i~0#1_99| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-11-20 06:09:49,359 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_#t~nondet208#1_64| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_98| (+ |v_ULTIMATE.start_main_~i~0#1_99| 1)) (<= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)) |ULTIMATE.start_main_#t~nondet208#1|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_99| 4)) |v_ULTIMATE.start_main_#t~nondet208#1_64|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_99| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-11-20 06:10:01,458 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (|v_ULTIMATE.start_main_#t~nondet208#1_64| Int) (|ULTIMATE.start_main_#t~nondet208#1| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_98| (+ |v_ULTIMATE.start_main_~i~0#1_99| 1)) (< |v_ULTIMATE.start_main_~i~0#1_99| (+ |v_ULTIMATE.start_main_~i~0#1_100| 1)) (<= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_100| 4) |c_ULTIMATE.start_main_~arr~0#1.offset|) |ULTIMATE.start_main_#t~nondet208#1|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_99| 4)) |v_ULTIMATE.start_main_#t~nondet208#1_64|) (+ |c_ULTIMATE.start_main_~arr~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 4)) 0) |c_ULTIMATE.start_main_~arr~0#1.offset|) 0))) (< |v_ULTIMATE.start_main_~i~0#1_100| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2021-11-20 06:10:13,620 WARN L227 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-20 06:10:13,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 52 [2021-11-20 06:10:13,659 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 33456 treesize of output 33200