./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd --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 adf694b6ddef665d6d08615d55edd3b888b46a164390930323ad37ea28078730 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:02:38,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:02:38,679 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:02:38,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:02:38,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:02:38,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:02:38,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:02:38,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:02:38,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:02:38,740 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:02:38,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:02:38,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:02:38,742 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:02:38,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:02:38,742 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:02:38,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:02:38,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:02:38,743 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:02:38,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:02:38,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:02:38,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:02:38,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:02:38,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:02:38,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:02:38,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:02:38,744 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:02:38,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:02:38,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:02:38,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:02:38,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:02:38,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:02:38,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:02:38,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:02:38,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:02:38,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:02:38,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:02:38,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:02:38,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:02:38,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:02:38,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:02:38,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:02:38,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:02:38,748 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd 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 -> adf694b6ddef665d6d08615d55edd3b888b46a164390930323ad37ea28078730 [2024-11-13 14:02:39,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:02:39,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:02:39,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:02:39,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:02:39,091 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:02:39,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i Unable to find full path for "g++" [2024-11-13 14:02:41,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:02:41,401 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:02:41,404 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i [2024-11-13 14:02:41,417 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/data/c3c099265/70db86a6936a4d819ecafbebf6a80869/FLAG481046f7f [2024-11-13 14:02:41,439 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/data/c3c099265/70db86a6936a4d819ecafbebf6a80869 [2024-11-13 14:02:41,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:02:41,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:02:41,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:02:41,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:02:41,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:02:41,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6acd5026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41, skipping insertion in model container [2024-11-13 14:02:41,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:02:41,681 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i[913,926] [2024-11-13 14:02:41,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:02:41,794 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:02:41,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i[913,926] [2024-11-13 14:02:41,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:02:41,851 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:02:41,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41 WrapperNode [2024-11-13 14:02:41,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:02:41,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:02:41,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:02:41,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:02:41,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,910 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-13 14:02:41,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:02:41,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:02:41,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:02:41,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:02:41,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,942 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:02:41,943 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,943 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,951 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:02:41,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:02:41,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:02:41,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:02:41,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (1/1) ... [2024-11-13 14:02:41,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:02:42,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:02:42,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:02:42,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:02:42,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:02:42,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:02:42,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:02:42,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:02:42,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:02:42,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:02:42,192 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:02:42,195 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:02:42,628 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-13 14:02:42,628 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:02:42,639 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:02:42,639 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:02:42,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:02:42 BoogieIcfgContainer [2024-11-13 14:02:42,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:02:42,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:02:42,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:02:42,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:02:42,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:02:41" (1/3) ... [2024-11-13 14:02:42,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eede9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:02:42, skipping insertion in model container [2024-11-13 14:02:42,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:02:41" (2/3) ... [2024-11-13 14:02:42,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eede9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:02:42, skipping insertion in model container [2024-11-13 14:02:42,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:02:42" (3/3) ... [2024-11-13 14:02:42,652 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-83.i [2024-11-13 14:02:42,673 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:02:42,677 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-83.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:02:42,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:02:42,771 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f97c62e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:02:42,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:02:42,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:02:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 14:02:42,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:02:42,789 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:02:42,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:02:42,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:02:42,798 INFO L85 PathProgramCache]: Analyzing trace with hash 805209103, now seen corresponding path program 1 times [2024-11-13 14:02:42,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:02:42,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044757366] [2024-11-13 14:02:42,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:02:42,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:02:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:02:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:02:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:02:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:02:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:02:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:02:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 14:02:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:02:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:02:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:02:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:02:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:02:43,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:02:43,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044757366] [2024-11-13 14:02:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044757366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:02:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:02:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:02:43,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409938570] [2024-11-13 14:02:43,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:02:43,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:02:43,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:02:43,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:02:43,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:02:43,216 INFO L87 Difference]: Start difference. First operand has 56 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:02:43,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:02:43,242 INFO L93 Difference]: Finished difference Result 105 states and 169 transitions. [2024-11-13 14:02:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:02:43,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2024-11-13 14:02:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:02:43,252 INFO L225 Difference]: With dead ends: 105 [2024-11-13 14:02:43,253 INFO L226 Difference]: Without dead ends: 52 [2024-11-13 14:02:43,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:02:43,259 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:02:43,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:02:43,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-13 14:02:43,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-13 14:02:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:02:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-13 14:02:43,300 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 78 [2024-11-13 14:02:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:02:43,300 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-13 14:02:43,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:02:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-13 14:02:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-13 14:02:43,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:02:43,304 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:02:43,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:02:43,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:02:43,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:02:43,305 INFO L85 PathProgramCache]: Analyzing trace with hash -188291049, now seen corresponding path program 1 times [2024-11-13 14:02:43,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:02:43,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350365575] [2024-11-13 14:02:43,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:02:43,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:02:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:02:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:02:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:02:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:02:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:02:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:02:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 14:02:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:02:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:02:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:02:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:02:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:02:43,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:02:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350365575] [2024-11-13 14:02:43,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350365575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:02:43,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:02:43,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:02:43,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506685140] [2024-11-13 14:02:43,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:02:43,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:02:43,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:02:43,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:02:43,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:02:43,652 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:02:43,710 INFO L93 Difference]: Finished difference Result 124 states and 178 transitions. [2024-11-13 14:02:43,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:02:43,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-11-13 14:02:43,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:02:43,713 INFO L225 Difference]: With dead ends: 124 [2024-11-13 14:02:43,714 INFO L226 Difference]: Without dead ends: 75 [2024-11-13 14:02:43,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:02:43,716 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 66 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 128 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 [2024-11-13 14:02:43,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 128 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:02:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-13 14:02:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2024-11-13 14:02:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:02:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 72 transitions. [2024-11-13 14:02:43,729 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 72 transitions. Word has length 78 [2024-11-13 14:02:43,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:02:43,730 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 72 transitions. [2024-11-13 14:02:43,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 72 transitions. [2024-11-13 14:02:43,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-13 14:02:43,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:02:43,733 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:02:43,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:02:43,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:02:43,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:02:43,733 INFO L85 PathProgramCache]: Analyzing trace with hash -676444445, now seen corresponding path program 1 times [2024-11-13 14:02:43,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:02:43,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6362624] [2024-11-13 14:02:43,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:02:43,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:02:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:02:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:02:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:43,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:02:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:44,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:02:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:44,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:02:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:44,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:02:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:44,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 14:02:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:44,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:02:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:44,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:02:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:02:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:02:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:02:44,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:02:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6362624] [2024-11-13 14:02:44,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6362624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:02:44,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:02:44,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:02:44,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276246566] [2024-11-13 14:02:44,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:02:44,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:02:44,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:02:44,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:02:44,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:02:44,052 INFO L87 Difference]: Start difference. First operand 52 states and 72 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:02:44,193 INFO L93 Difference]: Finished difference Result 103 states and 144 transitions. [2024-11-13 14:02:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:02:44,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 79 [2024-11-13 14:02:44,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:02:44,197 INFO L225 Difference]: With dead ends: 103 [2024-11-13 14:02:44,198 INFO L226 Difference]: Without dead ends: 54 [2024-11-13 14:02:44,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:02:44,199 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 7 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:02:44,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 181 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:02:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-13 14:02:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-13 14:02:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:02:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2024-11-13 14:02:44,214 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 79 [2024-11-13 14:02:44,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:02:44,215 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2024-11-13 14:02:44,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:44,215 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2024-11-13 14:02:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-13 14:02:44,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:02:44,217 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:02:44,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:02:44,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:02:44,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:02:44,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1747923955, now seen corresponding path program 1 times [2024-11-13 14:02:44,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:02:44,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269392263] [2024-11-13 14:02:44,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:02:44,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:02:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:02:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:02:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:02:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:02:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:02:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:02:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 14:02:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:02:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:02:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:02:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:02:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:02:48,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:02:48,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269392263] [2024-11-13 14:02:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269392263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:02:48,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:02:48,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 14:02:48,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372329340] [2024-11-13 14:02:48,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:02:48,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:02:48,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:02:48,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:02:48,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:02:48,159 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:02:48,691 INFO L93 Difference]: Finished difference Result 136 states and 183 transitions. [2024-11-13 14:02:48,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:02:48,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 80 [2024-11-13 14:02:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:02:48,694 INFO L225 Difference]: With dead ends: 136 [2024-11-13 14:02:48,694 INFO L226 Difference]: Without dead ends: 85 [2024-11-13 14:02:48,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:02:48,696 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 96 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:02:48,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 158 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:02:48,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-13 14:02:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2024-11-13 14:02:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:02:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-13 14:02:48,709 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 80 [2024-11-13 14:02:48,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:02:48,709 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-13 14:02:48,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-13 14:02:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 14:02:48,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:02:48,713 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:02:48,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:02:48,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:02:48,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:02:48,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1947049371, now seen corresponding path program 1 times [2024-11-13 14:02:48,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:02:48,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858520725] [2024-11-13 14:02:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:02:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:02:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:02:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:02:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:02:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:02:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:02:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:02:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 14:02:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:02:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:02:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:02:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:02:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:02:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:02:50,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858520725] [2024-11-13 14:02:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858520725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:02:50,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:02:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 14:02:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509219971] [2024-11-13 14:02:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:02:50,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 14:02:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:02:50,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 14:02:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:02:50,141 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:02:50,753 INFO L93 Difference]: Finished difference Result 166 states and 220 transitions. [2024-11-13 14:02:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:02:50,754 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 81 [2024-11-13 14:02:50,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:02:50,755 INFO L225 Difference]: With dead ends: 166 [2024-11-13 14:02:50,755 INFO L226 Difference]: Without dead ends: 98 [2024-11-13 14:02:50,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 14:02:50,757 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 38 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:02:50,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 276 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:02:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-13 14:02:50,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 71. [2024-11-13 14:02:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 states have internal predecessors, (72), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:02:50,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-13 14:02:50,781 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 81 [2024-11-13 14:02:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:02:50,781 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-13 14:02:50,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-13 14:02:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-13 14:02:50,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:02:50,783 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:02:50,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:02:50,786 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:02:50,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:02:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1336800675, now seen corresponding path program 1 times [2024-11-13 14:02:50,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:02:50,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583360801] [2024-11-13 14:02:50,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:02:50,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:02:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:02:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:02:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:02:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:02:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:02:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:02:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 14:02:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:02:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:02:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:02:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:02:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:02:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:02:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583360801] [2024-11-13 14:02:53,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583360801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:02:53,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:02:53,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:02:53,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870378216] [2024-11-13 14:02:53,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:02:53,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:02:53,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:02:53,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:02:53,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:02:53,317 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:54,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:02:54,905 INFO L93 Difference]: Finished difference Result 165 states and 218 transitions. [2024-11-13 14:02:54,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 14:02:54,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 81 [2024-11-13 14:02:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:02:54,907 INFO L225 Difference]: With dead ends: 165 [2024-11-13 14:02:54,908 INFO L226 Difference]: Without dead ends: 97 [2024-11-13 14:02:54,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:02:54,909 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 70 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:02:54,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 305 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 14:02:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-13 14:02:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 58. [2024-11-13 14:02:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:02:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-11-13 14:02:54,918 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 81 [2024-11-13 14:02:54,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:02:54,918 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-11-13 14:02:54,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-11-13 14:02:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-13 14:02:54,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:02:54,920 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:02:54,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:02:54,921 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:02:54,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:02:54,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2052446394, now seen corresponding path program 1 times [2024-11-13 14:02:54,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:02:54,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505108011] [2024-11-13 14:02:54,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:02:54,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:02:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:02:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:02:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:02:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:02:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:02:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:02:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 14:02:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:02:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:02:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:02:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:02:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:02:55,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:02:55,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505108011] [2024-11-13 14:02:55,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505108011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:02:55,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:02:55,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:02:55,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220655458] [2024-11-13 14:02:55,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:02:55,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:02:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:02:55,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:02:55,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:02:55,050 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:02:55,122 INFO L93 Difference]: Finished difference Result 134 states and 173 transitions. [2024-11-13 14:02:55,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:02:55,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 82 [2024-11-13 14:02:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:02:55,124 INFO L225 Difference]: With dead ends: 134 [2024-11-13 14:02:55,124 INFO L226 Difference]: Without dead ends: 79 [2024-11-13 14:02:55,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:02:55,125 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:02:55,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 105 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:02:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-13 14:02:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2024-11-13 14:02:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:02:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-11-13 14:02:55,135 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 82 [2024-11-13 14:02:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:02:55,135 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-11-13 14:02:55,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-13 14:02:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-11-13 14:02:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-13 14:02:55,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:02:55,137 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:02:55,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:02:55,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:02:55,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:02:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash 933546041, now seen corresponding path program 1 times [2024-11-13 14:02:55,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:02:55,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442254282] [2024-11-13 14:02:55,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:02:55,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:02:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:02:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:02:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:02:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:02:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:02:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:02:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 14:02:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:02:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:02:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 14:02:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:02:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:02:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-13 14:02:55,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:02:55,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442254282] [2024-11-13 14:02:55,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442254282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:02:55,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:02:55,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:02:55,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296656898] [2024-11-13 14:02:55,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:02:55,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:02:55,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:02:55,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:02:55,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:02:55,248 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:02:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:02:55,379 INFO L93 Difference]: Finished difference Result 150 states and 197 transitions. [2024-11-13 14:02:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:02:55,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 82 [2024-11-13 14:02:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:02:55,381 INFO L225 Difference]: With dead ends: 150 [2024-11-13 14:02:55,381 INFO L226 Difference]: Without dead ends: 90 [2024-11-13 14:02:55,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:02:55,383 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 104 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:02:55,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 108 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:02:55,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-13 14:02:55,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 63. [2024-11-13 14:02:55,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:02:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-11-13 14:02:55,394 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 82 [2024-11-13 14:02:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:02:55,395 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-11-13 14:02:55,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:02:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-11-13 14:02:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-13 14:02:55,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:02:55,397 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:02:55,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:02:55,397 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:02:55,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:02:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1183576487, now seen corresponding path program 1 times [2024-11-13 14:02:55,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:02:55,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907230876] [2024-11-13 14:02:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:02:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:02:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:02:55,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338083361] [2024-11-13 14:02:55,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:02:55,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:02:55,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:02:55,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:02:55,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:02:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:02:55,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:02:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:02:55,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:02:55,676 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:02:55,677 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:02:55,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:02:55,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:02:55,886 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:02:55,955 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:02:55,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:02:55 BoogieIcfgContainer [2024-11-13 14:02:55,959 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:02:55,960 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:02:55,960 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:02:55,960 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:02:55,961 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:02:42" (3/4) ... [2024-11-13 14:02:55,966 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:02:55,967 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:02:55,968 INFO L158 Benchmark]: Toolchain (without parser) took 14521.75ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 91.9MB in the beginning and 83.5MB in the end (delta: 8.4MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2024-11-13 14:02:55,968 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:02:55,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.94ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.0MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:02:55,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.21ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 76.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:02:55,972 INFO L158 Benchmark]: Boogie Preprocessor took 51.68ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:02:55,972 INFO L158 Benchmark]: RCFGBuilder took 676.55ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 54.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:02:55,973 INFO L158 Benchmark]: TraceAbstraction took 13316.50ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 54.2MB in the beginning and 83.5MB in the end (delta: -29.4MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-13 14:02:55,973 INFO L158 Benchmark]: Witness Printer took 6.77ms. Allocated memory is still 184.5MB. Free memory was 83.5MB in the beginning and 83.5MB in the end (delta: 36.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:02:55,977 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.42ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.94ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 79.0MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.21ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 76.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.68ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 72.1MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 676.55ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 54.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13316.50ms. Allocated memory was 117.4MB in the beginning and 184.5MB in the end (delta: 67.1MB). Free memory was 54.2MB in the beginning and 83.5MB in the end (delta: -29.4MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Witness Printer took 6.77ms. Allocated memory is still 184.5MB. Free memory was 83.5MB in the beginning and 83.5MB in the end (delta: 36.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] double var_1_8 = 127.625; [L27] double var_1_10 = 0.8; [L28] double var_1_11 = 128.75; [L29] double var_1_12 = 24.8; [L30] signed short int var_1_14 = -128; [L31] signed char var_1_15 = 64; [L32] signed char var_1_16 = 5; [L33] double var_1_17 = 1.5; [L34] unsigned short int last_1_var_1_1 = 128; VAL [isInitial=0, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=0, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=1021/8] [L70] var_1_3 = __VERIFIER_nondet_ushort() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=1021/8] [L72] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L72] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=4, var_1_8=1021/8] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L75] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L75] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_8=1021/8] [L76] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L76] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=4/5, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L77] var_1_10 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L78] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_11=515/4, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L79] var_1_11 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L80] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=5, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L81] var_1_16 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L82] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L83] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L83] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_1=128, var_1_12=124/5, var_1_14=-128, var_1_15=64, var_1_16=1, var_1_17=3/2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L97] RET updateVariables() [L98] CALL step() [L38] var_1_14 = 200 [L39] var_1_15 = var_1_16 [L40] var_1_17 = var_1_10 [L41] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=128, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L42] COND TRUE \read(var_1_2) [L43] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L51] signed long int stepLocal_2 = var_1_3 + var_1_1; VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L52] EXPR var_1_14 ^ var_1_15 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_2=0, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=1021/8] [L52] signed long int stepLocal_1 = var_1_14 ^ var_1_15; [L53] COND FALSE !(var_1_15 <= stepLocal_2) [L60] var_1_8 = var_1_10 VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_1=1, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L62] COND FALSE !(var_1_15 > var_1_15) VAL [isInitial=1, last_1_var_1_1=128, stepLocal_0=0, stepLocal_1=1, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89] EXPR (var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10)) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89] EXPR (var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10))) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L89-L90] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((last_1_var_1_1 * var_1_15)) < ((~ last_1_var_1_1))) ? ((last_1_var_1_1 * var_1_15)) : ((~ last_1_var_1_1))))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_3)))) && ((var_1_15 <= (var_1_3 + var_1_1)) ? ((var_1_1 == (var_1_14 ^ var_1_15)) ? (var_1_8 == ((double) (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) + var_1_11))) : (var_1_8 == ((double) var_1_11))) : (var_1_8 == ((double) var_1_10)))) && ((var_1_15 > var_1_15) ? (var_1_12 == ((double) ((((var_1_11) < (var_1_10)) ? (var_1_11) : (var_1_10))))) : 1)) && (var_1_14 == ((signed short int) 200))) && (var_1_15 == ((signed char) var_1_16))) && (var_1_17 == ((double) var_1_10)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=128, var_1_10=2, var_1_12=124/5, var_1_14=200, var_1_15=1, var_1_16=1, var_1_17=2, var_1_1=0, var_1_2=1, var_1_3=0, var_1_4=1, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 408 mSDsluCounter, 1335 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 759 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 619 IncrementalHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 576 mSDtfsCounter, 619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=4, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 146 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 633 ConstructedInterpolants, 0 QuantifiedInterpolants, 3035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 1760/1760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:02:56,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd --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 adf694b6ddef665d6d08615d55edd3b888b46a164390930323ad37ea28078730 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:02:58,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:02:59,094 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:02:59,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:02:59,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:02:59,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:02:59,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:02:59,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:02:59,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:02:59,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:02:59,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:02:59,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:02:59,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:02:59,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:02:59,129 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:02:59,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:02:59,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:02:59,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:02:59,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:02:59,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:02:59,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:02:59,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:02:59,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:02:59,130 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:02:59,130 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:02:59,130 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:02:59,131 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:02:59,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:02:59,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:02:59,131 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:02:59,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:02:59,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:02:59,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:02:59,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:02:59,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:02:59,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:02:59,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:02:59,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:02:59,132 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:02:59,132 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:02:59,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:02:59,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:02:59,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:02:59,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:02:59,133 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd 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 -> adf694b6ddef665d6d08615d55edd3b888b46a164390930323ad37ea28078730 [2024-11-13 14:02:59,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:02:59,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:02:59,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:02:59,505 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:02:59,505 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:02:59,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i Unable to find full path for "g++" [2024-11-13 14:03:01,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:03:01,825 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:03:01,826 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i [2024-11-13 14:03:01,834 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/data/9665c88cf/10b4b96481f249caa799544517150d0b/FLAGbd42865f3 [2024-11-13 14:03:01,851 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/data/9665c88cf/10b4b96481f249caa799544517150d0b [2024-11-13 14:03:01,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:03:01,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:03:01,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:03:01,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:03:01,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:03:01,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:03:01" (1/1) ... [2024-11-13 14:03:01,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1b3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:01, skipping insertion in model container [2024-11-13 14:03:01,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:03:01" (1/1) ... [2024-11-13 14:03:01,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:03:02,096 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i[913,926] [2024-11-13 14:03:02,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:03:02,207 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:03:02,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-83.i[913,926] [2024-11-13 14:03:02,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:03:02,297 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:03:02,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02 WrapperNode [2024-11-13 14:03:02,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:03:02,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:03:02,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:03:02,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:03:02,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,365 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-11-13 14:03:02,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:03:02,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:03:02,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:03:02,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:03:02,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,411 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:03:02,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:03:02,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:03:02,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:03:02,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:03:02,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (1/1) ... [2024-11-13 14:03:02,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:03:02,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:03:02,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:03:02,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:03:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:03:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:03:02,508 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:03:02,509 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:03:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:03:02,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:03:02,591 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:03:02,593 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:03:03,411 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-13 14:03:03,412 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:03:03,426 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:03:03,427 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:03:03,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:03:03 BoogieIcfgContainer [2024-11-13 14:03:03,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:03:03,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:03:03,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:03:03,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:03:03,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:03:01" (1/3) ... [2024-11-13 14:03:03,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8bba68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:03:03, skipping insertion in model container [2024-11-13 14:03:03,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:03:02" (2/3) ... [2024-11-13 14:03:03,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f8bba68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:03:03, skipping insertion in model container [2024-11-13 14:03:03,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:03:03" (3/3) ... [2024-11-13 14:03:03,440 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-83.i [2024-11-13 14:03:03,458 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:03:03,460 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-83.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:03:03,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:03:03,540 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1e68b6b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:03:03,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:03:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:03:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 14:03:03,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:03,557 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:03,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:03,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:03,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1960508404, now seen corresponding path program 1 times [2024-11-13 14:03:03,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:03:03,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125659109] [2024-11-13 14:03:03,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:03,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:03:03,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:03:03,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:03:03,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 14:03:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:03,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:03:03,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:03:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-13 14:03:03,949 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:03:03,951 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:03:03,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125659109] [2024-11-13 14:03:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125659109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:03:03,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:03:03,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:03:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053876361] [2024-11-13 14:03:03,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:03:03,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:03:03,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:03:03,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:03:03,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:03:03,986 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:03:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:03:04,010 INFO L93 Difference]: Finished difference Result 77 states and 125 transitions. [2024-11-13 14:03:04,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:03:04,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2024-11-13 14:03:04,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:03:04,019 INFO L225 Difference]: With dead ends: 77 [2024-11-13 14:03:04,020 INFO L226 Difference]: Without dead ends: 38 [2024-11-13 14:03:04,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:03:04,027 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:03:04,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:03:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-13 14:03:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-13 14:03:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-13 14:03:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2024-11-13 14:03:04,070 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 74 [2024-11-13 14:03:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:03:04,071 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2024-11-13 14:03:04,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-13 14:03:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2024-11-13 14:03:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-13 14:03:04,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:03:04,074 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:03:04,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 14:03:04,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:03:04,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:03:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:03:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1034736532, now seen corresponding path program 1 times [2024-11-13 14:03:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:03:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981953921] [2024-11-13 14:03:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:03:04,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:03:04,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:03:04,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:03:04,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14faa94e-d3f7-4d3f-957a-0c012ab9c707/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 14:03:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:03:04,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-13 14:03:04,574 INFO L278 TraceCheckSpWp]: Computing forward predicates...