./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya --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 3ccbd3d527b155627328a35d6caa52dc0505af33db01f6600e6e4ac6df0debf6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:01:46,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:01:46,690 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 07:01:46,695 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:01:46,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:01:46,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:01:46,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:01:46,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:01:46,721 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:01:46,722 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:01:46,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:01:46,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:01:46,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:01:46,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:01:46,725 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:01:46,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:01:46,726 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:01:46,727 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:01:46,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:01:46,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:01:46,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:01:46,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:01:46,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:01:46,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:01:46,730 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:01:46,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:01:46,731 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:01:46,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:01:46,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:01:46,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:01:46,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:01:46,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:01:46,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:01:46,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:01:46,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:01:46,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 07:01:46,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 07:01:46,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:01:46,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:01:46,735 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:01:46,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:01:46,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:01:46,736 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 3ccbd3d527b155627328a35d6caa52dc0505af33db01f6600e6e4ac6df0debf6 [2023-11-29 07:01:46,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:01:46,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:01:46,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:01:46,979 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:01:46,979 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:01:46,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i [2023-11-29 07:01:49,773 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:01:49,957 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:01:49,957 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i [2023-11-29 07:01:49,967 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/data/669d592a1/9216885bacef433b92dd987c9d0a9be7/FLAG014a1ddb9 [2023-11-29 07:01:49,983 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/data/669d592a1/9216885bacef433b92dd987c9d0a9be7 [2023-11-29 07:01:49,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:01:49,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:01:49,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:01:49,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:01:49,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:01:49,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:01:49" (1/1) ... [2023-11-29 07:01:49,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab35bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:49, skipping insertion in model container [2023-11-29 07:01:49,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:01:49" (1/1) ... [2023-11-29 07:01:50,022 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:01:50,173 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_52e7802d-5d1c-4702-a668-3848894824b5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i[915,928] [2023-11-29 07:01:50,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:01:50,233 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:01:50,248 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_52e7802d-5d1c-4702-a668-3848894824b5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i[915,928] [2023-11-29 07:01:50,270 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:01:50,288 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:01:50,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50 WrapperNode [2023-11-29 07:01:50,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:01:50,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:01:50,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:01:50,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:01:50,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,340 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2023-11-29 07:01:50,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:01:50,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:01:50,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:01:50,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:01:50,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,373 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 07:01:50,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:01:50,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:01:50,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:01:50,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:01:50,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (1/1) ... [2023-11-29 07:01:50,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:01:50,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:01:50,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:01:50,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:01:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:01:50,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 07:01:50,464 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 07:01:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 07:01:50,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:01:50,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:01:50,543 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:01:50,546 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:01:50,811 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:01:50,842 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:01:50,842 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 07:01:50,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:01:50 BoogieIcfgContainer [2023-11-29 07:01:50,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:01:50,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:01:50,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:01:50,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:01:50,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:01:49" (1/3) ... [2023-11-29 07:01:50,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38794408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:01:50, skipping insertion in model container [2023-11-29 07:01:50,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:01:50" (2/3) ... [2023-11-29 07:01:50,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38794408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:01:50, skipping insertion in model container [2023-11-29 07:01:50,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:01:50" (3/3) ... [2023-11-29 07:01:50,851 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-70.i [2023-11-29 07:01:50,870 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:01:50,870 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:01:50,912 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:01:50,918 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;@3c14fb32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:01:50,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:01:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 07:01:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 07:01:50,935 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:01:50,935 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:01:50,936 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:01:50,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:50,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1046689631, now seen corresponding path program 1 times [2023-11-29 07:01:50,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:50,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422110223] [2023-11-29 07:01:50,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:01:51,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:01:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:01:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:01:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:01:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:01:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:01:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 07:01:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 07:01:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 07:01:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 07:01:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:01:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 07:01:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 07:01:51,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:51,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422110223] [2023-11-29 07:01:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422110223] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:51,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:01:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884635422] [2023-11-29 07:01:51,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:51,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:01:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:51,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:01:51,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:01:51,268 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 07:01:51,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:01:51,304 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2023-11-29 07:01:51,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:01:51,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2023-11-29 07:01:51,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:01:51,314 INFO L225 Difference]: With dead ends: 95 [2023-11-29 07:01:51,315 INFO L226 Difference]: Without dead ends: 47 [2023-11-29 07:01:51,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-29 07:01:51,322 INFO L413 NwaCegarLoop]: 67 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, 67 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-29 07:01:51,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:01:51,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-29 07:01:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-11-29 07:01:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 07:01:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2023-11-29 07:01:51,369 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 86 [2023-11-29 07:01:51,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:01:51,369 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2023-11-29 07:01:51,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 07:01:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2023-11-29 07:01:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 07:01:51,374 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:01:51,374 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:01:51,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 07:01:51,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:01:51,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 484166429, now seen corresponding path program 1 times [2023-11-29 07:01:51,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:51,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941460506] [2023-11-29 07:01:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:01:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:01:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:01:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:01:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:01:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:01:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:01:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 07:01:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 07:01:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 07:01:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 07:01:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:01:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 07:01:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 07:01:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:53,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941460506] [2023-11-29 07:01:53,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941460506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:53,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:53,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:01:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982576179] [2023-11-29 07:01:53,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:53,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:01:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:53,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:01:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:01:53,934 INFO L87 Difference]: Start difference. First operand 47 states and 70 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:01:58,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:01:59,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 07:01:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:01:59,715 INFO L93 Difference]: Finished difference Result 116 states and 174 transitions. [2023-11-29 07:01:59,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:01:59,716 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2023-11-29 07:01:59,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:01:59,718 INFO L225 Difference]: With dead ends: 116 [2023-11-29 07:01:59,718 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 07:01:59,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:01:59,720 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-11-29 07:01:59,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 133 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2023-11-29 07:01:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 07:01:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2023-11-29 07:01:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 42 states have internal predecessors, (60), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 07:01:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2023-11-29 07:01:59,732 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 86 [2023-11-29 07:01:59,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:01:59,734 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2023-11-29 07:01:59,734 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:01:59,735 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2023-11-29 07:01:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 07:01:59,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:01:59,737 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:01:59,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 07:01:59,737 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:01:59,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:59,738 INFO L85 PathProgramCache]: Analyzing trace with hash 742331867, now seen corresponding path program 1 times [2023-11-29 07:01:59,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:59,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661569707] [2023-11-29 07:01:59,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:59,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:01:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:01:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:01:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:01:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:01:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:01:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:01:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 07:01:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 07:01:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 07:01:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 07:01:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:01:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 07:01:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 07:01:59,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:01:59,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661569707] [2023-11-29 07:01:59,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661569707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:01:59,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:01:59,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:01:59,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592850635] [2023-11-29 07:01:59,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:01:59,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:01:59,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:01:59,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:01:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:01:59,842 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:01:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:01:59,874 INFO L93 Difference]: Finished difference Result 124 states and 185 transitions. [2023-11-29 07:01:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:01:59,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2023-11-29 07:01:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:01:59,877 INFO L225 Difference]: With dead ends: 124 [2023-11-29 07:01:59,877 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 07:01:59,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-29 07:01:59,879 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 24 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:01:59,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 148 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:01:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 07:01:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2023-11-29 07:01:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 07:01:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2023-11-29 07:01:59,889 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 86 [2023-11-29 07:01:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:01:59,890 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2023-11-29 07:01:59,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:01:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2023-11-29 07:01:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 07:01:59,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:01:59,892 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:01:59,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 07:01:59,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:01:59,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:59,893 INFO L85 PathProgramCache]: Analyzing trace with hash 799590169, now seen corresponding path program 1 times [2023-11-29 07:01:59,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:01:59,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857602646] [2023-11-29 07:01:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:59,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:01:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 07:02:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 07:02:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 07:02:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 07:02:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:02:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 07:02:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 07:02:00,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857602646] [2023-11-29 07:02:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857602646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:02:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235608559] [2023-11-29 07:02:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:00,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:00,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:00,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:00,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:00,069 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:00,128 INFO L93 Difference]: Finished difference Result 159 states and 237 transitions. [2023-11-29 07:02:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2023-11-29 07:02:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:00,131 INFO L225 Difference]: With dead ends: 159 [2023-11-29 07:02:00,131 INFO L226 Difference]: Without dead ends: 103 [2023-11-29 07:02:00,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-29 07:02:00,133 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 40 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:00,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 134 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:02:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-29 07:02:00,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2023-11-29 07:02:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 07:02:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2023-11-29 07:02:00,149 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 86 [2023-11-29 07:02:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:00,150 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2023-11-29 07:02:00,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2023-11-29 07:02:00,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 07:02:00,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:00,152 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:02:00,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 07:02:00,153 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:00,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:00,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1192617179, now seen corresponding path program 1 times [2023-11-29 07:02:00,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:00,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685633876] [2023-11-29 07:02:00,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:00,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 07:02:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 07:02:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 07:02:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 07:02:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:02:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 07:02:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 07:02:00,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:00,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685633876] [2023-11-29 07:02:00,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685633876] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:00,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:00,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 07:02:00,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636904293] [2023-11-29 07:02:00,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:00,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:02:00,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:00,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:02:00,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:02:00,391 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:00,439 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2023-11-29 07:02:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:02:00,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2023-11-29 07:02:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:00,441 INFO L225 Difference]: With dead ends: 212 [2023-11-29 07:02:00,442 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 07:02:00,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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-29 07:02:00,444 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 29 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:00,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 222 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:02:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 07:02:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 99. [2023-11-29 07:02:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 07:02:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2023-11-29 07:02:00,460 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 86 [2023-11-29 07:02:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:00,460 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2023-11-29 07:02:00,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2023-11-29 07:02:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 07:02:00,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:00,463 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:02:00,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 07:02:00,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:00,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash 971323963, now seen corresponding path program 1 times [2023-11-29 07:02:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:00,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039999065] [2023-11-29 07:02:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:00,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 07:02:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 07:02:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 07:02:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 07:02:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:02:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 07:02:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 07:02:00,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:00,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039999065] [2023-11-29 07:02:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039999065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:00,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:00,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:02:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337658719] [2023-11-29 07:02:00,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:00,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 07:02:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:00,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 07:02:00,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 07:02:00,568 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:00,639 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2023-11-29 07:02:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 07:02:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2023-11-29 07:02:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:00,643 INFO L225 Difference]: With dead ends: 191 [2023-11-29 07:02:00,643 INFO L226 Difference]: Without dead ends: 137 [2023-11-29 07:02:00,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-29 07:02:00,644 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:00,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 128 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:02:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-29 07:02:00,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2023-11-29 07:02:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 98 states have (on average 1.316326530612245) internal successors, (129), 99 states have internal predecessors, (129), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 07:02:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 193 transitions. [2023-11-29 07:02:00,662 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 193 transitions. Word has length 89 [2023-11-29 07:02:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:00,663 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 193 transitions. [2023-11-29 07:02:00,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 193 transitions. [2023-11-29 07:02:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 07:02:00,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:00,664 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:02:00,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 07:02:00,665 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:00,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1028582265, now seen corresponding path program 1 times [2023-11-29 07:02:00,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:00,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766854020] [2023-11-29 07:02:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:00,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:00,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 07:02:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 07:02:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 07:02:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 07:02:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:02:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 07:02:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-11-29 07:02:01,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:01,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766854020] [2023-11-29 07:02:01,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766854020] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:02:01,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174116089] [2023-11-29 07:02:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:01,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:02:01,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:02:01,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:02:01,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 07:02:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:01,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 07:02:01,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 148 proven. 24 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-11-29 07:02:01,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:02:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-11-29 07:02:01,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174116089] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:02:01,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:02:01,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-11-29 07:02:01,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269679747] [2023-11-29 07:02:01,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:02:01,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 07:02:01,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:01,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 07:02:01,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-11-29 07:02:01,812 INFO L87 Difference]: Start difference. First operand 134 states and 193 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-11-29 07:02:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:02,424 INFO L93 Difference]: Finished difference Result 362 states and 499 transitions. [2023-11-29 07:02:02,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 07:02:02,425 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 89 [2023-11-29 07:02:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:02,428 INFO L225 Difference]: With dead ends: 362 [2023-11-29 07:02:02,429 INFO L226 Difference]: Without dead ends: 229 [2023-11-29 07:02:02,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2023-11-29 07:02:02,430 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 263 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:02,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 216 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:02:02,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-11-29 07:02:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2023-11-29 07:02:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 164 states have (on average 1.2804878048780488) internal successors, (210), 168 states have internal predecessors, (210), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 07:02:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 286 transitions. [2023-11-29 07:02:02,456 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 286 transitions. Word has length 89 [2023-11-29 07:02:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:02,456 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 286 transitions. [2023-11-29 07:02:02,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-11-29 07:02:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 286 transitions. [2023-11-29 07:02:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 07:02:02,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:02,458 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:02:02,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 07:02:02,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:02:02,662 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:02,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash 635555255, now seen corresponding path program 1 times [2023-11-29 07:02:02,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:02,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081965468] [2023-11-29 07:02:02,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:02,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 07:02:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 07:02:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 07:02:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 07:02:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:02:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 07:02:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 07:02:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:03,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081965468] [2023-11-29 07:02:03,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081965468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:03,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:03,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 07:02:03,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024670321] [2023-11-29 07:02:03,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:03,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:02:03,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:03,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:02:03,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:02:03,424 INFO L87 Difference]: Start difference. First operand 212 states and 286 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:04,053 INFO L93 Difference]: Finished difference Result 228 states and 303 transitions. [2023-11-29 07:02:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:02:04,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2023-11-29 07:02:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:04,056 INFO L225 Difference]: With dead ends: 228 [2023-11-29 07:02:04,056 INFO L226 Difference]: Without dead ends: 226 [2023-11-29 07:02:04,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-11-29 07:02:04,058 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:04,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 333 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:02:04,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-29 07:02:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2023-11-29 07:02:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 173 states have (on average 1.2658959537572254) internal successors, (219), 177 states have internal predecessors, (219), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 07:02:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 295 transitions. [2023-11-29 07:02:04,082 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 295 transitions. Word has length 89 [2023-11-29 07:02:04,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:04,082 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 295 transitions. [2023-11-29 07:02:04,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 295 transitions. [2023-11-29 07:02:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 07:02:04,084 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:04,084 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:02:04,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 07:02:04,085 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:04,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:04,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1729646843, now seen corresponding path program 1 times [2023-11-29 07:02:04,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:04,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727037927] [2023-11-29 07:02:04,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:04,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:02:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:02:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:02:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 07:02:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 07:02:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 07:02:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 07:02:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 07:02:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 07:02:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 07:02:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 07:02:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:02:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 07:02:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 07:02:04,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:02:04,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727037927] [2023-11-29 07:02:04,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727037927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:04,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:04,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:02:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515938326] [2023-11-29 07:02:04,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:04,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 07:02:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:02:04,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 07:02:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 07:02:04,200 INFO L87 Difference]: Start difference. First operand 221 states and 295 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:04,452 INFO L93 Difference]: Finished difference Result 460 states and 608 transitions. [2023-11-29 07:02:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 07:02:04,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2023-11-29 07:02:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:04,455 INFO L225 Difference]: With dead ends: 460 [2023-11-29 07:02:04,455 INFO L226 Difference]: Without dead ends: 311 [2023-11-29 07:02:04,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:02:04,456 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 70 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:04,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 206 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:02:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-11-29 07:02:04,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 218. [2023-11-29 07:02:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 172 states have (on average 1.2790697674418605) internal successors, (220), 175 states have internal predecessors, (220), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 07:02:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 292 transitions. [2023-11-29 07:02:04,515 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 292 transitions. Word has length 89 [2023-11-29 07:02:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:04,516 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 292 transitions. [2023-11-29 07:02:04,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 292 transitions. [2023-11-29 07:02:04,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 07:02:04,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:04,517 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:02:04,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 07:02:04,518 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:04,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:04,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1885262083, now seen corresponding path program 1 times [2023-11-29 07:02:04,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:02:04,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823424712] [2023-11-29 07:02:04,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:04,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:02:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:02:04,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 07:02:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 07:02:04,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 07:02:04,603 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 07:02:04,604 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 07:02:04,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 07:02:04,610 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:02:04,613 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 07:02:04,655 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 07:02:04,656 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 07:02:04,657 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated [2023-11-29 07:02:04,657 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 07:02:04,658 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 07:02:04,658 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated [2023-11-29 07:02:04,658 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated [2023-11-29 07:02:04,658 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 07:02:04,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 07:02:04,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 07:02:04,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated [2023-11-29 07:02:04,659 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated [2023-11-29 07:02:04,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:02:04 BoogieIcfgContainer [2023-11-29 07:02:04,673 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 07:02:04,674 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 07:02:04,674 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 07:02:04,674 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 07:02:04,675 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:01:50" (3/4) ... [2023-11-29 07:02:04,677 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 07:02:04,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 07:02:04,678 INFO L158 Benchmark]: Toolchain (without parser) took 14691.48ms. Allocated memory was 157.3MB in the beginning and 245.4MB in the end (delta: 88.1MB). Free memory was 113.4MB in the beginning and 184.3MB in the end (delta: -70.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-11-29 07:02:04,678 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 107.0MB. Free memory was 58.3MB in the beginning and 58.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:02:04,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.60ms. Allocated memory is still 157.3MB. Free memory was 113.4MB in the beginning and 101.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 07:02:04,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.91ms. Allocated memory is still 157.3MB. Free memory was 101.1MB in the beginning and 98.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 07:02:04,679 INFO L158 Benchmark]: Boogie Preprocessor took 51.65ms. Allocated memory is still 157.3MB. Free memory was 98.1MB in the beginning and 94.6MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:02:04,680 INFO L158 Benchmark]: RCFGBuilder took 449.07ms. Allocated memory is still 157.3MB. Free memory was 94.6MB in the beginning and 125.1MB in the end (delta: -30.6MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2023-11-29 07:02:04,680 INFO L158 Benchmark]: TraceAbstraction took 13828.51ms. Allocated memory was 157.3MB in the beginning and 245.4MB in the end (delta: 88.1MB). Free memory was 124.5MB in the beginning and 184.3MB in the end (delta: -59.8MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. [2023-11-29 07:02:04,680 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 245.4MB. Free memory is still 184.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:02:04,682 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.21ms. Allocated memory is still 107.0MB. Free memory was 58.3MB in the beginning and 58.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.60ms. Allocated memory is still 157.3MB. Free memory was 113.4MB in the beginning and 101.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.91ms. Allocated memory is still 157.3MB. Free memory was 101.1MB in the beginning and 98.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.65ms. Allocated memory is still 157.3MB. Free memory was 98.1MB in the beginning and 94.6MB in the end (delta: 3.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.07ms. Allocated memory is still 157.3MB. Free memory was 94.6MB in the beginning and 125.1MB in the end (delta: -30.6MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13828.51ms. Allocated memory was 157.3MB in the beginning and 245.4MB in the end (delta: 88.1MB). Free memory was 124.5MB in the beginning and 184.3MB in the end (delta: -59.8MB). Peak memory consumption was 28.2MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 245.4MB. Free memory is still 184.3MB. 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~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite16 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 someBinaryDOUBLEComparisonOperation at line 77, overapproximation of shiftLeft at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 1; [L25] unsigned short int var_1_4 = 19138; [L26] unsigned short int var_1_5 = 0; [L27] signed char var_1_6 = 25; [L28] signed long int var_1_7 = -50; [L29] double var_1_8 = 8.3; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 256.2; [L81] isInitial = 1 [L82] FCALL initially() [L83] COND TRUE 1 [L84] FCALL updateLastVariables() [L85] CALL updateVariables() [L53] var_1_2 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L54] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L56] var_1_3 = __VERIFIER_nondet_ushort() [L57] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L57] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L59] var_1_4 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L60] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L62] var_1_5 = __VERIFIER_nondet_ushort() [L63] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L63] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L65] var_1_9 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L66] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] CALL assume_abort_if_not(var_1_9 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] RET assume_abort_if_not(var_1_9 <= 255) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L68] var_1_10 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L69] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=127, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=127, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=127, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L85] RET updateVariables() [L86] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)) VAL [isInitial=1, var_1_10=127, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L39] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR var_1_5 << var_1_1 VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] COND FALSE !(stepLocal_0 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) [L43] var_1_7 = (var_1_5 + (var_1_1 + var_1_4)) VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=83/10, var_1_9=255] [L45] COND TRUE (var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3 [L46] var_1_8 = var_1_11 VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L48] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L86] RET step() [L87] CALL, EXPR property() [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L77] EXPR var_1_5 << var_1_1 VAL [isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L77-L78] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))) && (((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) ? (var_1_8 == ((double) var_1_11)) : 1) ; [L87] RET, EXPR property() [L87] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 10, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 590 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 586 mSDsluCounter, 1587 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 966 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 830 IncrementalHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 621 mSDtfsCounter, 830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 435 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=8, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 157 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 953 ConstructedInterpolants, 0 QuantifiedInterpolants, 4716 SizeOfPredicates, 9 NumberOfNonLiveVariables, 213 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 3360/3432 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-29 07:02:04,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya --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 3ccbd3d527b155627328a35d6caa52dc0505af33db01f6600e6e4ac6df0debf6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:02:06,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:02:06,708 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 07:02:06,714 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:02:06,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:02:06,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:02:06,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:02:06,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:02:06,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:02:06,745 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:02:06,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:02:06,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:02:06,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:02:06,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:02:06,748 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:02:06,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:02:06,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:02:06,749 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:02:06,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:02:06,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:02:06,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:02:06,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:02:06,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:02:06,752 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 07:02:06,752 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 07:02:06,753 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 07:02:06,753 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:02:06,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:02:06,754 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:02:06,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:02:06,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:02:06,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:02:06,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:02:06,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:02:06,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:02:06,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:02:06,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:02:06,757 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 07:02:06,757 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 07:02:06,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:02:06,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:02:06,758 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:02:06,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:02:06,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:02:06,758 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 07:02:06,759 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_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 3ccbd3d527b155627328a35d6caa52dc0505af33db01f6600e6e4ac6df0debf6 [2023-11-29 07:02:07,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:02:07,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:02:07,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:02:07,068 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:02:07,069 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:02:07,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i [2023-11-29 07:02:09,923 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:02:10,090 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:02:10,091 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i [2023-11-29 07:02:10,099 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/data/e7bc24a59/c6d805f0f4a94e0da3bc1f3506409d01/FLAG56e841159 [2023-11-29 07:02:10,112 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/data/e7bc24a59/c6d805f0f4a94e0da3bc1f3506409d01 [2023-11-29 07:02:10,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:02:10,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:02:10,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:02:10,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:02:10,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:02:10,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54bc1b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10, skipping insertion in model container [2023-11-29 07:02:10,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,157 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:02:10,311 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_52e7802d-5d1c-4702-a668-3848894824b5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i[915,928] [2023-11-29 07:02:10,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:02:10,363 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:02:10,377 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_52e7802d-5d1c-4702-a668-3848894824b5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i[915,928] [2023-11-29 07:02:10,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:02:10,417 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:02:10,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10 WrapperNode [2023-11-29 07:02:10,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:02:10,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:02:10,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:02:10,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:02:10,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,464 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2023-11-29 07:02:10,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:02:10,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:02:10,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:02:10,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:02:10,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,495 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 07:02:10,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:02:10,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:02:10,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:02:10,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:02:10,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (1/1) ... [2023-11-29 07:02:10,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:02:10,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:02:10,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:02:10,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:02:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:02:10,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 07:02:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 07:02:10,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 07:02:10,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:02:10,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:02:10,670 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:02:10,672 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:02:10,882 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:02:10,930 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:02:10,931 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 07:02:10,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:02:10 BoogieIcfgContainer [2023-11-29 07:02:10,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:02:10,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:02:10,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:02:10,936 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:02:10,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:02:10" (1/3) ... [2023-11-29 07:02:10,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c37a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:02:10, skipping insertion in model container [2023-11-29 07:02:10,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:02:10" (2/3) ... [2023-11-29 07:02:10,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c37a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:02:10, skipping insertion in model container [2023-11-29 07:02:10,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:02:10" (3/3) ... [2023-11-29 07:02:10,939 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-70.i [2023-11-29 07:02:10,954 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:02:10,954 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 07:02:10,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:02:11,000 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;@448e756b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:02:11,001 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 07:02:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 07:02:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 07:02:11,015 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:11,015 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:02:11,016 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:11,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:11,021 INFO L85 PathProgramCache]: Analyzing trace with hash -652337531, now seen corresponding path program 1 times [2023-11-29 07:02:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:11,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112800479] [2023-11-29 07:02:11,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:11,033 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-29 07:02:11,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:11,054 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 07:02:11,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 07:02:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:11,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 07:02:11,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2023-11-29 07:02:11,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:02:11,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:11,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112800479] [2023-11-29 07:02:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112800479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:02:11,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:02:11,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 07:02:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759741892] [2023-11-29 07:02:11,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:11,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 07:02:11,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:11,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 07:02:11,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 07:02:11,297 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 07:02:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:11,334 INFO L93 Difference]: Finished difference Result 73 states and 125 transitions. [2023-11-29 07:02:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 07:02:11,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2023-11-29 07:02:11,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:11,343 INFO L225 Difference]: With dead ends: 73 [2023-11-29 07:02:11,343 INFO L226 Difference]: Without dead ends: 36 [2023-11-29 07:02:11,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 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-29 07:02:11,349 INFO L413 NwaCegarLoop]: 49 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, 49 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-29 07:02:11,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:02:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-29 07:02:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-29 07:02:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 07:02:11,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2023-11-29 07:02:11,385 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 82 [2023-11-29 07:02:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:11,385 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2023-11-29 07:02:11,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-29 07:02:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2023-11-29 07:02:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 07:02:11,389 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:11,390 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:02:11,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 07:02:11,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 07:02:11,594 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:11,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:11,595 INFO L85 PathProgramCache]: Analyzing trace with hash -536723133, now seen corresponding path program 1 times [2023-11-29 07:02:11,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:11,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688666500] [2023-11-29 07:02:11,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:11,597 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-29 07:02:11,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:11,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 07:02:11,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 07:02:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:11,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 07:02:11,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 187 proven. 69 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 07:02:12,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:02:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 07:02:13,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:13,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688666500] [2023-11-29 07:02:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688666500] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 07:02:13,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:02:13,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 18 [2023-11-29 07:02:13,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265877470] [2023-11-29 07:02:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:02:13,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:02:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:02:13,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-11-29 07:02:13,332 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:13,652 INFO L93 Difference]: Finished difference Result 103 states and 142 transitions. [2023-11-29 07:02:13,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:02:13,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 82 [2023-11-29 07:02:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:13,657 INFO L225 Difference]: With dead ends: 103 [2023-11-29 07:02:13,657 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 07:02:13,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-11-29 07:02:13,659 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 38 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:13,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 113 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:02:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 07:02:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2023-11-29 07:02:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 07:02:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2023-11-29 07:02:13,675 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 82 [2023-11-29 07:02:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:13,676 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2023-11-29 07:02:13,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:02:13,676 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2023-11-29 07:02:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 07:02:13,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:13,679 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:02:13,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-29 07:02:13,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 07:02:13,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:02:13,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash -536663551, now seen corresponding path program 1 times [2023-11-29 07:02:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128694603] [2023-11-29 07:02:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:13,884 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-29 07:02:13,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:13,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 07:02:13,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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 (4)] Waiting until timeout for monitored process [2023-11-29 07:02:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:14,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 07:02:14,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:03:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 211 proven. 57 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 07:03:31,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:04:34,258 WARN L293 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 190 DAG size of output: 178 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 07:04:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-11-29 07:04:59,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:04:59,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128694603] [2023-11-29 07:04:59,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [128694603] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 07:04:59,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:04:59,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [22] total 32 [2023-11-29 07:04:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73601597] [2023-11-29 07:04:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:04:59,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 07:04:59,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:04:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 07:04:59,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2023-11-29 07:04:59,928 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:05:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:43,259 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2023-11-29 07:05:43,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 07:05:43,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 82 [2023-11-29 07:05:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:43,265 INFO L225 Difference]: With dead ends: 90 [2023-11-29 07:05:43,265 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 07:05:43,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 56.9s TimeCoverageRelationStatistics Valid=382, Invalid=1874, Unknown=0, NotChecked=0, Total=2256 [2023-11-29 07:05:43,268 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 168 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:43,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 117 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 07:05:43,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 07:05:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 47. [2023-11-29 07:05:43,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 07:05:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2023-11-29 07:05:43,283 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 82 [2023-11-29 07:05:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:43,284 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2023-11-29 07:05:43,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:05:43,284 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2023-11-29 07:05:43,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 07:05:43,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:43,286 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:05:43,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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 (4)] Ended with exit code 0 [2023-11-29 07:05:43,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 07:05:43,487 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:05:43,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:43,487 INFO L85 PathProgramCache]: Analyzing trace with hash -534816509, now seen corresponding path program 1 times [2023-11-29 07:05:43,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:43,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876006887] [2023-11-29 07:05:43,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:43,488 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-29 07:05:43,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:43,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 07:05:43,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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 (5)] Waiting until timeout for monitored process [2023-11-29 07:05:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:43,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 07:05:43,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:52,225 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 187 proven. 69 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 07:06:52,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:08:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-29 07:08:17,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:08:17,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876006887] [2023-11-29 07:08:17,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876006887] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 07:08:17,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:08:17,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 25 [2023-11-29 07:08:17,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892479331] [2023-11-29 07:08:17,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:08:17,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 07:08:17,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:08:17,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 07:08:17,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2023-11-29 07:08:17,942 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:08:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:40,963 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2023-11-29 07:08:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 07:08:40,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 82 [2023-11-29 07:08:40,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:40,967 INFO L225 Difference]: With dead ends: 69 [2023-11-29 07:08:40,967 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 07:08:40,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 07:08:40,970 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:40,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 194 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 07:08:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 07:08:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2023-11-29 07:08:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 07:08:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2023-11-29 07:08:40,986 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 82 [2023-11-29 07:08:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:40,987 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2023-11-29 07:08:40,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-29 07:08:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2023-11-29 07:08:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 07:08:40,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:40,989 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 07:08:40,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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 (5)] Ended with exit code 0 [2023-11-29 07:08:41,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 07:08:41,190 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 07:08:41,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:41,190 INFO L85 PathProgramCache]: Analyzing trace with hash -593981435, now seen corresponding path program 1 times [2023-11-29 07:08:41,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:08:41,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296105174] [2023-11-29 07:08:41,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:41,191 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-29 07:08:41,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:08:41,193 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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-29 07:08:41,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52e7802d-5d1c-4702-a668-3848894824b5/bin/uautomizer-verify-BQ2R08f2Ya/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 (6)] Waiting until timeout for monitored process [2023-11-29 07:08:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:41,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 07:08:41,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:14:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-11-29 07:14:40,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:15:57,538 WARN L293 SmtUtils]: Spent 7.25s on a formula simplification. DAG size of input: 207 DAG size of output: 178 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 07:16:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-11-29 07:16:27,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:16:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296105174] [2023-11-29 07:16:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296105174] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 07:16:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:16:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 27 [2023-11-29 07:16:27,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276430457] [2023-11-29 07:16:27,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:16:27,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 07:16:27,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:16:27,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 07:16:27,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2023-11-29 07:16:27,259 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13)