./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ --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 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:42:24,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:42:24,328 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 21:42:24,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:42:24,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:42:24,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:42:24,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:42:24,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:42:24,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 21:42:24,383 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 21:42:24,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:42:24,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:42:24,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:42:24,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:42:24,387 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:42:24,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:42:24,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:42:24,389 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:42:24,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:42:24,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:42:24,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:42:24,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:42:24,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:42:24,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:42:24,393 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:42:24,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:42:24,394 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:42:24,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:42:24,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:42:24,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:42:24,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:42:24,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:42:24,398 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:42:24,398 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:42:24,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:42:24,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:42:24,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:42:24,399 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:42:24,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:42:24,399 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:42:24,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:42:24,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:42:24,404 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_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/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_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ 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 -> 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba [2023-11-23 21:42:24,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:42:24,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:42:24,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:42:24,808 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:42:24,809 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:42:24,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i [2023-11-23 21:42:27,982 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:42:28,310 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:42:28,311 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i [2023-11-23 21:42:28,323 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/data/f0976b280/a62ac2fca8594169949e32efe36bf746/FLAG68be40540 [2023-11-23 21:42:28,616 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/data/f0976b280/a62ac2fca8594169949e32efe36bf746 [2023-11-23 21:42:28,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:42:28,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:42:28,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:42:28,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:42:28,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:42:28,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:42:28" (1/1) ... [2023-11-23 21:42:28,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f42f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:28, skipping insertion in model container [2023-11-23 21:42:28,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:42:28" (1/1) ... [2023-11-23 21:42:28,688 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:42:28,900 WARN L240 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_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i[915,928] [2023-11-23 21:42:28,996 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:42:29,013 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:42:29,029 WARN L240 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_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i[915,928] [2023-11-23 21:42:29,074 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:42:29,092 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:42:29,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29 WrapperNode [2023-11-23 21:42:29,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:42:29,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:42:29,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:42:29,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:42:29,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,168 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2023-11-23 21:42:29,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:42:29,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:42:29,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:42:29,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:42:29,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,189 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,206 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 21:42:29,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:42:29,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:42:29,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:42:29,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:42:29,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (1/1) ... [2023-11-23 21:42:29,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:42:29,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:42:29,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:42:29,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:42:29,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:42:29,322 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 21:42:29,322 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 21:42:29,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 21:42:29,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:42:29,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:42:29,420 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:42:29,423 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:42:29,812 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:42:29,854 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:42:29,855 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 21:42:29,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:42:29 BoogieIcfgContainer [2023-11-23 21:42:29,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:42:29,859 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:42:29,859 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:42:29,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:42:29,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:42:28" (1/3) ... [2023-11-23 21:42:29,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ce4508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:42:29, skipping insertion in model container [2023-11-23 21:42:29,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:29" (2/3) ... [2023-11-23 21:42:29,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ce4508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:42:29, skipping insertion in model container [2023-11-23 21:42:29,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:42:29" (3/3) ... [2023-11-23 21:42:29,867 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-71.i [2023-11-23 21:42:29,886 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:42:29,886 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:42:29,944 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:42:29,953 INFO L357 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, mHoare=true, 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;@718ae8ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:42:29,953 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:42:29,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 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) [2023-11-23 21:42:29,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-23 21:42:29,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:29,976 INFO L195 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] [2023-11-23 21:42:29,977 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:29,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:29,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2037387495, now seen corresponding path program 1 times [2023-11-23 21:42:29,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:29,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120472076] [2023-11-23 21:42:29,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:29,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 21:42:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 21:42:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 21:42:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 21:42:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:42:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:42:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:42:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:42:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-23 21:42:30,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:30,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120472076] [2023-11-23 21:42:30,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120472076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:30,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:30,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:42:30,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618505843] [2023-11-23 21:42:30,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:30,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 21:42:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:30,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 21:42:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 21:42:30,582 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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) [2023-11-23 21:42:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:30,670 INFO L93 Difference]: Finished difference Result 93 states and 159 transitions. [2023-11-23 21:42:30,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 21:42:30,674 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 95 [2023-11-23 21:42:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:30,687 INFO L225 Difference]: With dead ends: 93 [2023-11-23 21:42:30,688 INFO L226 Difference]: Without dead ends: 46 [2023-11-23 21:42:30,694 INFO L412 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 [2023-11-23 21:42:30,702 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:30,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:42:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-23 21:42:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-23 21:42:30,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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) [2023-11-23 21:42:30,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2023-11-23 21:42:30,777 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 95 [2023-11-23 21:42:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:30,778 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2023-11-23 21:42:30,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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) [2023-11-23 21:42:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2023-11-23 21:42:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-23 21:42:30,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:30,790 INFO L195 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] [2023-11-23 21:42:30,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:42:30,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:30,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:30,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1422500717, now seen corresponding path program 1 times [2023-11-23 21:42:30,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:30,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356660812] [2023-11-23 21:42:30,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 21:42:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 21:42:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 21:42:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 21:42:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:42:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:42:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:42:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:42:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-23 21:42:31,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:31,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356660812] [2023-11-23 21:42:31,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356660812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:31,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:31,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:42:31,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040111215] [2023-11-23 21:42:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:31,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:42:31,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:31,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:42:31,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:42:31,645 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2023-11-23 21:42:31,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:31,804 INFO L93 Difference]: Finished difference Result 96 states and 140 transitions. [2023-11-23 21:42:31,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:42:31,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 95 [2023-11-23 21:42:31,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:31,808 INFO L225 Difference]: With dead ends: 96 [2023-11-23 21:42:31,808 INFO L226 Difference]: Without dead ends: 51 [2023-11-23 21:42:31,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:42:31,811 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 26 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:31,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 136 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:42:31,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-23 21:42:31,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-23 21:42:31,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-23 21:42:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2023-11-23 21:42:31,832 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 95 [2023-11-23 21:42:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:31,836 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2023-11-23 21:42:31,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2023-11-23 21:42:31,837 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2023-11-23 21:42:31,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-23 21:42:31,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:31,846 INFO L195 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] [2023-11-23 21:42:31,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:42:31,847 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:31,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:31,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1097459217, now seen corresponding path program 1 times [2023-11-23 21:42:31,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:31,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011182134] [2023-11-23 21:42:31,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:31,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 21:42:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 21:42:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 21:42:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 21:42:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:42:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:42:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:42:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:42:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:32,731 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-23 21:42:32,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:32,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011182134] [2023-11-23 21:42:32,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011182134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:32,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:32,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:42:32,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522645839] [2023-11-23 21:42:32,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:32,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:42:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:32,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:42:32,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:42:32,735 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2023-11-23 21:42:33,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:33,047 INFO L93 Difference]: Finished difference Result 116 states and 163 transitions. [2023-11-23 21:42:33,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:42:33,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 95 [2023-11-23 21:42:33,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:33,050 INFO L225 Difference]: With dead ends: 116 [2023-11-23 21:42:33,050 INFO L226 Difference]: Without dead ends: 66 [2023-11-23 21:42:33,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:42:33,053 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 19 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:33,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 161 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 21:42:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-23 21:42:33,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2023-11-23 21:42:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-23 21:42:33,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions. [2023-11-23 21:42:33,069 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 95 [2023-11-23 21:42:33,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:33,070 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions. [2023-11-23 21:42:33,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2023-11-23 21:42:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions. [2023-11-23 21:42:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-23 21:42:33,072 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:33,073 INFO L195 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] [2023-11-23 21:42:33,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:42:33,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:33,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:33,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1073216051, now seen corresponding path program 1 times [2023-11-23 21:42:33,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:33,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074764061] [2023-11-23 21:42:33,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:33,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 21:42:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 21:42:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 21:42:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 21:42:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:42:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:42:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:42:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:42:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-23 21:42:33,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:33,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074764061] [2023-11-23 21:42:33,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074764061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:33,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:33,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:42:33,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130670945] [2023-11-23 21:42:33,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:33,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:42:33,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:33,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:42:33,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:42:33,571 INFO L87 Difference]: Start difference. First operand 58 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-11-23 21:42:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:33,718 INFO L93 Difference]: Finished difference Result 138 states and 192 transitions. [2023-11-23 21:42:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:42:33,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 96 [2023-11-23 21:42:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:33,725 INFO L225 Difference]: With dead ends: 138 [2023-11-23 21:42:33,726 INFO L226 Difference]: Without dead ends: 81 [2023-11-23 21:42:33,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:42:33,737 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 46 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:33,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 215 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:42:33,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-23 21:42:33,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 58. [2023-11-23 21:42:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-23 21:42:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions. [2023-11-23 21:42:33,762 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 96 [2023-11-23 21:42:33,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:33,765 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions. [2023-11-23 21:42:33,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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) [2023-11-23 21:42:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions. [2023-11-23 21:42:33,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-23 21:42:33,770 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:33,770 INFO L195 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] [2023-11-23 21:42:33,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:42:33,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:33,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1580203668, now seen corresponding path program 1 times [2023-11-23 21:42:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:33,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244248416] [2023-11-23 21:42:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:33,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 21:42:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 21:42:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 21:42:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 21:42:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 21:42:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 21:42:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 21:42:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 21:42:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 21:42:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 21:42:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 21:42:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 21:42:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 21:42:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-23 21:42:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-23 21:42:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-11-23 21:42:33,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:42:33,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244248416] [2023-11-23 21:42:33,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244248416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:42:33,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:42:33,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:42:33,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850919488] [2023-11-23 21:42:33,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:42:33,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:42:33,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:42:33,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:42:33,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:42:33,935 INFO L87 Difference]: Start difference. First operand 58 states and 82 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2023-11-23 21:42:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:42:33,992 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2023-11-23 21:42:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:42:33,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 97 [2023-11-23 21:42:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:42:33,995 INFO L225 Difference]: With dead ends: 136 [2023-11-23 21:42:33,995 INFO L226 Difference]: Without dead ends: 79 [2023-11-23 21:42:33,996 INFO L412 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 [2023-11-23 21:42:33,997 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:42:33,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 114 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:42:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-23 21:42:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2023-11-23 21:42:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-23 21:42:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2023-11-23 21:42:34,024 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 97 [2023-11-23 21:42:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:42:34,025 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2023-11-23 21:42:34,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2023-11-23 21:42:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2023-11-23 21:42:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-23 21:42:34,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:34,028 INFO L195 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] [2023-11-23 21:42:34,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:42:34,029 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:34,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:34,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1582050710, now seen corresponding path program 1 times [2023-11-23 21:42:34,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:42:34,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331359079] [2023-11-23 21:42:34,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:34,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:42:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:42:34,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:42:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:42:34,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:42:34,193 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:42:34,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 21:42:34,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:42:34,200 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-23 21:42:34,204 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:42:34,276 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-23 21:42:34,278 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-23 21:42:34,278 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-23 21:42:34,279 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated [2023-11-23 21:42:34,279 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated [2023-11-23 21:42:34,279 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated [2023-11-23 21:42:34,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:42:34 BoogieIcfgContainer [2023-11-23 21:42:34,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:42:34,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:42:34,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:42:34,318 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:42:34,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:42:29" (3/4) ... [2023-11-23 21:42:34,321 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 21:42:34,323 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:42:34,324 INFO L158 Benchmark]: Toolchain (without parser) took 5698.70ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 104.7MB in the beginning and 78.9MB in the end (delta: 25.7MB). Peak memory consumption was 76.4MB. Max. memory is 16.1GB. [2023-11-23 21:42:34,324 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 138.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:42:34,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.51ms. Allocated memory is still 138.4MB. Free memory was 104.2MB in the beginning and 92.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 21:42:34,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.58ms. Allocated memory is still 138.4MB. Free memory was 92.0MB in the beginning and 88.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 21:42:34,325 INFO L158 Benchmark]: Boogie Preprocessor took 66.47ms. Allocated memory is still 138.4MB. Free memory was 88.8MB in the beginning and 84.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 21:42:34,326 INFO L158 Benchmark]: RCFGBuilder took 618.75ms. Allocated memory is still 138.4MB. Free memory was 84.6MB in the beginning and 66.3MB in the end (delta: 18.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-23 21:42:34,326 INFO L158 Benchmark]: TraceAbstraction took 4457.99ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 65.7MB in the beginning and 78.9MB in the end (delta: -13.2MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. [2023-11-23 21:42:34,327 INFO L158 Benchmark]: Witness Printer took 5.23ms. Allocated memory is still 186.6MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:42:34,331 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.53ms. Allocated memory is still 138.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.51ms. Allocated memory is still 138.4MB. Free memory was 104.2MB in the beginning and 92.0MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.58ms. Allocated memory is still 138.4MB. Free memory was 92.0MB in the beginning and 88.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.47ms. Allocated memory is still 138.4MB. Free memory was 88.8MB in the beginning and 84.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 618.75ms. Allocated memory is still 138.4MB. Free memory was 84.6MB in the beginning and 66.3MB in the end (delta: 18.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4457.99ms. Allocated memory was 138.4MB in the beginning and 186.6MB in the end (delta: 48.2MB). Free memory was 65.7MB in the beginning and 78.9MB in the end (delta: -13.2MB). Peak memory consumption was 36.6MB. Max. memory is 16.1GB. * Witness Printer took 5.23ms. Allocated memory is still 186.6MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 someBinaryFLOATComparisonOperation at line 95, overapproximation of shiftRight at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 8; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_5 = 32; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] float var_1_8 = 1.8; [L30] float var_1_9 = 9999999999999.75; [L31] float var_1_10 = 8.75; [L32] float var_1_11 = 255.75; [L33] unsigned short int var_1_12 = 10; [L34] unsigned char var_1_13 = 2; [L35] unsigned short int var_1_14 = 4; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] FCALL updateLastVariables() [L103] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=8, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L72] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=8, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L75] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=32, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L76] var_1_5 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L77] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L78] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=0, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L82] var_1_7 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_8=9/5, var_1_9=39999999999999/4] [L83] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_8=9/5, var_1_9=39999999999999/4] [L84] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L84] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5, var_1_9=39999999999999/4] [L85] var_1_9 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L86] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=35/4, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L87] var_1_10 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L88] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1023/4, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L89] var_1_11 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L90] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L103] RET updateVariables() [L104] CALL step() [L39] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, stepLocal_0=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=16, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L40] COND TRUE \read(var_1_2) [L41] var_1_1 = (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))) VAL [isInitial=1, stepLocal_0=1, var_1_12=10, var_1_13=2, var_1_14=4, var_1_1=50, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L53] var_1_12 = 100 [L54] var_1_13 = var_1_3 [L55] var_1_14 = var_1_3 VAL [isInitial=1, stepLocal_0=1, var_1_12=100, var_1_13=49, var_1_14=49, var_1_1=50, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L56] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, stepLocal_0=1, var_1_12=100, var_1_13=49, var_1_14=49, var_1_1=50, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=9/5] [L56] COND FALSE !((var_1_13 >> var_1_3) <= var_1_5) [L63] var_1_8 = var_1_9 VAL [isInitial=1, stepLocal_0=1, var_1_12=100, var_1_13=49, var_1_14=49, var_1_1=50, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=10000000000004, var_1_9=10000000000004] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=49, var_1_14=49, var_1_1=50, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=10000000000004, var_1_9=10000000000004] [L95] EXPR var_1_13 >> var_1_3 VAL [isInitial=1, var_1_12=100, var_1_13=49, var_1_14=49, var_1_1=50, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=10000000000004, var_1_9=10000000000004] [L95] EXPR (var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9))) VAL [isInitial=1, var_1_12=100, var_1_13=49, var_1_14=49, var_1_1=50, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=10000000000004, var_1_9=10000000000004] [L95-L96] return ((((var_1_2 ? (var_1_1 == ((unsigned char) (((((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) > (var_1_5)) ? ((((((var_1_3 + var_1_4)) > (50)) ? ((var_1_3 + var_1_4)) : (50)))) : (var_1_5))))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_7 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_3))))) && (((var_1_13 >> var_1_3) <= var_1_5) ? (((25 > var_1_13) && var_1_7) ? (var_1_8 == ((float) (var_1_9 + ((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))) : (var_1_8 == ((float) var_1_9))) : (var_1_8 == ((float) var_1_9)))) && (var_1_12 == ((unsigned short int) 100))) && (var_1_13 == ((unsigned char) var_1_3))) && (var_1_14 == ((unsigned short int) var_1_3)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_12=100, var_1_13=49, var_1_14=49, var_1_1=50, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=10000000000004, var_1_9=10000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_12=100, var_1_13=49, var_1_14=49, var_1_1=50, var_1_2=1, var_1_3=49, var_1_4=0, var_1_5=47, var_1_6=1, var_1_7=1, var_1_8=10000000000004, var_1_9=10000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 691 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 320 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=5, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 45 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 473 ConstructedInterpolants, 0 QuantifiedInterpolants, 1307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2100/2100 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 [2023-11-23 21:42:34,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ --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 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:42:37,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:42:37,532 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-23 21:42:37,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:42:37,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:42:37,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:42:37,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:42:37,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:42:37,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 21:42:37,604 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 21:42:37,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:42:37,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:42:37,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:42:37,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:42:37,607 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:42:37,608 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:42:37,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:42:37,621 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:42:37,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:42:37,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:42:37,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:42:37,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:42:37,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:42:37,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:42:37,624 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 21:42:37,625 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 21:42:37,625 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:42:37,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:42:37,626 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:42:37,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:42:37,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:42:37,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:42:37,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:42:37,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:42:37,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:42:37,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:42:37,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:42:37,632 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 21:42:37,632 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 21:42:37,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:42:37,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:42:37,633 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:42:37,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:42:37,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:42:37,634 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 21:42:37,634 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_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/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_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ 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 -> 956617101c79c6f029a06073d0a85a067e22e0a60f0cb52c3d901f55768b03ba [2023-11-23 21:42:38,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:42:38,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:42:38,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:42:38,189 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:42:38,190 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:42:38,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i [2023-11-23 21:42:41,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:42:41,833 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:42:41,834 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i [2023-11-23 21:42:41,844 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/data/fc8cfa016/9b04d90552f74a2580ec8c4eed4de0cb/FLAGc7b752cf8 [2023-11-23 21:42:41,867 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/data/fc8cfa016/9b04d90552f74a2580ec8c4eed4de0cb [2023-11-23 21:42:41,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:42:41,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:42:41,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:42:41,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:42:41,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:42:41,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:42:41" (1/1) ... [2023-11-23 21:42:41,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b1d2bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:41, skipping insertion in model container [2023-11-23 21:42:41,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:42:41" (1/1) ... [2023-11-23 21:42:41,935 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:42:42,151 WARN L240 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_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i[915,928] [2023-11-23 21:42:42,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:42:42,263 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:42:42,289 WARN L240 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_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-71.i[915,928] [2023-11-23 21:42:42,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:42:42,356 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:42:42,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42 WrapperNode [2023-11-23 21:42:42,357 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:42:42,358 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:42:42,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:42:42,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:42:42,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,427 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2023-11-23 21:42:42,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:42:42,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:42:42,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:42:42,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:42:42,448 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,453 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,466 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 21:42:42,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,482 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:42:42,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:42:42,493 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:42:42,493 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:42:42,495 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (1/1) ... [2023-11-23 21:42:42,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:42:42,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:42:42,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:42:42,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:42:42,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:42:42,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-23 21:42:42,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 21:42:42,606 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 21:42:42,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:42:42,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:42:42,694 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:42:42,697 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:42:43,179 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:42:43,250 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:42:43,250 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 21:42:43,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:42:43 BoogieIcfgContainer [2023-11-23 21:42:43,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:42:43,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:42:43,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:42:43,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:42:43,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:42:41" (1/3) ... [2023-11-23 21:42:43,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bf8495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:42:43, skipping insertion in model container [2023-11-23 21:42:43,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:42:42" (2/3) ... [2023-11-23 21:42:43,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bf8495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:42:43, skipping insertion in model container [2023-11-23 21:42:43,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:42:43" (3/3) ... [2023-11-23 21:42:43,263 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-71.i [2023-11-23 21:42:43,283 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:42:43,284 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:42:43,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:42:43,357 INFO L357 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, mHoare=true, 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;@705583e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:42:43,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:42:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 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) [2023-11-23 21:42:43,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-23 21:42:43,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:42:43,379 INFO L195 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] [2023-11-23 21:42:43,379 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:42:43,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:42:43,386 INFO L85 PathProgramCache]: Analyzing trace with hash 525218356, now seen corresponding path program 1 times [2023-11-23 21:42:43,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:42:43,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637359435] [2023-11-23 21:42:43,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:42:43,406 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 [2023-11-23 21:42:43,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:42:43,409 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/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) [2023-11-23 21:42:43,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7da7621-7cfc-4dd5-96cb-55c0efc08e46/bin/uautomizer-verify-zZY32mL2XJ/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 [2023-11-23 21:42:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:42:43,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-23 21:42:43,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:42:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 134 proven. 6 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2023-11-23 21:42:45,877 INFO L327 TraceCheckSpWp]: Computing backward predicates...