./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/kundu1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:52:35,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:52:35,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:52:35,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:52:35,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:52:35,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:52:35,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:52:35,916 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:52:35,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:52:35,917 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:52:35,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:52:35,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:52:35,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:52:35,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:52:35,917 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:52:35,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:52:35,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:52:35,917 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:52:35,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:52:35,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:52:35,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:52:35,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:52:35,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:52:35,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:52:35,920 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:52:35,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:52:35,920 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:52:35,920 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:52:35,920 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:52:35,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:52:35,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:52:35,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:52:35,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:52:35,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:52:35,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:52:35,921 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:52:35,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:52:35,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:52:35,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:52:35,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:52:35,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:52:35,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:52:35,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:52:35,922 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2025-03-08 05:52:36,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:52:36,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:52:36,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:52:36,179 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:52:36,179 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:52:36,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/kundu1.cil.c [2025-03-08 05:52:37,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60548d9a5/c392acd0ec9145f9b751780af950cd93/FLAGb850671b5 [2025-03-08 05:52:37,601 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:52:37,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c [2025-03-08 05:52:37,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60548d9a5/c392acd0ec9145f9b751780af950cd93/FLAGb850671b5 [2025-03-08 05:52:37,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60548d9a5/c392acd0ec9145f9b751780af950cd93 [2025-03-08 05:52:37,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:52:37,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:52:37,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:52:37,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:52:37,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:52:37,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:52:37" (1/1) ... [2025-03-08 05:52:37,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a719b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:37, skipping insertion in model container [2025-03-08 05:52:37,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:52:37" (1/1) ... [2025-03-08 05:52:37,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:52:38,090 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2025-03-08 05:52:38,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:52:38,155 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:52:38,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/kundu1.cil.c[636,649] [2025-03-08 05:52:38,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:52:38,206 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:52:38,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38 WrapperNode [2025-03-08 05:52:38,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:52:38,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:52:38,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:52:38,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:52:38,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,237 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 246 [2025-03-08 05:52:38,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:52:38,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:52:38,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:52:38,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:52:38,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,262 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]. [2025-03-08 05:52:38,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:52:38,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:52:38,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:52:38,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:52:38,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (1/1) ... [2025-03-08 05:52:38,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:52:38,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:38,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:52:38,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:52:38,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:52:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 05:52:38,323 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 05:52:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 05:52:38,323 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 05:52:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 05:52:38,323 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 05:52:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 05:52:38,323 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 05:52:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 05:52:38,323 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 05:52:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:52:38,323 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 05:52:38,324 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 05:52:38,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:52:38,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:52:38,378 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:52:38,380 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:52:38,609 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-08 05:52:38,609 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:52:38,619 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:52:38,619 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:52:38,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:52:38 BoogieIcfgContainer [2025-03-08 05:52:38,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:52:38,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:52:38,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:52:38,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:52:38,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:52:37" (1/3) ... [2025-03-08 05:52:38,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6589d7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:52:38, skipping insertion in model container [2025-03-08 05:52:38,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:52:38" (2/3) ... [2025-03-08 05:52:38,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6589d7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:52:38, skipping insertion in model container [2025-03-08 05:52:38,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:52:38" (3/3) ... [2025-03-08 05:52:38,627 INFO L128 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2025-03-08 05:52:38,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:52:38,640 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG kundu1.cil.c that has 7 procedures, 106 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-08 05:52:38,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:52:38,696 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;@4ca310cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:52:38,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:52:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 87 states have internal predecessors, (121), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 05:52:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 05:52:38,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:38,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:38,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:38,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:38,715 INFO L85 PathProgramCache]: Analyzing trace with hash 612736939, now seen corresponding path program 1 times [2025-03-08 05:52:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283154754] [2025-03-08 05:52:38,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:38,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:52:38,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:52:38,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:38,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:38,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:38,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:38,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283154754] [2025-03-08 05:52:38,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283154754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:38,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:38,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:38,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311378432] [2025-03-08 05:52:38,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:38,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:38,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:38,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:38,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:38,990 INFO L87 Difference]: Start difference. First operand has 106 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 87 states have internal predecessors, (121), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:39,141 INFO L93 Difference]: Finished difference Result 289 states and 418 transitions. [2025-03-08 05:52:39,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:52:39,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-08 05:52:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:39,153 INFO L225 Difference]: With dead ends: 289 [2025-03-08 05:52:39,153 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 05:52:39,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:39,157 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 237 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:39,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 460 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 05:52:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2025-03-08 05:52:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 142 states have (on average 1.4014084507042253) internal successors, (199), 145 states have internal predecessors, (199), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 05:52:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 242 transitions. [2025-03-08 05:52:39,199 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 242 transitions. Word has length 49 [2025-03-08 05:52:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:39,200 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 242 transitions. [2025-03-08 05:52:39,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 242 transitions. [2025-03-08 05:52:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 05:52:39,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:39,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:39,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:52:39,216 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:39,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:39,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1710615496, now seen corresponding path program 1 times [2025-03-08 05:52:39,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:39,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679700128] [2025-03-08 05:52:39,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:39,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:52:39,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:52:39,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:39,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:39,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679700128] [2025-03-08 05:52:39,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679700128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:39,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:39,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:39,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222050282] [2025-03-08 05:52:39,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:39,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:39,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:39,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:39,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:39,340 INFO L87 Difference]: Start difference. First operand 176 states and 242 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:39,391 INFO L93 Difference]: Finished difference Result 345 states and 478 transitions. [2025-03-08 05:52:39,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:39,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-08 05:52:39,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:39,395 INFO L225 Difference]: With dead ends: 345 [2025-03-08 05:52:39,395 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 05:52:39,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:39,397 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:39,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 534 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 05:52:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-08 05:52:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 148 states have internal predecessors, (201), 23 states have call successors, (23), 11 states have call predecessors, (23), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 05:52:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 244 transitions. [2025-03-08 05:52:39,421 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 244 transitions. Word has length 49 [2025-03-08 05:52:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:39,421 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 244 transitions. [2025-03-08 05:52:39,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 244 transitions. [2025-03-08 05:52:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 05:52:39,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:39,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:39,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:52:39,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:39,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1721931623, now seen corresponding path program 1 times [2025-03-08 05:52:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:39,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543137386] [2025-03-08 05:52:39,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:39,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 05:52:39,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 05:52:39,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:39,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:39,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:39,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543137386] [2025-03-08 05:52:39,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543137386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:39,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:39,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984146150] [2025-03-08 05:52:39,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:39,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:39,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:39,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:39,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:39,523 INFO L87 Difference]: Start difference. First operand 179 states and 244 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:39,814 INFO L93 Difference]: Finished difference Result 726 states and 987 transitions. [2025-03-08 05:52:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:52:39,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-08 05:52:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:39,822 INFO L225 Difference]: With dead ends: 726 [2025-03-08 05:52:39,822 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 05:52:39,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:52:39,824 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 542 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:39,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 539 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:52:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 05:52:39,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 397. [2025-03-08 05:52:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 328 states have (on average 1.3871951219512195) internal successors, (455), 330 states have internal predecessors, (455), 44 states have call successors, (44), 24 states have call predecessors, (44), 24 states have return successors, (43), 43 states have call predecessors, (43), 41 states have call successors, (43) [2025-03-08 05:52:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 542 transitions. [2025-03-08 05:52:39,873 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 542 transitions. Word has length 49 [2025-03-08 05:52:39,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:39,873 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 542 transitions. [2025-03-08 05:52:39,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 542 transitions. [2025-03-08 05:52:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 05:52:39,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:39,878 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:39,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:52:39,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:39,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:39,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1180453330, now seen corresponding path program 1 times [2025-03-08 05:52:39,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:39,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548137667] [2025-03-08 05:52:39,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:39,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:39,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 05:52:39,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:52:39,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:39,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:39,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:39,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:39,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548137667] [2025-03-08 05:52:39,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548137667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:39,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:39,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:39,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562951290] [2025-03-08 05:52:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:39,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:39,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:39,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:39,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:39,965 INFO L87 Difference]: Start difference. First operand 397 states and 542 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:40,099 INFO L93 Difference]: Finished difference Result 1029 states and 1402 transitions. [2025-03-08 05:52:40,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:52:40,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2025-03-08 05:52:40,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:40,105 INFO L225 Difference]: With dead ends: 1029 [2025-03-08 05:52:40,105 INFO L226 Difference]: Without dead ends: 642 [2025-03-08 05:52:40,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:40,108 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 222 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:40,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 597 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-08 05:52:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 526. [2025-03-08 05:52:40,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 427 states have (on average 1.3138173302107727) internal successors, (561), 430 states have internal predecessors, (561), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2025-03-08 05:52:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 688 transitions. [2025-03-08 05:52:40,153 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 688 transitions. Word has length 50 [2025-03-08 05:52:40,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:40,155 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 688 transitions. [2025-03-08 05:52:40,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:40,155 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 688 transitions. [2025-03-08 05:52:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 05:52:40,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:40,157 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:40,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:52:40,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:40,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash 936549387, now seen corresponding path program 1 times [2025-03-08 05:52:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:40,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089226313] [2025-03-08 05:52:40,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:40,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 05:52:40,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:52:40,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:40,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:40,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:40,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089226313] [2025-03-08 05:52:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089226313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:40,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:40,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:40,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507028867] [2025-03-08 05:52:40,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:40,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:40,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:40,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:40,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:40,219 INFO L87 Difference]: Start difference. First operand 526 states and 688 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:40,258 INFO L93 Difference]: Finished difference Result 1054 states and 1396 transitions. [2025-03-08 05:52:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:40,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2025-03-08 05:52:40,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:40,262 INFO L225 Difference]: With dead ends: 1054 [2025-03-08 05:52:40,262 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 05:52:40,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:40,266 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:40,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 533 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:40,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 05:52:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-03-08 05:52:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 439 states have (on average 1.2984054669703873) internal successors, (570), 442 states have internal predecessors, (570), 63 states have call successors, (63), 36 states have call predecessors, (63), 35 states have return successors, (64), 60 states have call predecessors, (64), 60 states have call successors, (64) [2025-03-08 05:52:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 697 transitions. [2025-03-08 05:52:40,313 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 697 transitions. Word has length 50 [2025-03-08 05:52:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:40,314 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 697 transitions. [2025-03-08 05:52:40,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 697 transitions. [2025-03-08 05:52:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 05:52:40,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:40,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:40,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:52:40,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:40,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash 869542634, now seen corresponding path program 1 times [2025-03-08 05:52:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:40,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127749307] [2025-03-08 05:52:40,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:40,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:40,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 05:52:40,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 05:52:40,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:40,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:40,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:40,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127749307] [2025-03-08 05:52:40,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127749307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:40,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:40,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096360367] [2025-03-08 05:52:40,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:40,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:40,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:40,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:40,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:40,375 INFO L87 Difference]: Start difference. First operand 538 states and 697 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:52:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:40,444 INFO L93 Difference]: Finished difference Result 1306 states and 1690 transitions. [2025-03-08 05:52:40,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:52:40,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2025-03-08 05:52:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:40,449 INFO L225 Difference]: With dead ends: 1306 [2025-03-08 05:52:40,449 INFO L226 Difference]: Without dead ends: 844 [2025-03-08 05:52:40,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:40,452 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 100 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:40,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 390 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-03-08 05:52:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 839. [2025-03-08 05:52:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 688 states have (on average 1.2906976744186047) internal successors, (888), 691 states have internal predecessors, (888), 95 states have call successors, (95), 56 states have call predecessors, (95), 55 states have return successors, (98), 92 states have call predecessors, (98), 92 states have call successors, (98) [2025-03-08 05:52:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1081 transitions. [2025-03-08 05:52:40,512 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1081 transitions. Word has length 50 [2025-03-08 05:52:40,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:40,513 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1081 transitions. [2025-03-08 05:52:40,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:52:40,513 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1081 transitions. [2025-03-08 05:52:40,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 05:52:40,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:40,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:40,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:52:40,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:40,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:40,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1880839588, now seen corresponding path program 1 times [2025-03-08 05:52:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:40,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890149735] [2025-03-08 05:52:40,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:40,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:40,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 05:52:40,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 05:52:40,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:40,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:40,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:40,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890149735] [2025-03-08 05:52:40,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890149735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:40,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:40,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835088738] [2025-03-08 05:52:40,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:40,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:40,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:40,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:40,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:40,586 INFO L87 Difference]: Start difference. First operand 839 states and 1081 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:52:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:40,719 INFO L93 Difference]: Finished difference Result 1408 states and 1812 transitions. [2025-03-08 05:52:40,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:40,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2025-03-08 05:52:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:40,725 INFO L225 Difference]: With dead ends: 1408 [2025-03-08 05:52:40,725 INFO L226 Difference]: Without dead ends: 932 [2025-03-08 05:52:40,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:40,727 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 305 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:40,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 440 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:40,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-03-08 05:52:40,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 920. [2025-03-08 05:52:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 756 states have (on average 1.287037037037037) internal successors, (973), 759 states have internal predecessors, (973), 103 states have call successors, (103), 61 states have call predecessors, (103), 60 states have return successors, (106), 100 states have call predecessors, (106), 100 states have call successors, (106) [2025-03-08 05:52:40,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1182 transitions. [2025-03-08 05:52:40,787 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1182 transitions. Word has length 58 [2025-03-08 05:52:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:40,787 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1182 transitions. [2025-03-08 05:52:40,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:52:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1182 transitions. [2025-03-08 05:52:40,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 05:52:40,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:40,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:40,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:52:40,790 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:40,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:40,790 INFO L85 PathProgramCache]: Analyzing trace with hash -107741798, now seen corresponding path program 1 times [2025-03-08 05:52:40,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:40,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196081630] [2025-03-08 05:52:40,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:40,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:40,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 05:52:40,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 05:52:40,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:40,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:52:40,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:40,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196081630] [2025-03-08 05:52:40,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196081630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:40,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:40,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:52:40,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940235237] [2025-03-08 05:52:40,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:40,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:52:40,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:40,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:52:40,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:52:40,885 INFO L87 Difference]: Start difference. First operand 920 states and 1182 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:52:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:41,015 INFO L93 Difference]: Finished difference Result 2093 states and 2686 transitions. [2025-03-08 05:52:41,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:52:41,015 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2025-03-08 05:52:41,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:41,022 INFO L225 Difference]: With dead ends: 2093 [2025-03-08 05:52:41,022 INFO L226 Difference]: Without dead ends: 1249 [2025-03-08 05:52:41,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:52:41,025 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 211 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:41,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 565 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-03-08 05:52:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1227. [2025-03-08 05:52:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1011 states have (on average 1.2838773491592483) internal successors, (1298), 1014 states have internal predecessors, (1298), 135 states have call successors, (135), 81 states have call predecessors, (135), 80 states have return successors, (140), 132 states have call predecessors, (140), 132 states have call successors, (140) [2025-03-08 05:52:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1573 transitions. [2025-03-08 05:52:41,097 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1573 transitions. Word has length 61 [2025-03-08 05:52:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:41,097 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1573 transitions. [2025-03-08 05:52:41,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 05:52:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1573 transitions. [2025-03-08 05:52:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:52:41,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:41,098 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:41,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:52:41,099 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:41,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:41,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2065053383, now seen corresponding path program 1 times [2025-03-08 05:52:41,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:41,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249835096] [2025-03-08 05:52:41,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:41,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:41,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:52:41,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:52:41,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:41,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:52:41,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:41,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249835096] [2025-03-08 05:52:41,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249835096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:41,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:41,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:41,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718690643] [2025-03-08 05:52:41,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:41,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:41,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:41,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:41,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:41,141 INFO L87 Difference]: Start difference. First operand 1227 states and 1573 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:52:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:41,341 INFO L93 Difference]: Finished difference Result 3663 states and 4772 transitions. [2025-03-08 05:52:41,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:41,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2025-03-08 05:52:41,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:41,352 INFO L225 Difference]: With dead ends: 3663 [2025-03-08 05:52:41,352 INFO L226 Difference]: Without dead ends: 2447 [2025-03-08 05:52:41,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:41,357 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 154 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:41,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 324 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2025-03-08 05:52:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2443. [2025-03-08 05:52:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2443 states, 2005 states have (on average 1.2528678304239402) internal successors, (2512), 2020 states have internal predecessors, (2512), 266 states have call successors, (266), 161 states have call predecessors, (266), 171 states have return successors, (355), 263 states have call predecessors, (355), 263 states have call successors, (355) [2025-03-08 05:52:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2443 states to 2443 states and 3133 transitions. [2025-03-08 05:52:41,459 INFO L78 Accepts]: Start accepts. Automaton has 2443 states and 3133 transitions. Word has length 65 [2025-03-08 05:52:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:41,459 INFO L471 AbstractCegarLoop]: Abstraction has 2443 states and 3133 transitions. [2025-03-08 05:52:41,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:52:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2443 states and 3133 transitions. [2025-03-08 05:52:41,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:52:41,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:41,460 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:41,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:52:41,461 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:41,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:41,461 INFO L85 PathProgramCache]: Analyzing trace with hash -833109619, now seen corresponding path program 1 times [2025-03-08 05:52:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:41,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265939712] [2025-03-08 05:52:41,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:41,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:41,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:52:41,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:52:41,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:41,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:52:41,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:41,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265939712] [2025-03-08 05:52:41,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265939712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:41,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:41,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:52:41,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680838489] [2025-03-08 05:52:41,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:41,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:52:41,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:41,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:52:41,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:41,519 INFO L87 Difference]: Start difference. First operand 2443 states and 3133 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:52:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:41,840 INFO L93 Difference]: Finished difference Result 6311 states and 8198 transitions. [2025-03-08 05:52:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:52:41,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 67 [2025-03-08 05:52:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:41,856 INFO L225 Difference]: With dead ends: 6311 [2025-03-08 05:52:41,857 INFO L226 Difference]: Without dead ends: 3884 [2025-03-08 05:52:41,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:52:41,862 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 605 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:41,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 601 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:41,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2025-03-08 05:52:41,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3799. [2025-03-08 05:52:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3799 states, 3087 states have (on average 1.225137674117266) internal successors, (3782), 3112 states have internal predecessors, (3782), 432 states have call successors, (432), 261 states have call predecessors, (432), 279 states have return successors, (631), 429 states have call predecessors, (631), 429 states have call successors, (631) [2025-03-08 05:52:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3799 states to 3799 states and 4845 transitions. [2025-03-08 05:52:42,002 INFO L78 Accepts]: Start accepts. Automaton has 3799 states and 4845 transitions. Word has length 67 [2025-03-08 05:52:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:42,003 INFO L471 AbstractCegarLoop]: Abstraction has 3799 states and 4845 transitions. [2025-03-08 05:52:42,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:52:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3799 states and 4845 transitions. [2025-03-08 05:52:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:52:42,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:42,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:42,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:52:42,005 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:42,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:42,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1485349884, now seen corresponding path program 1 times [2025-03-08 05:52:42,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:42,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903483873] [2025-03-08 05:52:42,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:42,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:42,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:52:42,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:52:42,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:42,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:52:42,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:42,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903483873] [2025-03-08 05:52:42,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903483873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:42,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:42,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:52:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128668308] [2025-03-08 05:52:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:42,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:52:42,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:42,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:52:42,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:42,045 INFO L87 Difference]: Start difference. First operand 3799 states and 4845 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:52:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:42,333 INFO L93 Difference]: Finished difference Result 7224 states and 9167 transitions. [2025-03-08 05:52:42,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:52:42,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 68 [2025-03-08 05:52:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:42,354 INFO L225 Difference]: With dead ends: 7224 [2025-03-08 05:52:42,355 INFO L226 Difference]: Without dead ends: 3852 [2025-03-08 05:52:42,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:42,364 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 115 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:42,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 309 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states. [2025-03-08 05:52:42,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 3712. [2025-03-08 05:52:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3002 states have (on average 1.2135243171219188) internal successors, (3643), 3051 states have internal predecessors, (3643), 416 states have call successors, (416), 251 states have call predecessors, (416), 293 states have return successors, (574), 413 states have call predecessors, (574), 413 states have call successors, (574) [2025-03-08 05:52:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 4633 transitions. [2025-03-08 05:52:42,524 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 4633 transitions. Word has length 68 [2025-03-08 05:52:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:42,524 INFO L471 AbstractCegarLoop]: Abstraction has 3712 states and 4633 transitions. [2025-03-08 05:52:42,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:52:42,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 4633 transitions. [2025-03-08 05:52:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:52:42,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:42,526 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:42,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:52:42,526 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:42,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1586261851, now seen corresponding path program 1 times [2025-03-08 05:52:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:42,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851326251] [2025-03-08 05:52:42,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:42,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:52:42,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:52:42,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:42,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:52:42,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:42,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851326251] [2025-03-08 05:52:42,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851326251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:42,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:42,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:42,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059498381] [2025-03-08 05:52:42,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:42,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:42,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:42,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:42,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:42,546 INFO L87 Difference]: Start difference. First operand 3712 states and 4633 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:42,685 INFO L93 Difference]: Finished difference Result 3967 states and 4940 transitions. [2025-03-08 05:52:42,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:42,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2025-03-08 05:52:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:42,701 INFO L225 Difference]: With dead ends: 3967 [2025-03-08 05:52:42,702 INFO L226 Difference]: Without dead ends: 3704 [2025-03-08 05:52:42,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:42,705 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:42,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:42,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3704 states. [2025-03-08 05:52:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3704 to 3584. [2025-03-08 05:52:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 2906 states have (on average 1.2143840330351) internal successors, (3529), 2953 states have internal predecessors, (3529), 394 states have call successors, (394), 241 states have call predecessors, (394), 283 states have return successors, (549), 391 states have call predecessors, (549), 391 states have call successors, (549) [2025-03-08 05:52:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4472 transitions. [2025-03-08 05:52:42,890 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 4472 transitions. Word has length 68 [2025-03-08 05:52:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:42,890 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 4472 transitions. [2025-03-08 05:52:42,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 05:52:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 4472 transitions. [2025-03-08 05:52:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:52:42,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:42,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:42,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:52:42,892 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:42,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:42,892 INFO L85 PathProgramCache]: Analyzing trace with hash 643490267, now seen corresponding path program 1 times [2025-03-08 05:52:42,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:42,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722266365] [2025-03-08 05:52:42,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:42,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:42,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:52:42,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:52:42,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:42,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:52:42,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:42,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722266365] [2025-03-08 05:52:42,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722266365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:42,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:42,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:52:42,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127122812] [2025-03-08 05:52:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:42,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:52:42,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:42,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:52:42,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:52:42,936 INFO L87 Difference]: Start difference. First operand 3584 states and 4472 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:52:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:43,327 INFO L93 Difference]: Finished difference Result 7238 states and 9009 transitions. [2025-03-08 05:52:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:52:43,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2025-03-08 05:52:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:43,342 INFO L225 Difference]: With dead ends: 7238 [2025-03-08 05:52:43,342 INFO L226 Difference]: Without dead ends: 3611 [2025-03-08 05:52:43,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:52:43,350 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 756 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:43,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 878 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:52:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3611 states. [2025-03-08 05:52:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3611 to 3525. [2025-03-08 05:52:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 2860 states have (on average 1.1986013986013986) internal successors, (3428), 2907 states have internal predecessors, (3428), 386 states have call successors, (386), 236 states have call predecessors, (386), 278 states have return successors, (469), 383 states have call predecessors, (469), 383 states have call successors, (469) [2025-03-08 05:52:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 4283 transitions. [2025-03-08 05:52:43,497 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 4283 transitions. Word has length 69 [2025-03-08 05:52:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:43,497 INFO L471 AbstractCegarLoop]: Abstraction has 3525 states and 4283 transitions. [2025-03-08 05:52:43,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-08 05:52:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 4283 transitions. [2025-03-08 05:52:43,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:52:43,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:43,504 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:43,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:52:43,504 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:43,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1137667695, now seen corresponding path program 1 times [2025-03-08 05:52:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:43,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056642084] [2025-03-08 05:52:43,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:43,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:52:43,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:52:43,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:43,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 05:52:43,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:43,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056642084] [2025-03-08 05:52:43,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056642084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:43,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938367347] [2025-03-08 05:52:43,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:43,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:43,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:43,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:43,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:52:43,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:52:43,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:52:43,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:43,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:43,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:52:43,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 05:52:43,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:52:43,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938367347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:43,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:52:43,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-03-08 05:52:43,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756178740] [2025-03-08 05:52:43,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:43,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:43,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:43,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:43,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:52:43,782 INFO L87 Difference]: Start difference. First operand 3525 states and 4283 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:52:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:43,876 INFO L93 Difference]: Finished difference Result 5552 states and 6777 transitions. [2025-03-08 05:52:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:43,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-08 05:52:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:43,885 INFO L225 Difference]: With dead ends: 5552 [2025-03-08 05:52:43,886 INFO L226 Difference]: Without dead ends: 2315 [2025-03-08 05:52:43,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:52:43,891 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:43,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 131 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:43,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2315 states. [2025-03-08 05:52:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2315 to 2179. [2025-03-08 05:52:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1770 states have (on average 1.1847457627118645) internal successors, (2097), 1797 states have internal predecessors, (2097), 238 states have call successors, (238), 146 states have call predecessors, (238), 170 states have return successors, (286), 236 states have call predecessors, (286), 236 states have call successors, (286) [2025-03-08 05:52:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2621 transitions. [2025-03-08 05:52:43,981 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 2621 transitions. Word has length 122 [2025-03-08 05:52:43,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:43,981 INFO L471 AbstractCegarLoop]: Abstraction has 2179 states and 2621 transitions. [2025-03-08 05:52:43,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:52:43,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2621 transitions. [2025-03-08 05:52:43,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:52:43,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:43,985 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:43,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:44,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 05:52:44,186 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:44,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash -31668615, now seen corresponding path program 1 times [2025-03-08 05:52:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:44,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914464293] [2025-03-08 05:52:44,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:44,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:44,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:52:44,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:52:44,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:44,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 05:52:44,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914464293] [2025-03-08 05:52:44,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914464293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:44,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883277562] [2025-03-08 05:52:44,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:44,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:44,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:44,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:44,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:52:44,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:52:44,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:52:44,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:44,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:44,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:52:44,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:44,432 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 05:52:44,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:52:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883277562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:44,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:52:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-03-08 05:52:44,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135442776] [2025-03-08 05:52:44,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:44,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:44,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:44,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:44,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:52:44,434 INFO L87 Difference]: Start difference. First operand 2179 states and 2621 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:52:44,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:44,539 INFO L93 Difference]: Finished difference Result 4669 states and 5600 transitions. [2025-03-08 05:52:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:44,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-03-08 05:52:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:44,553 INFO L225 Difference]: With dead ends: 4669 [2025-03-08 05:52:44,553 INFO L226 Difference]: Without dead ends: 2685 [2025-03-08 05:52:44,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:52:44,559 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 44 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:44,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 251 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2025-03-08 05:52:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2685. [2025-03-08 05:52:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2685 states, 2167 states have (on average 1.1707429626211352) internal successors, (2537), 2195 states have internal predecessors, (2537), 301 states have call successors, (301), 191 states have call predecessors, (301), 216 states have return successors, (350), 299 states have call predecessors, (350), 299 states have call successors, (350) [2025-03-08 05:52:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2685 states to 2685 states and 3188 transitions. [2025-03-08 05:52:44,706 INFO L78 Accepts]: Start accepts. Automaton has 2685 states and 3188 transitions. Word has length 126 [2025-03-08 05:52:44,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:44,706 INFO L471 AbstractCegarLoop]: Abstraction has 2685 states and 3188 transitions. [2025-03-08 05:52:44,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:52:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2685 states and 3188 transitions. [2025-03-08 05:52:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 05:52:44,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:44,710 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:44,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 05:52:44,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 05:52:44,911 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:44,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash -996539179, now seen corresponding path program 1 times [2025-03-08 05:52:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:44,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444550016] [2025-03-08 05:52:44,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:44,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:52:44,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:52:44,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:44,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 18 proven. 34 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-08 05:52:44,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444550016] [2025-03-08 05:52:44,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444550016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969392725] [2025-03-08 05:52:44,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:44,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:44,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:45,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:45,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:52:45,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:52:45,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:52:45,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:45,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:45,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:52:45,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 05:52:45,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:52:45,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969392725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:45,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:52:45,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-03-08 05:52:45,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086130386] [2025-03-08 05:52:45,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:45,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:52:45,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:45,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:52:45,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:52:45,139 INFO L87 Difference]: Start difference. First operand 2685 states and 3188 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:52:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:45,202 INFO L93 Difference]: Finished difference Result 4595 states and 5465 transitions. [2025-03-08 05:52:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:52:45,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 149 [2025-03-08 05:52:45,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:45,213 INFO L225 Difference]: With dead ends: 4595 [2025-03-08 05:52:45,213 INFO L226 Difference]: Without dead ends: 1921 [2025-03-08 05:52:45,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:52:45,218 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:45,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 631 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2025-03-08 05:52:45,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1921. [2025-03-08 05:52:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1921 states, 1613 states have (on average 1.171109733415995) internal successors, (1889), 1622 states have internal predecessors, (1889), 173 states have call successors, (173), 111 states have call predecessors, (173), 134 states have return successors, (210), 187 states have call predecessors, (210), 171 states have call successors, (210) [2025-03-08 05:52:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1921 states to 1921 states and 2272 transitions. [2025-03-08 05:52:45,275 INFO L78 Accepts]: Start accepts. Automaton has 1921 states and 2272 transitions. Word has length 149 [2025-03-08 05:52:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:45,276 INFO L471 AbstractCegarLoop]: Abstraction has 1921 states and 2272 transitions. [2025-03-08 05:52:45,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:52:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1921 states and 2272 transitions. [2025-03-08 05:52:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 05:52:45,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:45,278 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:45,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:52:45,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:45,482 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:45,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:45,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1207002198, now seen corresponding path program 1 times [2025-03-08 05:52:45,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:45,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943865095] [2025-03-08 05:52:45,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:45,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 05:52:45,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 05:52:45,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:45,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:45,567 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 05:52:45,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:45,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943865095] [2025-03-08 05:52:45,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943865095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:45,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:45,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:45,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949558317] [2025-03-08 05:52:45,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:45,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:45,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:45,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:45,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:45,569 INFO L87 Difference]: Start difference. First operand 1921 states and 2272 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:52:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:45,637 INFO L93 Difference]: Finished difference Result 1924 states and 2274 transitions. [2025-03-08 05:52:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:45,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2025-03-08 05:52:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:45,644 INFO L225 Difference]: With dead ends: 1924 [2025-03-08 05:52:45,644 INFO L226 Difference]: Without dead ends: 1723 [2025-03-08 05:52:45,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:45,645 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 38 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:45,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 235 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-03-08 05:52:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1723. [2025-03-08 05:52:45,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1451 states have (on average 1.1743625086147484) internal successors, (1704), 1460 states have internal predecessors, (1704), 152 states have call successors, (152), 97 states have call predecessors, (152), 119 states have return successors, (187), 165 states have call predecessors, (187), 150 states have call successors, (187) [2025-03-08 05:52:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2043 transitions. [2025-03-08 05:52:45,732 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2043 transitions. Word has length 153 [2025-03-08 05:52:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:45,732 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2043 transitions. [2025-03-08 05:52:45,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:52:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2043 transitions. [2025-03-08 05:52:45,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-08 05:52:45,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:45,735 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:45,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:52:45,735 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:45,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:45,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1202390337, now seen corresponding path program 1 times [2025-03-08 05:52:45,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:45,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025979729] [2025-03-08 05:52:45,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:45,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:45,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 05:52:45,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 05:52:45,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-08 05:52:45,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:45,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025979729] [2025-03-08 05:52:45,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025979729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:45,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953913535] [2025-03-08 05:52:45,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:45,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:45,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:45,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:45,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:52:45,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-08 05:52:45,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-08 05:52:45,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:45,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:45,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:52:45,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:45,984 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-08 05:52:45,985 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:52:45,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953913535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:45,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:52:45,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2025-03-08 05:52:45,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964234769] [2025-03-08 05:52:45,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:45,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:45,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:45,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:45,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:45,986 INFO L87 Difference]: Start difference. First operand 1723 states and 2043 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:52:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:46,052 INFO L93 Difference]: Finished difference Result 3213 states and 3832 transitions. [2025-03-08 05:52:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:46,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 159 [2025-03-08 05:52:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:46,058 INFO L225 Difference]: With dead ends: 3213 [2025-03-08 05:52:46,058 INFO L226 Difference]: Without dead ends: 1634 [2025-03-08 05:52:46,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:46,061 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 25 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:46,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 245 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-03-08 05:52:46,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2025-03-08 05:52:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1381 states have (on average 1.1759594496741492) internal successors, (1624), 1390 states have internal predecessors, (1624), 141 states have call successors, (141), 90 states have call predecessors, (141), 111 states have return successors, (175), 153 states have call predecessors, (175), 139 states have call successors, (175) [2025-03-08 05:52:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1940 transitions. [2025-03-08 05:52:46,105 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1940 transitions. Word has length 159 [2025-03-08 05:52:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:46,106 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 1940 transitions. [2025-03-08 05:52:46,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:52:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1940 transitions. [2025-03-08 05:52:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 05:52:46,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:46,107 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:46,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:46,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 05:52:46,312 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:46,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1328465015, now seen corresponding path program 1 times [2025-03-08 05:52:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:46,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661806722] [2025-03-08 05:52:46,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:46,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 05:52:46,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 05:52:46,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:46,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-08 05:52:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661806722] [2025-03-08 05:52:46,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661806722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840152704] [2025-03-08 05:52:46,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:46,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:46,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:46,433 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:46,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:52:46,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 05:52:46,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 05:52:46,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:46,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:46,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:52:46,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 66 proven. 1 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 05:52:46,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:46,931 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-03-08 05:52:46,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840152704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:46,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:46,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2025-03-08 05:52:46,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921993256] [2025-03-08 05:52:46,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:46,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:52:46,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:46,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:52:46,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:52:46,933 INFO L87 Difference]: Start difference. First operand 1634 states and 1940 transitions. Second operand has 10 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-08 05:52:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:47,125 INFO L93 Difference]: Finished difference Result 4522 states and 5416 transitions. [2025-03-08 05:52:47,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:52:47,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 160 [2025-03-08 05:52:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:47,135 INFO L225 Difference]: With dead ends: 4522 [2025-03-08 05:52:47,136 INFO L226 Difference]: Without dead ends: 3084 [2025-03-08 05:52:47,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 313 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:52:47,138 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 370 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:47,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 667 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2025-03-08 05:52:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2934. [2025-03-08 05:52:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2491 states have (on average 1.1806503412284224) internal successors, (2941), 2508 states have internal predecessors, (2941), 246 states have call successors, (246), 154 states have call predecessors, (246), 196 states have return successors, (314), 271 states have call predecessors, (314), 244 states have call successors, (314) [2025-03-08 05:52:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 3501 transitions. [2025-03-08 05:52:47,221 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 3501 transitions. Word has length 160 [2025-03-08 05:52:47,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:47,222 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 3501 transitions. [2025-03-08 05:52:47,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 20.5) internal successors, (205), 10 states have internal predecessors, (205), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) [2025-03-08 05:52:47,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 3501 transitions. [2025-03-08 05:52:47,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-08 05:52:47,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:47,225 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:47,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:47,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:47,429 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:47,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:47,429 INFO L85 PathProgramCache]: Analyzing trace with hash 107422595, now seen corresponding path program 1 times [2025-03-08 05:52:47,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:47,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61765910] [2025-03-08 05:52:47,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:47,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-08 05:52:47,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-08 05:52:47,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:47,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:47,485 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 70 proven. 14 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-08 05:52:47,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61765910] [2025-03-08 05:52:47,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61765910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:47,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795207567] [2025-03-08 05:52:47,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:47,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:47,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:47,487 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:47,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:52:47,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-08 05:52:47,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-08 05:52:47,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:47,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:47,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:52:47,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-08 05:52:47,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:52:47,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795207567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:47,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:52:47,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 05:52:47,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089853401] [2025-03-08 05:52:47,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:47,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:47,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:47,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:47,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:47,654 INFO L87 Difference]: Start difference. First operand 2934 states and 3501 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:52:47,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:47,753 INFO L93 Difference]: Finished difference Result 7229 states and 8673 transitions. [2025-03-08 05:52:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:47,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 239 [2025-03-08 05:52:47,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:47,766 INFO L225 Difference]: With dead ends: 7229 [2025-03-08 05:52:47,767 INFO L226 Difference]: Without dead ends: 4491 [2025-03-08 05:52:47,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:52:47,772 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 61 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:47,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 332 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2025-03-08 05:52:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4432. [2025-03-08 05:52:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4432 states, 3756 states have (on average 1.1773162939297124) internal successors, (4422), 3773 states have internal predecessors, (4422), 386 states have call successors, (386), 239 states have call predecessors, (386), 289 states have return successors, (462), 419 states have call predecessors, (462), 384 states have call successors, (462) [2025-03-08 05:52:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 5270 transitions. [2025-03-08 05:52:47,945 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 5270 transitions. Word has length 239 [2025-03-08 05:52:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:47,946 INFO L471 AbstractCegarLoop]: Abstraction has 4432 states and 5270 transitions. [2025-03-08 05:52:47,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-08 05:52:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 5270 transitions. [2025-03-08 05:52:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2025-03-08 05:52:47,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:47,950 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:47,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:52:48,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:48,152 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:48,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:48,153 INFO L85 PathProgramCache]: Analyzing trace with hash -411869692, now seen corresponding path program 1 times [2025-03-08 05:52:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504190258] [2025-03-08 05:52:48,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:48,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:48,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-08 05:52:48,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-08 05:52:48,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:48,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 70 proven. 14 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-08 05:52:48,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:48,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504190258] [2025-03-08 05:52:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504190258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484229309] [2025-03-08 05:52:48,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:48,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:48,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:48,223 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:48,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:52:48,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes. [2025-03-08 05:52:48,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements. [2025-03-08 05:52:48,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:48,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:48,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:52:48,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-08 05:52:48,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:52:48,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484229309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:48,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:52:48,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-03-08 05:52:48,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742647047] [2025-03-08 05:52:48,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:48,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:48,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:48,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:48,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:48,381 INFO L87 Difference]: Start difference. First operand 4432 states and 5270 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:52:48,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:48,473 INFO L93 Difference]: Finished difference Result 5073 states and 6041 transitions. [2025-03-08 05:52:48,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:48,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 239 [2025-03-08 05:52:48,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:48,484 INFO L225 Difference]: With dead ends: 5073 [2025-03-08 05:52:48,485 INFO L226 Difference]: Without dead ends: 4435 [2025-03-08 05:52:48,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:52:48,488 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 49 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:48,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 326 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2025-03-08 05:52:48,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 4432. [2025-03-08 05:52:48,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4432 states, 3756 states have (on average 1.1741214057507987) internal successors, (4410), 3773 states have internal predecessors, (4410), 386 states have call successors, (386), 239 states have call predecessors, (386), 289 states have return successors, (462), 419 states have call predecessors, (462), 384 states have call successors, (462) [2025-03-08 05:52:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4432 states to 4432 states and 5258 transitions. [2025-03-08 05:52:48,656 INFO L78 Accepts]: Start accepts. Automaton has 4432 states and 5258 transitions. Word has length 239 [2025-03-08 05:52:48,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:48,657 INFO L471 AbstractCegarLoop]: Abstraction has 4432 states and 5258 transitions. [2025-03-08 05:52:48,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:52:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4432 states and 5258 transitions. [2025-03-08 05:52:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-08 05:52:48,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:48,662 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:48,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:48,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:48,864 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:48,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:48,864 INFO L85 PathProgramCache]: Analyzing trace with hash 404040364, now seen corresponding path program 1 times [2025-03-08 05:52:48,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:48,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617029496] [2025-03-08 05:52:48,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:48,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:48,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-08 05:52:48,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-08 05:52:48,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:48,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-03-08 05:52:48,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:48,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617029496] [2025-03-08 05:52:48,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617029496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:52:48,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:52:48,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:52:48,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917529011] [2025-03-08 05:52:48,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:52:48,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:52:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:48,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:52:48,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:48,905 INFO L87 Difference]: Start difference. First operand 4432 states and 5258 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:52:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:48,967 INFO L93 Difference]: Finished difference Result 6725 states and 7991 transitions. [2025-03-08 05:52:48,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:52:48,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 242 [2025-03-08 05:52:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:48,976 INFO L225 Difference]: With dead ends: 6725 [2025-03-08 05:52:48,976 INFO L226 Difference]: Without dead ends: 2434 [2025-03-08 05:52:48,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:52:48,984 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 22 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:48,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 265 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:52:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2025-03-08 05:52:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2434. [2025-03-08 05:52:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2087 states have (on average 1.1471011020603736) internal successors, (2394), 2104 states have internal predecessors, (2394), 182 states have call successors, (182), 122 states have call predecessors, (182), 164 states have return successors, (223), 207 states have call predecessors, (223), 180 states have call successors, (223) [2025-03-08 05:52:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 2799 transitions. [2025-03-08 05:52:49,053 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 2799 transitions. Word has length 242 [2025-03-08 05:52:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:49,054 INFO L471 AbstractCegarLoop]: Abstraction has 2434 states and 2799 transitions. [2025-03-08 05:52:49,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 05:52:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 2799 transitions. [2025-03-08 05:52:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-08 05:52:49,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:49,058 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:49,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:52:49,058 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:49,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1140508780, now seen corresponding path program 1 times [2025-03-08 05:52:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:49,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188771224] [2025-03-08 05:52:49,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:49,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:49,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 05:52:49,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 05:52:49,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:49,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 67 proven. 22 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2025-03-08 05:52:49,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:49,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188771224] [2025-03-08 05:52:49,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188771224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:49,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811226764] [2025-03-08 05:52:49,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:49,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:49,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:49,145 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:52:49,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 05:52:49,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 05:52:49,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 05:52:49,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:49,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:49,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 05:52:49,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 393 proven. 1 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 05:52:49,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:52:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 88 proven. 1 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2025-03-08 05:52:49,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811226764] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:52:49,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:52:49,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-08 05:52:49,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734601657] [2025-03-08 05:52:49,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:49,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:52:49,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:49,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:52:49,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:52:49,538 INFO L87 Difference]: Start difference. First operand 2434 states and 2799 transitions. Second operand has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 4 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-08 05:52:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:49,701 INFO L93 Difference]: Finished difference Result 4264 states and 4916 transitions. [2025-03-08 05:52:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:52:49,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 4 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) Word has length 266 [2025-03-08 05:52:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:49,709 INFO L225 Difference]: With dead ends: 4264 [2025-03-08 05:52:49,709 INFO L226 Difference]: Without dead ends: 2453 [2025-03-08 05:52:49,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 528 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:52:49,712 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 178 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:49,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 780 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:52:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2025-03-08 05:52:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2442. [2025-03-08 05:52:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2095 states have (on average 1.1455847255369929) internal successors, (2400), 2112 states have internal predecessors, (2400), 182 states have call successors, (182), 122 states have call predecessors, (182), 164 states have return successors, (223), 207 states have call predecessors, (223), 180 states have call successors, (223) [2025-03-08 05:52:49,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 2805 transitions. [2025-03-08 05:52:49,790 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 2805 transitions. Word has length 266 [2025-03-08 05:52:49,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:49,790 INFO L471 AbstractCegarLoop]: Abstraction has 2442 states and 2805 transitions. [2025-03-08 05:52:49,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 4 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-08 05:52:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 2805 transitions. [2025-03-08 05:52:49,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-08 05:52:49,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:49,795 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:49,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:49,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 05:52:49,999 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:50,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:50,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1043969464, now seen corresponding path program 1 times [2025-03-08 05:52:50,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:50,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566275843] [2025-03-08 05:52:50,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:52:50,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:50,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-08 05:52:50,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-08 05:52:50,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:50,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:52:50,023 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:52:50,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-08 05:52:50,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-08 05:52:50,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:52:50,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:52:50,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:52:50,105 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:52:50,105 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:52:50,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:52:50,109 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:50,242 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:52:50,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:52:50 BoogieIcfgContainer [2025-03-08 05:52:50,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:52:50,245 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:52:50,246 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:52:50,246 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:52:50,246 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:52:38" (3/4) ... [2025-03-08 05:52:50,247 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:52:50,379 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 179. [2025-03-08 05:52:50,493 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:52:50,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:52:50,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:52:50,494 INFO L158 Benchmark]: Toolchain (without parser) took 12536.30ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 114.1MB in the beginning and 493.0MB in the end (delta: -378.8MB). Peak memory consumption was 232.2MB. Max. memory is 16.1GB. [2025-03-08 05:52:50,494 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:52:50,494 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.62ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 100.5MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:52:50,494 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.29ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:52:50,495 INFO L158 Benchmark]: Boogie Preprocessor took 32.77ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:52:50,495 INFO L158 Benchmark]: IcfgBuilder took 345.81ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 77.2MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:52:50,495 INFO L158 Benchmark]: TraceAbstraction took 11623.40ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 76.7MB in the beginning and 522.3MB in the end (delta: -445.7MB). Peak memory consumption was 165.1MB. Max. memory is 16.1GB. [2025-03-08 05:52:50,495 INFO L158 Benchmark]: Witness Printer took 248.15ms. Allocated memory is still 755.0MB. Free memory was 522.3MB in the beginning and 493.0MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 05:52:50,500 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.30ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.62ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 100.5MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.29ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.77ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 97.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 345.81ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 77.2MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11623.40ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 76.7MB in the beginning and 522.3MB in the end (delta: -445.7MB). Peak memory consumption was 165.1MB. Max. memory is 16.1GB. * Witness Printer took 248.15ms. Allocated memory is still 755.0MB. Free memory was 522.3MB in the beginning and 493.0MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. 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 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int max_loop ; [L26] int num ; [L27] int i ; [L28] int e ; [L29] int timer ; [L30] char data_0 ; [L31] char data_1 ; [L74] int P_1_pc; [L75] int P_1_st ; [L76] int P_1_i ; [L77] int P_1_ev ; [L132] int C_1_pc ; [L133] int C_1_st ; [L134] int C_1_i ; [L135] int C_1_ev ; [L136] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, timer=0] [L500] int count ; [L501] int __retres2 ; [L505] num = 0 [L506] i = 0 [L507] max_loop = 2 [L509] timer = 0 [L510] P_1_pc = 0 [L511] C_1_pc = 0 [L513] count = 0 [L514] CALL init_model() [L493] P_1_i = 1 [L494] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L514] RET init_model() [L515] CALL start_simulation() [L431] int kernel_st ; [L432] int tmp ; [L433] int tmp___0 ; [L437] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L438] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L439] CALL init_threads() [L236] COND TRUE (int )P_1_i == 1 [L237] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L241] COND TRUE (int )C_1_i == 1 [L242] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L439] RET init_threads() [L440] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L441] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L117] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L129] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \result=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L199] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, __retres1=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L221] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, \result=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \old(C_1_st)=0, \old(P_1_st)=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L441] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L442] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, __retres1=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \result=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L304] COND TRUE (int )C_1_st == 0 [L306] tmp___1 = __VERIFIER_nondet_int() [L308] COND TRUE \read(tmp___1) [L310] C_1_st = 1 [L311] CALL C_1() [L138] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L141] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L156] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, timer=0] [L158] COND TRUE num == 0 [L159] timer = 1 [L160] i += 1 [L161] C_1_pc = 1 [L162] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L311] RET C_1() [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, __retres1=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, \result=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L96] CALL write_data(num, 'A') [L59] COND TRUE i___0 == 0 [L60] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=0, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L458] RET activate_threads() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L129] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L221] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres2=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L427] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=0, e=0, i=1, i___0=1, max_loop=2, num=1, timer=1] [L62] COND TRUE i___0 == 1 [L63] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, timer=1] [L96] RET write_data(num, 'A') [L97] num += 1 [L98] P_1_pc = 1 [L99] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L296] RET P_1() [L304] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L449] RET eval() [L452] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L453] FCALL update_channels() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L456] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L457] FCALL fire_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L458] CALL activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L127] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND FALSE !(\read(tmp)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L458] RET activate_threads() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L459] FCALL reset_delta_events() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L258] COND FALSE !((int )C_1_st == 0) [L266] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L462] tmp = exists_runnable_thread() [L464] COND TRUE tmp == 0 [L466] kernel_st = 4 [L467] CALL fire_time_events() [L346] C_1_ev = 1 [L348] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L467] RET fire_time_events() [L468] CALL activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L375] int tmp ; [L376] int tmp___0 ; [L377] int tmp___1 ; [L381] CALL, EXPR is_P_1_triggered() [L114] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L117] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L118] COND TRUE (int )P_1_ev == 1 [L119] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L129] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, \old(C_1_st)=2, \old(P_1_st)=2, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L381] RET, EXPR is_P_1_triggered() [L381] tmp = is_P_1_triggered() [L383] COND TRUE \read(tmp) [L384] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] CALL, EXPR is_C_1_triggered() [L196] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L199] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L200] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L209] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L219] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, __retres1=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L221] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L389] RET, EXPR is_C_1_triggered() [L389] tmp___1 = is_C_1_triggered() [L391] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, \old(C_1_st)=2, \old(P_1_st)=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L468] RET activate_threads() VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L469] CALL reset_time_events() [L360] COND TRUE (int )P_1_ev == 1 [L361] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L365] COND TRUE (int )C_1_ev == 1 [L366] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L469] RET reset_time_events() [L475] CALL, EXPR stop_simulation() [L412] int tmp ; [L413] int __retres2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L417] tmp = exists_runnable_thread() [L419] COND TRUE \read(tmp) [L420] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres2=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L427] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L475] RET, EXPR stop_simulation() [L475] tmp___0 = stop_simulation() [L477] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L448] kernel_st = 1 [L449] CALL eval() [L272] int tmp ; [L273] int tmp___0 ; [L274] int tmp___1 ; [L275] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] CALL, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L251] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L254] COND TRUE (int )P_1_st == 0 [L255] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, __retres1=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L268] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, \result=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] RET, EXPR exists_runnable_thread() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L282] tmp___2 = exists_runnable_thread() [L284] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L289] COND TRUE (int )P_1_st == 0 [L291] tmp = __VERIFIER_nondet_int() [L293] COND TRUE \read(tmp) [L295] P_1_st = 1 [L296] CALL P_1() [L82] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L85] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L93] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L96] CALL write_data(num, 'A') [L59] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=65, e=0, i=1, i___0=2, max_loop=2, num=2, timer=1] [L62] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, c=65, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L66] CALL error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] [L19] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 106 locations, 166 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 24, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4253 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4239 mSDsluCounter, 10169 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6077 mSDsCounter, 510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1240 IncrementalHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 510 mSolverCounterUnsat, 4092 mSDtfsCounter, 1240 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2025 GetRequests, 1923 SyntacticMatches, 7 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4432occurred in iteration=20, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 1090 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 4335 NumberOfCodeBlocks, 4335 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 4461 ConstructedInterpolants, 0 QuantifiedInterpolants, 7583 SizeOfPredicates, 2 NumberOfNonLiveVariables, 3982 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 33 InterpolantComputations, 21 PerfectInterpolantSequences, 4856/4991 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 05:52:50,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE