./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:13:59,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:13:59,913 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 18:13:59,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:13:59,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:13:59,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:13:59,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:13:59,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:13:59,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:13:59,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:13:59,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:13:59,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:13:59,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:13:59,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:13:59,955 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:13:59,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:13:59,956 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:13:59,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:13:59,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:13:59,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:13:59,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:13:59,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:13:59,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:13:59,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:13:59,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:13:59,961 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:13:59,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:13:59,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:13:59,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:13:59,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:13:59,967 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:13:59,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:13:59,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:13:59,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:13:59,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:13:59,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:13:59,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:13:59,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:13:59,973 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:13:59,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:13:59,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:13:59,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:13:59,975 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/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_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(G ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d [2024-11-08 18:14:00,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:14:00,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:14:00,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:14:00,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:14:00,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:14:00,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i Unable to find full path for "g++" [2024-11-08 18:14:02,877 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:14:03,123 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:14:03,124 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-08 18:14:03,135 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/data/232a359f0/15ad9320283a4629a79bb47deda7758c/FLAG4be4d1e51 [2024-11-08 18:14:03,152 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/data/232a359f0/15ad9320283a4629a79bb47deda7758c [2024-11-08 18:14:03,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:14:03,157 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:14:03,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:14:03,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:14:03,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:14:03,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10105111 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03, skipping insertion in model container [2024-11-08 18:14:03,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:14:03,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-11-08 18:14:03,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:14:03,481 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:14:03,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-11-08 18:14:03,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:14:03,549 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:14:03,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03 WrapperNode [2024-11-08 18:14:03,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:14:03,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:14:03,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:14:03,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:14:03,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,608 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-08 18:14:03,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:14:03,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:14:03,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:14:03,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:14:03,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,643 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:14:03,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:14:03,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:14:03,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:14:03,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:14:03,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (1/1) ... [2024-11-08 18:14:03,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:14:03,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:14:03,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:14:03,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:14:03,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:14:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:14:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:14:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:14:03,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:14:03,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:14:03,914 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:14:03,918 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:14:04,495 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-08 18:14:04,495 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:14:04,521 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:14:04,521 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:14:04,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:14:04 BoogieIcfgContainer [2024-11-08 18:14:04,522 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:14:04,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:14:04,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:14:04,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:14:04,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:14:03" (1/3) ... [2024-11-08 18:14:04,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e92a93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:14:04, skipping insertion in model container [2024-11-08 18:14:04,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:03" (2/3) ... [2024-11-08 18:14:04,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e92a93e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:14:04, skipping insertion in model container [2024-11-08 18:14:04,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:14:04" (3/3) ... [2024-11-08 18:14:04,540 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-08 18:14:04,564 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:14:04,564 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:14:04,665 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:14:04,672 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71c5bb7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:14:04,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:14:04,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:14:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:14:04,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:04,694 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:04,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:04,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:04,701 INFO L85 PathProgramCache]: Analyzing trace with hash 789923315, now seen corresponding path program 1 times [2024-11-08 18:14:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:04,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117250076] [2024-11-08 18:14:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:04,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:14:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:14:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:14:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:14:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:14:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:14:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:14:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:14:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:14:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:14:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:14:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:14:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:14:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:14:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:14:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:14:05,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:05,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117250076] [2024-11-08 18:14:05,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117250076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:05,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:05,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:14:05,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323957432] [2024-11-08 18:14:05,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:05,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:14:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:05,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:14:05,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:14:05,421 INFO L87 Difference]: Start difference. First operand has 75 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 18:14:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:05,466 INFO L93 Difference]: Finished difference Result 147 states and 232 transitions. [2024-11-08 18:14:05,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:14:05,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 109 [2024-11-08 18:14:05,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:05,480 INFO L225 Difference]: With dead ends: 147 [2024-11-08 18:14:05,480 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 18:14:05,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:14:05,488 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:05,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:14:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 18:14:05,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 18:14:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:14:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 103 transitions. [2024-11-08 18:14:05,557 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 103 transitions. Word has length 109 [2024-11-08 18:14:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:05,558 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 103 transitions. [2024-11-08 18:14:05,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-08 18:14:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 103 transitions. [2024-11-08 18:14:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 18:14:05,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:05,565 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:05,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:14:05,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:05,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash -343955027, now seen corresponding path program 1 times [2024-11-08 18:14:05,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:05,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113215312] [2024-11-08 18:14:05,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:05,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:14:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:14:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:14:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:14:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:14:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:14:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:14:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:14:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:14:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:14:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:14:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:14:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:14:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:14:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:14:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:05,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:14:05,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:05,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113215312] [2024-11-08 18:14:05,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113215312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:05,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:05,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:14:05,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381167369] [2024-11-08 18:14:05,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:05,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:14:05,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:05,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:14:05,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:14:05,979 INFO L87 Difference]: Start difference. First operand 71 states and 103 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:06,011 INFO L93 Difference]: Finished difference Result 140 states and 205 transitions. [2024-11-08 18:14:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:14:06,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-08 18:14:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:06,017 INFO L225 Difference]: With dead ends: 140 [2024-11-08 18:14:06,017 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 18:14:06,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:14:06,020 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:06,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:14:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 18:14:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-08 18:14:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:14:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 104 transitions. [2024-11-08 18:14:06,034 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 104 transitions. Word has length 109 [2024-11-08 18:14:06,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:06,036 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 104 transitions. [2024-11-08 18:14:06,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 104 transitions. [2024-11-08 18:14:06,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:14:06,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:06,039 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:06,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:14:06,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:06,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:06,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2009806704, now seen corresponding path program 1 times [2024-11-08 18:14:06,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:06,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352904493] [2024-11-08 18:14:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:06,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:14:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:14:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:14:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:14:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:14:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:14:09,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:14:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:14:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:14:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:14:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:14:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:14:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:14:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:14:09,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:14:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:14:09,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:09,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352904493] [2024-11-08 18:14:09,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352904493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:09,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:09,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:14:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976241169] [2024-11-08 18:14:09,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:09,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:14:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:09,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:14:09,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:14:09,817 INFO L87 Difference]: Start difference. First operand 72 states and 104 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:10,466 INFO L93 Difference]: Finished difference Result 183 states and 264 transitions. [2024-11-08 18:14:10,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:14:10,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 110 [2024-11-08 18:14:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:10,469 INFO L225 Difference]: With dead ends: 183 [2024-11-08 18:14:10,469 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 18:14:10,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:14:10,472 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 137 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:10,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 370 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 18:14:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 18:14:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2024-11-08 18:14:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:14:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-11-08 18:14:10,487 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 110 [2024-11-08 18:14:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:10,488 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-11-08 18:14:10,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-11-08 18:14:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:14:10,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:10,491 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:10,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:14:10,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:10,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash 596216850, now seen corresponding path program 1 times [2024-11-08 18:14:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:10,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278346639] [2024-11-08 18:14:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:10,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:14:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:14:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:14:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:14:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:14:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:14:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:14:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:14:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:14:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:14:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:14:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:14:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:14:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:14:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:14:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:14:14,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:14,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278346639] [2024-11-08 18:14:14,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278346639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:14,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:14,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:14:14,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420899717] [2024-11-08 18:14:14,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:14,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:14:14,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:14,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:14:14,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:14:14,149 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:15,794 INFO L93 Difference]: Finished difference Result 271 states and 395 transitions. [2024-11-08 18:14:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:14:15,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 110 [2024-11-08 18:14:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:15,799 INFO L225 Difference]: With dead ends: 271 [2024-11-08 18:14:15,799 INFO L226 Difference]: Without dead ends: 178 [2024-11-08 18:14:15,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:14:15,802 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 137 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:15,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 422 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 18:14:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-08 18:14:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 98. [2024-11-08 18:14:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:14:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2024-11-08 18:14:15,831 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 110 [2024-11-08 18:14:15,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:15,832 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2024-11-08 18:14:15,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:15,833 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2024-11-08 18:14:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 18:14:15,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:15,838 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:15,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:14:15,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:15,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:15,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1018918676, now seen corresponding path program 1 times [2024-11-08 18:14:15,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:15,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823529579] [2024-11-08 18:14:15,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:15,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:14:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:14:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:14:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:14:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:14:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:14:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:14:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:14:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:14:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:14:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:14:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:14:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:14:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:14:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:14:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:17,344 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:14:17,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:17,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823529579] [2024-11-08 18:14:17,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823529579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:17,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:17,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:14:17,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711616499] [2024-11-08 18:14:17,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:17,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:14:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:17,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:14:17,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:14:17,349 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:18,271 INFO L93 Difference]: Finished difference Result 237 states and 346 transitions. [2024-11-08 18:14:18,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:14:18,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 110 [2024-11-08 18:14:18,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:18,276 INFO L225 Difference]: With dead ends: 237 [2024-11-08 18:14:18,276 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 18:14:18,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:14:18,279 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 137 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:18,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 478 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:14:18,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 18:14:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 74. [2024-11-08 18:14:18,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:14:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2024-11-08 18:14:18,290 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 110 [2024-11-08 18:14:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:18,291 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2024-11-08 18:14:18,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-11-08 18:14:18,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:14:18,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:18,295 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:18,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:14:18,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:18,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:18,296 INFO L85 PathProgramCache]: Analyzing trace with hash 762586539, now seen corresponding path program 1 times [2024-11-08 18:14:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:18,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231063582] [2024-11-08 18:14:18,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:18,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:14:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:14:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:14:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:14:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:14:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:14:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:14:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:14:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:14:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:14:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:14:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:14:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:14:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:14:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:14:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-08 18:14:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:18,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231063582] [2024-11-08 18:14:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231063582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:14:18,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297759735] [2024-11-08 18:14:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:18,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:14:18,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:14:18,635 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:14:18,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 18:14:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:18,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 18:14:18,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:14:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-08 18:14:19,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:14:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-08 18:14:19,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297759735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:14:19,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:14:19,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-08 18:14:19,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299325639] [2024-11-08 18:14:19,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:14:19,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 18:14:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:19,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 18:14:19,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:14:19,494 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-08 18:14:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:19,825 INFO L93 Difference]: Finished difference Result 155 states and 217 transitions. [2024-11-08 18:14:19,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 18:14:19,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 112 [2024-11-08 18:14:19,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:19,827 INFO L225 Difference]: With dead ends: 155 [2024-11-08 18:14:19,828 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 18:14:19,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:14:19,829 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 325 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:19,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 173 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:14:19,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 18:14:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-08 18:14:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 63 states have internal predecessors, (81), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:14:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2024-11-08 18:14:19,848 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 112 [2024-11-08 18:14:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:19,848 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2024-11-08 18:14:19,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-08 18:14:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2024-11-08 18:14:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:14:19,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:19,851 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:19,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 18:14:20,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 18:14:20,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:20,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:20,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1231558167, now seen corresponding path program 1 times [2024-11-08 18:14:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691408671] [2024-11-08 18:14:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 18:14:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1449970812] [2024-11-08 18:14:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:20,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:14:20,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:14:20,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:14:20,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 18:14:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:20,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 18:14:20,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:14:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 200 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-08 18:14:21,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:14:21,707 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-08 18:14:21,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:21,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691408671] [2024-11-08 18:14:21,709 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 18:14:21,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449970812] [2024-11-08 18:14:21,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449970812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:14:21,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:14:21,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-11-08 18:14:21,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784545834] [2024-11-08 18:14:21,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:14:21,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:14:21,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:21,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:14:21,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:14:21,713 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-08 18:14:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:22,880 INFO L93 Difference]: Finished difference Result 257 states and 336 transitions. [2024-11-08 18:14:22,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 18:14:22,882 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 112 [2024-11-08 18:14:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:22,884 INFO L225 Difference]: With dead ends: 257 [2024-11-08 18:14:22,884 INFO L226 Difference]: Without dead ends: 178 [2024-11-08 18:14:22,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2024-11-08 18:14:22,886 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 468 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:22,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 571 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:14:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-08 18:14:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 121. [2024-11-08 18:14:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:14:22,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 163 transitions. [2024-11-08 18:14:22,912 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 163 transitions. Word has length 112 [2024-11-08 18:14:22,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:22,913 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 163 transitions. [2024-11-08 18:14:22,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.235294117647059) internal successors, (72), 17 states have internal predecessors, (72), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-11-08 18:14:22,914 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 163 transitions. [2024-11-08 18:14:22,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:14:22,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:22,915 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:22,944 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 18:14:23,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:14:23,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:23,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:23,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1662536192, now seen corresponding path program 1 times [2024-11-08 18:14:23,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:23,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446326666] [2024-11-08 18:14:23,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:23,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:14:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:14:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:14:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:14:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:14:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:14:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:14:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:14:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:14:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:14:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:14:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:14:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:14:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:14:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:14:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:14:23,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:23,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446326666] [2024-11-08 18:14:23,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446326666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:23,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:23,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:14:23,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137330195] [2024-11-08 18:14:23,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:23,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:14:23,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:23,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:14:23,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:14:23,266 INFO L87 Difference]: Start difference. First operand 121 states and 163 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:23,338 INFO L93 Difference]: Finished difference Result 291 states and 388 transitions. [2024-11-08 18:14:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:14:23,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-08 18:14:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:23,341 INFO L225 Difference]: With dead ends: 291 [2024-11-08 18:14:23,341 INFO L226 Difference]: Without dead ends: 173 [2024-11-08 18:14:23,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:14:23,343 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 83 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:23,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 194 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:14:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-08 18:14:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 121. [2024-11-08 18:14:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.306930693069307) internal successors, (132), 101 states have internal predecessors, (132), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:14:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 162 transitions. [2024-11-08 18:14:23,367 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 162 transitions. Word has length 112 [2024-11-08 18:14:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:23,368 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 162 transitions. [2024-11-08 18:14:23,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 162 transitions. [2024-11-08 18:14:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:14:23,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:23,373 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:23,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:14:23,373 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:23,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1360770912, now seen corresponding path program 1 times [2024-11-08 18:14:23,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:23,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138611198] [2024-11-08 18:14:23,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:14:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:14:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:14:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:14:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:14:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:14:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:14:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:14:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:14:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:14:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:14:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:14:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:14:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:14:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:14:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:14:24,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:24,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138611198] [2024-11-08 18:14:24,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138611198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:24,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:24,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:14:24,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120539591] [2024-11-08 18:14:24,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:24,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:14:24,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:24,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:14:24,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:14:24,830 INFO L87 Difference]: Start difference. First operand 121 states and 162 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:25,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:25,750 INFO L93 Difference]: Finished difference Result 484 states and 636 transitions. [2024-11-08 18:14:25,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:14:25,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-08 18:14:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:25,753 INFO L225 Difference]: With dead ends: 484 [2024-11-08 18:14:25,753 INFO L226 Difference]: Without dead ends: 366 [2024-11-08 18:14:25,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 18:14:25,755 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 206 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:25,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 542 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:14:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-08 18:14:25,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2024-11-08 18:14:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 206 states have (on average 1.3203883495145632) internal successors, (272), 207 states have internal predecessors, (272), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 18:14:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 324 transitions. [2024-11-08 18:14:25,801 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 324 transitions. Word has length 112 [2024-11-08 18:14:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:25,802 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 324 transitions. [2024-11-08 18:14:25,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 324 transitions. [2024-11-08 18:14:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-08 18:14:25,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:25,806 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:25,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:14:25,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:25,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:25,807 INFO L85 PathProgramCache]: Analyzing trace with hash -938069086, now seen corresponding path program 1 times [2024-11-08 18:14:25,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:25,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608591025] [2024-11-08 18:14:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:25,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:14:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:14:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:14:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:14:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:14:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:14:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:14:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:14:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:14:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:14:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:14:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:14:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:14:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:14:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:14:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:14:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:26,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608591025] [2024-11-08 18:14:26,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608591025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:26,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:26,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:14:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650202179] [2024-11-08 18:14:26,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:26,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:14:26,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:26,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:14:26,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:14:26,413 INFO L87 Difference]: Start difference. First operand 241 states and 324 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:27,078 INFO L93 Difference]: Finished difference Result 703 states and 924 transitions. [2024-11-08 18:14:27,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:14:27,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 112 [2024-11-08 18:14:27,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:27,084 INFO L225 Difference]: With dead ends: 703 [2024-11-08 18:14:27,084 INFO L226 Difference]: Without dead ends: 465 [2024-11-08 18:14:27,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:14:27,087 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 114 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:27,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 556 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:14:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-08 18:14:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 248. [2024-11-08 18:14:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 213 states have (on average 1.323943661971831) internal successors, (282), 214 states have internal predecessors, (282), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 18:14:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 334 transitions. [2024-11-08 18:14:27,134 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 334 transitions. Word has length 112 [2024-11-08 18:14:27,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:27,135 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 334 transitions. [2024-11-08 18:14:27,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 334 transitions. [2024-11-08 18:14:27,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 18:14:27,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:27,138 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:27,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:14:27,138 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:27,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash 479623345, now seen corresponding path program 1 times [2024-11-08 18:14:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930302041] [2024-11-08 18:14:27,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:27,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:14:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:14:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:14:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:14:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:14:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:14:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:14:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:14:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:14:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:14:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:14:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:14:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:14:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:14:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:14:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:14:30,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930302041] [2024-11-08 18:14:30,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930302041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:30,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:30,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 18:14:30,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690848850] [2024-11-08 18:14:30,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:30,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:14:30,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:30,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:14:30,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:14:30,893 INFO L87 Difference]: Start difference. First operand 248 states and 334 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:33,572 INFO L93 Difference]: Finished difference Result 697 states and 925 transitions. [2024-11-08 18:14:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 18:14:33,573 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2024-11-08 18:14:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:33,576 INFO L225 Difference]: With dead ends: 697 [2024-11-08 18:14:33,576 INFO L226 Difference]: Without dead ends: 452 [2024-11-08 18:14:33,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:14:33,578 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 426 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:33,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 647 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-08 18:14:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-08 18:14:33,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 304. [2024-11-08 18:14:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 269 states have (on average 1.3234200743494424) internal successors, (356), 270 states have internal predecessors, (356), 26 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 18:14:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 408 transitions. [2024-11-08 18:14:33,626 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 408 transitions. Word has length 113 [2024-11-08 18:14:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:33,627 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 408 transitions. [2024-11-08 18:14:33,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 408 transitions. [2024-11-08 18:14:33,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 18:14:33,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:33,630 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:33,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:14:33,630 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:33,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash 781388625, now seen corresponding path program 1 times [2024-11-08 18:14:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:33,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125544934] [2024-11-08 18:14:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 18:14:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 18:14:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 18:14:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 18:14:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 18:14:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 18:14:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 18:14:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 18:14:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 18:14:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 18:14:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 18:14:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 18:14:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 18:14:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 18:14:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 18:14:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:14:34,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:14:34,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125544934] [2024-11-08 18:14:34,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125544934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:34,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:34,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:14:34,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740059630] [2024-11-08 18:14:34,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:34,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:14:34,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:14:34,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:14:34,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:14:34,296 INFO L87 Difference]: Start difference. First operand 304 states and 408 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:35,446 INFO L93 Difference]: Finished difference Result 883 states and 1179 transitions. [2024-11-08 18:14:35,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:14:35,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 113 [2024-11-08 18:14:35,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:35,451 INFO L225 Difference]: With dead ends: 883 [2024-11-08 18:14:35,452 INFO L226 Difference]: Without dead ends: 582 [2024-11-08 18:14:35,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:14:35,453 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 180 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:35,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 630 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 18:14:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2024-11-08 18:14:35,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 488. [2024-11-08 18:14:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 419 states have (on average 1.2840095465393795) internal successors, (538), 421 states have internal predecessors, (538), 52 states have call successors, (52), 16 states have call predecessors, (52), 16 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 18:14:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 642 transitions. [2024-11-08 18:14:35,547 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 642 transitions. Word has length 113 [2024-11-08 18:14:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:35,548 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 642 transitions. [2024-11-08 18:14:35,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 642 transitions. [2024-11-08 18:14:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 18:14:35,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:35,551 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:35,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:14:35,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:35,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1714978218, now seen corresponding path program 1 times [2024-11-08 18:14:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:14:35,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339356610] [2024-11-08 18:14:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:14:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 18:14:35,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1169524169] [2024-11-08 18:14:35,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:35,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:14:35,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:14:35,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:14:35,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 18:14:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:14:36,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:14:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:14:36,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:14:36,296 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:14:36,297 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:14:36,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 18:14:36,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 18:14:36,510 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:36,647 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:14:36,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:14:36 BoogieIcfgContainer [2024-11-08 18:14:36,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:14:36,655 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:14:36,655 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:14:36,656 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:14:36,656 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:14:04" (3/4) ... [2024-11-08 18:14:36,660 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:14:36,662 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:14:36,662 INFO L158 Benchmark]: Toolchain (without parser) took 33505.17ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 133.7MB in the beginning and 122.4MB in the end (delta: 11.3MB). Peak memory consumption was 146.6MB. Max. memory is 16.1GB. [2024-11-08 18:14:36,663 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 138.4MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:14:36,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.37ms. Allocated memory is still 176.2MB. Free memory was 133.0MB in the beginning and 118.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 18:14:36,664 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.71ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 114.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:14:36,664 INFO L158 Benchmark]: Boogie Preprocessor took 53.22ms. Allocated memory is still 176.2MB. Free memory was 114.8MB in the beginning and 112.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:14:36,665 INFO L158 Benchmark]: RCFGBuilder took 858.16ms. Allocated memory is still 176.2MB. Free memory was 112.0MB in the beginning and 89.7MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 18:14:36,666 INFO L158 Benchmark]: TraceAbstraction took 32128.73ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 89.0MB in the beginning and 122.4MB in the end (delta: -33.4MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2024-11-08 18:14:36,666 INFO L158 Benchmark]: Witness Printer took 6.45ms. Allocated memory is still 308.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:14:36,669 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 138.4MB. Free memory is still 84.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.37ms. Allocated memory is still 176.2MB. Free memory was 133.0MB in the beginning and 118.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.71ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 114.8MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.22ms. Allocated memory is still 176.2MB. Free memory was 114.8MB in the beginning and 112.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 858.16ms. Allocated memory is still 176.2MB. Free memory was 112.0MB in the beginning and 89.7MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 32128.73ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 89.0MB in the beginning and 122.4MB in the end (delta: -33.4MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. * Witness Printer took 6.45ms. Allocated memory is still 308.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of shiftLeft at line 119. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] isInitial = 1 [L124] FCALL initially() [L125] int k_loop; [L126] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] COND FALSE !(k_loop < 1) VAL [isInitial=1, k_loop=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] COND TRUE k_loop < 1 [L127] CALL updateLastVariables() [L114] last_1_var_1_10 = var_1_10 [L115] last_1_var_1_12 = var_1_12 [L116] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] var_1_5 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L96] var_1_6 = __VERIFIER_nondet_char() [L97] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L97] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L98] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L99] var_1_7 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L102] var_1_8 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L103] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0, var_1_9=9/5] [L104] var_1_9 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L105] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L106] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L108] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L108] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L109] var_1_15 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L110] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L111] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L128] RET updateVariables() [L129] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L45] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L46] COND TRUE var_1_6 <= stepLocal_2 [L47] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L60] var_1_18 = var_1_3 [L61] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L62] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L63] COND FALSE !((- var_1_9) <= var_1_8) [L76] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L78] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L79] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L79] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L80] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=6, stepLocal_4=6, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L129] RET step() [L130] CALL, EXPR property() [L119] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L119] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L119] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L119] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L119-L120] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=6, var_1_11=6, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=6, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=7, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2219 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2213 mSDsluCounter, 4890 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3480 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3504 IncrementalHoareTripleChecker+Invalid, 3632 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 1410 mSDtfsCounter, 3504 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 912 GetRequests, 806 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=12, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 861 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 1784 NumberOfCodeBlocks, 1784 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1655 ConstructedInterpolants, 0 QuantifiedInterpolants, 7362 SizeOfPredicates, 8 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 6114/6300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 18:14:36,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 18:14:39,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:14:39,642 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 18:14:39,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:14:39,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:14:39,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:14:39,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:14:39,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:14:39,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:14:39,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:14:39,712 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:14:39,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:14:39,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:14:39,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:14:39,715 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:14:39,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:14:39,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:14:39,720 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 18:14:39,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 18:14:39,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:14:39,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:14:39,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:14:39,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:14:39,726 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:14:39,726 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:14:39,727 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:14:39,727 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:14:39,728 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 18:14:39,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:14:39,728 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:14:39,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:14:39,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:14:39,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:14:39,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:14:39,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:14:39,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:14:39,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:14:39,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:14:39,732 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 18:14:39,733 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:14:39,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:14:39,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:14:39,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:14:39,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:14:39,736 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/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_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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(G ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebb38d1aa1a2498e8dd2ecd9a3521f2ac13c8472d6bd13f73b3a1fb427f0239d [2024-11-08 18:14:40,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:14:40,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:14:40,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:14:40,266 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:14:40,267 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:14:40,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i Unable to find full path for "g++" [2024-11-08 18:14:42,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:14:43,004 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:14:43,005 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-08 18:14:43,018 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/data/224f1322b/6a893142a741445c9818c0edd6d69cd3/FLAG96923f102 [2024-11-08 18:14:43,037 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/data/224f1322b/6a893142a741445c9818c0edd6d69cd3 [2024-11-08 18:14:43,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:14:43,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:14:43,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:14:43,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:14:43,062 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:14:43,063 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e81384d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43, skipping insertion in model container [2024-11-08 18:14:43,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:14:43,400 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-11-08 18:14:43,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:14:43,536 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:14:43,556 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-9.i[914,927] [2024-11-08 18:14:43,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:14:43,687 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:14:43,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43 WrapperNode [2024-11-08 18:14:43,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:14:43,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:14:43,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:14:43,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:14:43,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,772 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-08 18:14:43,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:14:43,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:14:43,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:14:43,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:14:43,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:14:43,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:14:43,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:14:43,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:14:43,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:14:43,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (1/1) ... [2024-11-08 18:14:43,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:14:43,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:14:43,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 18:14:43,922 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 18:14:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:14:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:14:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 18:14:43,962 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 18:14:43,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:14:43,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:14:44,093 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:14:44,096 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:14:44,639 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 18:14:44,640 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:14:44,656 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:14:44,656 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 18:14:44,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:14:44 BoogieIcfgContainer [2024-11-08 18:14:44,657 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:14:44,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:14:44,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:14:44,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:14:44,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:14:43" (1/3) ... [2024-11-08 18:14:44,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47237f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:14:44, skipping insertion in model container [2024-11-08 18:14:44,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:14:43" (2/3) ... [2024-11-08 18:14:44,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47237f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:14:44, skipping insertion in model container [2024-11-08 18:14:44,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:14:44" (3/3) ... [2024-11-08 18:14:44,670 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-9.i [2024-11-08 18:14:44,693 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:14:44,694 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:14:44,791 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:14:44,799 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52b03ed1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:14:44,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:14:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:14:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-08 18:14:44,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:44,820 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:44,820 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:44,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2079282753, now seen corresponding path program 1 times [2024-11-08 18:14:44,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:14:44,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414624097] [2024-11-08 18:14:44,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:44,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:14:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:14:44,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:14:44,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 18:14:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:45,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 18:14:45,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:14:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-08 18:14:45,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:14:45,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 18:14:45,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414624097] [2024-11-08 18:14:45,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414624097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:14:45,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:14:45,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 18:14:45,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366987277] [2024-11-08 18:14:45,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:14:45,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 18:14:45,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 18:14:45,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 18:14:45,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:14:45,291 INFO L87 Difference]: Start difference. First operand has 56 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:14:45,337 INFO L93 Difference]: Finished difference Result 109 states and 178 transitions. [2024-11-08 18:14:45,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 18:14:45,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-08 18:14:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:14:45,348 INFO L225 Difference]: With dead ends: 109 [2024-11-08 18:14:45,348 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 18:14:45,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 18:14:45,357 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:14:45,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:14:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 18:14:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-08 18:14:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-08 18:14:45,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-11-08 18:14:45,417 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 101 [2024-11-08 18:14:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:14:45,420 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-11-08 18:14:45,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-08 18:14:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-11-08 18:14:45,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-08 18:14:45,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:14:45,427 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:14:45,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 18:14:45,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:14:45,632 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:14:45,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:14:45,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2079329263, now seen corresponding path program 1 times [2024-11-08 18:14:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 18:14:45,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328778693] [2024-11-08 18:14:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:14:45,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:14:45,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 18:14:45,640 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 18:14:45,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4776f1b8-a7d3-4c7e-b7c9-551667507222/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 18:14:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:14:45,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 18:14:45,941 INFO L278 TraceCheckSpWp]: Computing forward predicates...