./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:56:26,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:56:26,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 05:56:26,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:56:26,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:56:26,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:56:26,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:56:26,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:56:26,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:56:26,594 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:56:26,594 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:56:26,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:56:26,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:56:26,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:56:26,595 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:56:26,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:56:26,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:56:26,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:56:26,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:56:26,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:56:26,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:56:26,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:56:26,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:56:26,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:56:26,601 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:56:26,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:56:26,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:56:26,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:56:26,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:56:26,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:56:26,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:56:26,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:56:26,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:56:26,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:56:26,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:56:26,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:56:26,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:56:26,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:56:26,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:56:26,604 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b [2024-10-14 05:56:26,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:56:26,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:56:26,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:56:26,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:56:26,899 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:56:26,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2024-10-14 05:56:28,175 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:56:28,347 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:56:28,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2024-10-14 05:56:28,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca3a3724/faf26f7ce6fd472189d56406cf4d4bd9/FLAG94c268970 [2024-10-14 05:56:28,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca3a3724/faf26f7ce6fd472189d56406cf4d4bd9 [2024-10-14 05:56:28,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:56:28,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:56:28,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:56:28,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:56:28,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:56:28,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:56:28" (1/1) ... [2024-10-14 05:56:28,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2597eff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:28, skipping insertion in model container [2024-10-14 05:56:28,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:56:28" (1/1) ... [2024-10-14 05:56:28,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:56:28,898 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2024-10-14 05:56:28,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:56:28,965 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:56:28,975 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2024-10-14 05:56:29,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:56:29,033 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:56:29,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29 WrapperNode [2024-10-14 05:56:29,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:56:29,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:56:29,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:56:29,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:56:29,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,099 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 370 [2024-10-14 05:56:29,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:56:29,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:56:29,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:56:29,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:56:29,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,228 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-14 05:56:29,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:56:29,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:56:29,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:56:29,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:56:29,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (1/1) ... [2024-10-14 05:56:29,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:56:29,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:56:29,304 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) [2024-10-14 05:56:29,306 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 [2024-10-14 05:56:29,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:56:29,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:56:29,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 05:56:29,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:56:29,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:56:29,443 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:56:29,444 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:56:29,884 INFO L? ?]: Removed 168 outVars from TransFormulas that were not future-live. [2024-10-14 05:56:29,885 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:56:29,918 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:56:29,919 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 05:56:29,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:29 BoogieIcfgContainer [2024-10-14 05:56:29,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:56:29,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:56:29,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:56:29,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:56:29,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:56:28" (1/3) ... [2024-10-14 05:56:29,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13344d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:56:29, skipping insertion in model container [2024-10-14 05:56:29,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:29" (2/3) ... [2024-10-14 05:56:29,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13344d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:56:29, skipping insertion in model container [2024-10-14 05:56:29,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:29" (3/3) ... [2024-10-14 05:56:29,929 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal51.c [2024-10-14 05:56:29,942 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:56:29,943 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 05:56:30,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:56:30,006 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;@7ee9a252, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:56:30,007 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 05:56:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 05:56:30,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:30,018 INFO L215 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] [2024-10-14 05:56:30,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:30,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1285680966, now seen corresponding path program 1 times [2024-10-14 05:56:30,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:30,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372943794] [2024-10-14 05:56:30,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:30,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372943794] [2024-10-14 05:56:30,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372943794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:30,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:30,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:56:30,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158612481] [2024-10-14 05:56:30,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:30,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:56:30,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:30,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:56:30,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:56:30,708 INFO L87 Difference]: Start difference. First operand has 87 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:30,768 INFO L93 Difference]: Finished difference Result 156 states and 231 transitions. [2024-10-14 05:56:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:56:30,771 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-10-14 05:56:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:30,779 INFO L225 Difference]: With dead ends: 156 [2024-10-14 05:56:30,779 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 05:56:30,782 INFO L431 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 [2024-10-14 05:56:30,786 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 29 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:30,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 329 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:56:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 05:56:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-14 05:56:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 85 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2024-10-14 05:56:30,819 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 38 [2024-10-14 05:56:30,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:30,819 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2024-10-14 05:56:30,820 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:30,820 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2024-10-14 05:56:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-14 05:56:30,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:30,821 INFO L215 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] [2024-10-14 05:56:30,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:56:30,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:30,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:30,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1254276020, now seen corresponding path program 1 times [2024-10-14 05:56:30,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:30,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058942256] [2024-10-14 05:56:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:30,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:31,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:31,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058942256] [2024-10-14 05:56:31,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058942256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:31,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:31,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:56:31,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305372182] [2024-10-14 05:56:31,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:31,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:56:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:31,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:56:31,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:56:31,041 INFO L87 Difference]: Start difference. First operand 86 states and 125 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:31,075 INFO L93 Difference]: Finished difference Result 90 states and 129 transitions. [2024-10-14 05:56:31,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:56:31,076 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-14 05:56:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:31,077 INFO L225 Difference]: With dead ends: 90 [2024-10-14 05:56:31,078 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 05:56:31,078 INFO L431 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 [2024-10-14 05:56:31,079 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:31,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 361 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:56:31,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 05:56:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-14 05:56:31,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4597701149425288) internal successors, (127), 87 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2024-10-14 05:56:31,089 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 39 [2024-10-14 05:56:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:31,089 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2024-10-14 05:56:31,090 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,090 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2024-10-14 05:56:31,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 05:56:31,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:31,092 INFO L215 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] [2024-10-14 05:56:31,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:56:31,093 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:31,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash -226155582, now seen corresponding path program 1 times [2024-10-14 05:56:31,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:31,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607174871] [2024-10-14 05:56:31,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:31,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:31,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:31,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607174871] [2024-10-14 05:56:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607174871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:31,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:31,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:56:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863447091] [2024-10-14 05:56:31,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:31,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:56:31,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:31,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:56:31,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:56:31,239 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:31,267 INFO L93 Difference]: Finished difference Result 161 states and 232 transitions. [2024-10-14 05:56:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:56:31,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-10-14 05:56:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:31,268 INFO L225 Difference]: With dead ends: 161 [2024-10-14 05:56:31,268 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 05:56:31,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:56:31,270 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:31,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:56:31,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 05:56:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 05:56:31,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.449438202247191) internal successors, (129), 89 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-10-14 05:56:31,275 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 40 [2024-10-14 05:56:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:31,276 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-10-14 05:56:31,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-10-14 05:56:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-14 05:56:31,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:31,277 INFO L215 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] [2024-10-14 05:56:31,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:56:31,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:31,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash 481145829, now seen corresponding path program 1 times [2024-10-14 05:56:31,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:31,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295308399] [2024-10-14 05:56:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:31,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:31,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295308399] [2024-10-14 05:56:31,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295308399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:31,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:31,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:56:31,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130108362] [2024-10-14 05:56:31,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:31,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:56:31,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:31,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:56:31,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:56:31,516 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:31,650 INFO L93 Difference]: Finished difference Result 216 states and 309 transitions. [2024-10-14 05:56:31,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:56:31,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-10-14 05:56:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:31,652 INFO L225 Difference]: With dead ends: 216 [2024-10-14 05:56:31,652 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 05:56:31,652 INFO L431 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 [2024-10-14 05:56:31,653 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 57 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:31,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 355 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:31,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 05:56:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 05:56:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2024-10-14 05:56:31,662 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 41 [2024-10-14 05:56:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:31,663 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2024-10-14 05:56:31,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,664 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2024-10-14 05:56:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-14 05:56:31,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:31,665 INFO L215 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] [2024-10-14 05:56:31,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:56:31,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:31,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1108563902, now seen corresponding path program 1 times [2024-10-14 05:56:31,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:31,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808279161] [2024-10-14 05:56:31,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:31,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:31,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808279161] [2024-10-14 05:56:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808279161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:31,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:31,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:56:31,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49749953] [2024-10-14 05:56:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:31,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:56:31,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:31,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:56:31,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:56:31,846 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:31,916 INFO L93 Difference]: Finished difference Result 177 states and 250 transitions. [2024-10-14 05:56:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:56:31,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-14 05:56:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:31,918 INFO L225 Difference]: With dead ends: 177 [2024-10-14 05:56:31,918 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 05:56:31,919 INFO L431 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 [2024-10-14 05:56:31,919 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:31,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 308 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 05:56:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-14 05:56:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-14 05:56:31,938 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 42 [2024-10-14 05:56:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:31,939 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-14 05:56:31,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-14 05:56:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-14 05:56:31,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:31,940 INFO L215 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] [2024-10-14 05:56:31,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:56:31,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:31,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:31,941 INFO L85 PathProgramCache]: Analyzing trace with hash -74143529, now seen corresponding path program 1 times [2024-10-14 05:56:31,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:31,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196343189] [2024-10-14 05:56:31,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:31,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:32,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196343189] [2024-10-14 05:56:32,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196343189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:32,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:32,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:56:32,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869296803] [2024-10-14 05:56:32,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:32,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:56:32,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:32,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:56:32,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:56:32,153 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:32,272 INFO L93 Difference]: Finished difference Result 167 states and 234 transitions. [2024-10-14 05:56:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:56:32,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-14 05:56:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:32,274 INFO L225 Difference]: With dead ends: 167 [2024-10-14 05:56:32,274 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 05:56:32,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:56:32,275 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 122 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:32,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 208 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 05:56:32,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-10-14 05:56:32,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:32,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-10-14 05:56:32,281 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 43 [2024-10-14 05:56:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:32,282 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-10-14 05:56:32,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:32,282 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-10-14 05:56:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 05:56:32,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:32,288 INFO L215 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] [2024-10-14 05:56:32,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:56:32,288 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:32,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1751650330, now seen corresponding path program 1 times [2024-10-14 05:56:32,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:32,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31265988] [2024-10-14 05:56:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:32,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:32,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:32,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31265988] [2024-10-14 05:56:32,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31265988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:32,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:32,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:56:32,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908130575] [2024-10-14 05:56:32,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:32,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:56:32,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:32,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:56:32,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:56:32,585 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:32,702 INFO L93 Difference]: Finished difference Result 173 states and 240 transitions. [2024-10-14 05:56:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:56:32,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-14 05:56:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:32,703 INFO L225 Difference]: With dead ends: 173 [2024-10-14 05:56:32,703 INFO L226 Difference]: Without dead ends: 97 [2024-10-14 05:56:32,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:56:32,705 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 113 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:32,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 212 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-14 05:56:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2024-10-14 05:56:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2024-10-14 05:56:32,712 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 44 [2024-10-14 05:56:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:32,712 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2024-10-14 05:56:32,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2024-10-14 05:56:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 05:56:32,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:32,717 INFO L215 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] [2024-10-14 05:56:32,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:56:32,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:32,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:32,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2009691195, now seen corresponding path program 1 times [2024-10-14 05:56:32,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:32,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129473667] [2024-10-14 05:56:32,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:33,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:33,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129473667] [2024-10-14 05:56:33,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129473667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:33,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:33,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:56:33,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120685228] [2024-10-14 05:56:33,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:33,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:56:33,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:33,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:56:33,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:56:33,096 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:33,200 INFO L93 Difference]: Finished difference Result 179 states and 247 transitions. [2024-10-14 05:56:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:56:33,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-14 05:56:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:33,203 INFO L225 Difference]: With dead ends: 179 [2024-10-14 05:56:33,203 INFO L226 Difference]: Without dead ends: 100 [2024-10-14 05:56:33,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:56:33,207 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:33,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 500 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:33,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-14 05:56:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-10-14 05:56:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-10-14 05:56:33,215 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 44 [2024-10-14 05:56:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:33,215 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-10-14 05:56:33,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-10-14 05:56:33,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 05:56:33,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:33,216 INFO L215 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] [2024-10-14 05:56:33,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:56:33,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:33,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:33,217 INFO L85 PathProgramCache]: Analyzing trace with hash -288999782, now seen corresponding path program 1 times [2024-10-14 05:56:33,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:33,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771960460] [2024-10-14 05:56:33,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:33,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771960460] [2024-10-14 05:56:33,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771960460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:33,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:33,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:56:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790800541] [2024-10-14 05:56:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:33,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:56:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:56:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:56:33,527 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:33,640 INFO L93 Difference]: Finished difference Result 187 states and 257 transitions. [2024-10-14 05:56:33,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 05:56:33,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-14 05:56:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:33,643 INFO L225 Difference]: With dead ends: 187 [2024-10-14 05:56:33,643 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 05:56:33,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:56:33,644 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 127 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:33,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 594 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:33,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 05:56:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-14 05:56:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2024-10-14 05:56:33,651 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 45 [2024-10-14 05:56:33,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:33,652 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2024-10-14 05:56:33,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2024-10-14 05:56:33,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 05:56:33,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:33,653 INFO L215 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] [2024-10-14 05:56:33,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:56:33,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:33,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:33,654 INFO L85 PathProgramCache]: Analyzing trace with hash 684998491, now seen corresponding path program 1 times [2024-10-14 05:56:33,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:33,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816331910] [2024-10-14 05:56:33,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:33,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:33,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:33,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816331910] [2024-10-14 05:56:33,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816331910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:33,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:33,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:56:33,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623088339] [2024-10-14 05:56:33,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:33,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:56:33,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:33,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:56:33,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:56:33,864 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:33,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:33,976 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2024-10-14 05:56:33,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:56:33,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-14 05:56:33,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:33,977 INFO L225 Difference]: With dead ends: 193 [2024-10-14 05:56:33,977 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 05:56:33,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:56:33,977 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 101 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:33,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 212 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 05:56:33,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-10-14 05:56:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.3714285714285714) internal successors, (144), 105 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2024-10-14 05:56:33,981 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 46 [2024-10-14 05:56:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:33,999 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2024-10-14 05:56:33,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2024-10-14 05:56:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 05:56:34,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:34,000 INFO L215 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] [2024-10-14 05:56:34,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:56:34,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:34,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:34,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1472251206, now seen corresponding path program 1 times [2024-10-14 05:56:34,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:34,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009485398] [2024-10-14 05:56:34,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:34,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:34,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:34,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:34,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009485398] [2024-10-14 05:56:34,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009485398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:34,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:34,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:56:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309784730] [2024-10-14 05:56:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:34,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:56:34,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:34,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:56:34,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:56:34,086 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:34,129 INFO L93 Difference]: Finished difference Result 196 states and 265 transitions. [2024-10-14 05:56:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 05:56:34,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-14 05:56:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:34,131 INFO L225 Difference]: With dead ends: 196 [2024-10-14 05:56:34,131 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 05:56:34,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:56:34,132 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 106 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:34,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 324 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:56:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 05:56:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-14 05:56:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 106 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2024-10-14 05:56:34,135 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 46 [2024-10-14 05:56:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:34,135 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2024-10-14 05:56:34,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2024-10-14 05:56:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 05:56:34,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:34,136 INFO L215 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] [2024-10-14 05:56:34,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 05:56:34,136 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:34,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:34,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1418305066, now seen corresponding path program 1 times [2024-10-14 05:56:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:34,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098060925] [2024-10-14 05:56:34,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:34,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:34,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:34,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:34,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098060925] [2024-10-14 05:56:34,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098060925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:34,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:34,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:56:34,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904909293] [2024-10-14 05:56:34,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:34,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:56:34,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:34,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:56:34,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:56:34,354 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:34,394 INFO L93 Difference]: Finished difference Result 227 states and 304 transitions. [2024-10-14 05:56:34,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:56:34,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-14 05:56:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:34,395 INFO L225 Difference]: With dead ends: 227 [2024-10-14 05:56:34,395 INFO L226 Difference]: Without dead ends: 137 [2024-10-14 05:56:34,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:56:34,396 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 151 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:34,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 458 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:56:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-14 05:56:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-10-14 05:56:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.3383458646616542) internal successors, (178), 133 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2024-10-14 05:56:34,402 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 46 [2024-10-14 05:56:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:34,403 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2024-10-14 05:56:34,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2024-10-14 05:56:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 05:56:34,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:34,403 INFO L215 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] [2024-10-14 05:56:34,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:56:34,403 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:34,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1476152806, now seen corresponding path program 1 times [2024-10-14 05:56:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:34,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835164890] [2024-10-14 05:56:34,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:34,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:34,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:34,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835164890] [2024-10-14 05:56:34,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835164890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:34,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:34,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:56:34,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444798000] [2024-10-14 05:56:34,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:34,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:56:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:34,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:56:34,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:56:34,539 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:34,618 INFO L93 Difference]: Finished difference Result 248 states and 328 transitions. [2024-10-14 05:56:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:56:34,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-14 05:56:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:34,620 INFO L225 Difference]: With dead ends: 248 [2024-10-14 05:56:34,620 INFO L226 Difference]: Without dead ends: 131 [2024-10-14 05:56:34,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:56:34,621 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 104 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:34,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 146 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:34,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-14 05:56:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-14 05:56:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.3384615384615384) internal successors, (174), 130 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2024-10-14 05:56:34,624 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 46 [2024-10-14 05:56:34,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:34,624 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2024-10-14 05:56:34,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2024-10-14 05:56:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 05:56:34,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:34,625 INFO L215 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] [2024-10-14 05:56:34,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:56:34,625 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:34,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash -153595182, now seen corresponding path program 1 times [2024-10-14 05:56:34,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:34,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551462607] [2024-10-14 05:56:34,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:34,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:34,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:34,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551462607] [2024-10-14 05:56:34,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551462607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:34,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:34,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:56:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098167322] [2024-10-14 05:56:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:34,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:56:34,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:34,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:56:34,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:56:34,867 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:34,935 INFO L93 Difference]: Finished difference Result 347 states and 454 transitions. [2024-10-14 05:56:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:56:34,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-14 05:56:34,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:34,937 INFO L225 Difference]: With dead ends: 347 [2024-10-14 05:56:34,937 INFO L226 Difference]: Without dead ends: 233 [2024-10-14 05:56:34,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:56:34,938 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 288 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:34,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 448 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:56:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-14 05:56:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 214. [2024-10-14 05:56:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.3145539906103287) internal successors, (280), 213 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 280 transitions. [2024-10-14 05:56:34,943 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 280 transitions. Word has length 47 [2024-10-14 05:56:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:34,944 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 280 transitions. [2024-10-14 05:56:34,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 280 transitions. [2024-10-14 05:56:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 05:56:34,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:34,944 INFO L215 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] [2024-10-14 05:56:34,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:56:34,945 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:34,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:34,945 INFO L85 PathProgramCache]: Analyzing trace with hash 442403676, now seen corresponding path program 1 times [2024-10-14 05:56:34,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:34,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389743507] [2024-10-14 05:56:34,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:34,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:35,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:35,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389743507] [2024-10-14 05:56:35,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389743507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:35,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:35,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:56:35,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377137283] [2024-10-14 05:56:35,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:35,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:56:35,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:35,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:56:35,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:56:35,126 INFO L87 Difference]: Start difference. First operand 214 states and 280 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:35,237 INFO L93 Difference]: Finished difference Result 349 states and 456 transitions. [2024-10-14 05:56:35,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 05:56:35,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-14 05:56:35,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:35,239 INFO L225 Difference]: With dead ends: 349 [2024-10-14 05:56:35,239 INFO L226 Difference]: Without dead ends: 235 [2024-10-14 05:56:35,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-10-14 05:56:35,240 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 291 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:35,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 660 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:35,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-14 05:56:35,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 217. [2024-10-14 05:56:35,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.3148148148148149) internal successors, (284), 216 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:35,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2024-10-14 05:56:35,244 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 284 transitions. Word has length 48 [2024-10-14 05:56:35,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:35,244 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 284 transitions. [2024-10-14 05:56:35,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 284 transitions. [2024-10-14 05:56:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 05:56:35,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:35,245 INFO L215 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] [2024-10-14 05:56:35,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:56:35,245 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:35,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1148958575, now seen corresponding path program 1 times [2024-10-14 05:56:35,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393807047] [2024-10-14 05:56:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:35,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:35,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:35,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393807047] [2024-10-14 05:56:35,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393807047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:35,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:35,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:56:35,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642306049] [2024-10-14 05:56:35,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:35,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:56:35,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:35,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:56:35,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:56:35,528 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:35,601 INFO L93 Difference]: Finished difference Result 344 states and 451 transitions. [2024-10-14 05:56:35,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:56:35,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-14 05:56:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:35,603 INFO L225 Difference]: With dead ends: 344 [2024-10-14 05:56:35,603 INFO L226 Difference]: Without dead ends: 225 [2024-10-14 05:56:35,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:56:35,603 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 105 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:35,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 487 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-14 05:56:35,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 217. [2024-10-14 05:56:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.3148148148148149) internal successors, (284), 216 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:35,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 284 transitions. [2024-10-14 05:56:35,610 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 284 transitions. Word has length 49 [2024-10-14 05:56:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:35,611 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 284 transitions. [2024-10-14 05:56:35,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:35,611 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 284 transitions. [2024-10-14 05:56:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 05:56:35,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:35,612 INFO L215 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] [2024-10-14 05:56:35,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:56:35,613 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:35,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash 447774336, now seen corresponding path program 1 times [2024-10-14 05:56:35,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:35,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090744190] [2024-10-14 05:56:35,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:35,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:35,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:35,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090744190] [2024-10-14 05:56:35,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090744190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:35,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:35,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:56:35,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366027435] [2024-10-14 05:56:35,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:35,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:56:35,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:35,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:56:35,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:56:35,997 INFO L87 Difference]: Start difference. First operand 217 states and 284 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:36,160 INFO L93 Difference]: Finished difference Result 349 states and 455 transitions. [2024-10-14 05:56:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:56:36,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-14 05:56:36,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:36,162 INFO L225 Difference]: With dead ends: 349 [2024-10-14 05:56:36,162 INFO L226 Difference]: Without dead ends: 235 [2024-10-14 05:56:36,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:56:36,163 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 284 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:36,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 747 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:36,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-14 05:56:36,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 221. [2024-10-14 05:56:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.3136363636363637) internal successors, (289), 220 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:36,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 289 transitions. [2024-10-14 05:56:36,167 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 289 transitions. Word has length 50 [2024-10-14 05:56:36,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:36,167 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 289 transitions. [2024-10-14 05:56:36,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 289 transitions. [2024-10-14 05:56:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 05:56:36,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:36,167 INFO L215 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] [2024-10-14 05:56:36,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:56:36,168 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:36,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:36,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1734319446, now seen corresponding path program 1 times [2024-10-14 05:56:36,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:36,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731279517] [2024-10-14 05:56:36,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:36,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:36,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:36,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731279517] [2024-10-14 05:56:36,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731279517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:36,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:36,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:56:36,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188314987] [2024-10-14 05:56:36,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:36,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:56:36,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:36,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:56:36,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:56:36,510 INFO L87 Difference]: Start difference. First operand 221 states and 289 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:37,021 INFO L93 Difference]: Finished difference Result 498 states and 648 transitions. [2024-10-14 05:56:37,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:56:37,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-14 05:56:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:37,023 INFO L225 Difference]: With dead ends: 498 [2024-10-14 05:56:37,023 INFO L226 Difference]: Without dead ends: 365 [2024-10-14 05:56:37,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:56:37,023 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 194 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:37,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 449 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 05:56:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-14 05:56:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 317. [2024-10-14 05:56:37,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.3037974683544304) internal successors, (412), 316 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 412 transitions. [2024-10-14 05:56:37,030 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 412 transitions. Word has length 51 [2024-10-14 05:56:37,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:37,030 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 412 transitions. [2024-10-14 05:56:37,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 412 transitions. [2024-10-14 05:56:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 05:56:37,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:37,031 INFO L215 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] [2024-10-14 05:56:37,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:56:37,032 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:37,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:37,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1464730182, now seen corresponding path program 1 times [2024-10-14 05:56:37,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:37,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580322209] [2024-10-14 05:56:37,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:37,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:37,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580322209] [2024-10-14 05:56:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580322209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:37,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:37,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:56:37,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290192863] [2024-10-14 05:56:37,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:37,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:56:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:37,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:56:37,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:56:37,494 INFO L87 Difference]: Start difference. First operand 317 states and 412 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:37,747 INFO L93 Difference]: Finished difference Result 319 states and 413 transitions. [2024-10-14 05:56:37,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 05:56:37,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-14 05:56:37,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:37,748 INFO L225 Difference]: With dead ends: 319 [2024-10-14 05:56:37,748 INFO L226 Difference]: Without dead ends: 221 [2024-10-14 05:56:37,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:56:37,749 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 118 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:37,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 318 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:56:37,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-14 05:56:37,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-10-14 05:56:37,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.2954545454545454) internal successors, (285), 220 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 285 transitions. [2024-10-14 05:56:37,753 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 285 transitions. Word has length 51 [2024-10-14 05:56:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:37,753 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 285 transitions. [2024-10-14 05:56:37,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 285 transitions. [2024-10-14 05:56:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 05:56:37,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:37,754 INFO L215 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] [2024-10-14 05:56:37,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 05:56:37,754 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:37,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:37,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1902566382, now seen corresponding path program 1 times [2024-10-14 05:56:37,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114183947] [2024-10-14 05:56:37,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:37,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:37,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:37,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114183947] [2024-10-14 05:56:37,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114183947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:37,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:37,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:56:37,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520729357] [2024-10-14 05:56:37,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:37,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:56:37,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:37,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:56:37,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:56:37,923 INFO L87 Difference]: Start difference. First operand 221 states and 285 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:38,044 INFO L93 Difference]: Finished difference Result 348 states and 449 transitions. [2024-10-14 05:56:38,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:56:38,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-14 05:56:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:38,046 INFO L225 Difference]: With dead ends: 348 [2024-10-14 05:56:38,046 INFO L226 Difference]: Without dead ends: 225 [2024-10-14 05:56:38,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:56:38,047 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 120 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:38,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 487 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:56:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-10-14 05:56:38,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2024-10-14 05:56:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.2927927927927927) internal successors, (287), 222 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 287 transitions. [2024-10-14 05:56:38,052 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 287 transitions. Word has length 52 [2024-10-14 05:56:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:38,052 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 287 transitions. [2024-10-14 05:56:38,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 287 transitions. [2024-10-14 05:56:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 05:56:38,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:38,053 INFO L215 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] [2024-10-14 05:56:38,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 05:56:38,053 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:38,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:38,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1296483246, now seen corresponding path program 1 times [2024-10-14 05:56:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:38,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819053289] [2024-10-14 05:56:38,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:38,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:56:38,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819053289] [2024-10-14 05:56:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819053289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:38,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:38,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:56:38,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270301216] [2024-10-14 05:56:38,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:38,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:56:38,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:56:38,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:56:38,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:56:38,418 INFO L87 Difference]: Start difference. First operand 223 states and 287 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:38,657 INFO L93 Difference]: Finished difference Result 351 states and 450 transitions. [2024-10-14 05:56:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:56:38,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-14 05:56:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:38,659 INFO L225 Difference]: With dead ends: 351 [2024-10-14 05:56:38,659 INFO L226 Difference]: Without dead ends: 223 [2024-10-14 05:56:38,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:56:38,660 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 83 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:38,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 310 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 05:56:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-14 05:56:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 163. [2024-10-14 05:56:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.3024691358024691) internal successors, (211), 162 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 211 transitions. [2024-10-14 05:56:38,665 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 211 transitions. Word has length 52 [2024-10-14 05:56:38,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:38,665 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 211 transitions. [2024-10-14 05:56:38,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 211 transitions. [2024-10-14 05:56:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 05:56:38,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:38,666 INFO L215 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] [2024-10-14 05:56:38,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 05:56:38,666 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:38,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1955507242, now seen corresponding path program 1 times [2024-10-14 05:56:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:56:38,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031802167] [2024-10-14 05:56:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:56:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 05:56:38,699 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 05:56:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 05:56:38,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 05:56:38,762 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 05:56:38,763 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 05:56:38,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 05:56:38,769 INFO L407 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] [2024-10-14 05:56:38,818 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 05:56:38,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:56:38 BoogieIcfgContainer [2024-10-14 05:56:38,820 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 05:56:38,821 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 05:56:38,821 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 05:56:38,821 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 05:56:38,821 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:29" (3/4) ... [2024-10-14 05:56:38,823 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 05:56:38,824 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 05:56:38,825 INFO L158 Benchmark]: Toolchain (without parser) took 10074.93ms. Allocated memory was 186.6MB in the beginning and 432.0MB in the end (delta: 245.4MB). Free memory was 120.3MB in the beginning and 166.2MB in the end (delta: -45.9MB). Peak memory consumption was 202.2MB. Max. memory is 16.1GB. [2024-10-14 05:56:38,825 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 104.9MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 05:56:38,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.94ms. Allocated memory is still 186.6MB. Free memory was 120.3MB in the beginning and 103.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 05:56:38,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.76ms. Allocated memory is still 186.6MB. Free memory was 103.7MB in the beginning and 95.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 05:56:38,829 INFO L158 Benchmark]: Boogie Preprocessor took 172.04ms. Allocated memory is still 186.6MB. Free memory was 95.1MB in the beginning and 150.2MB in the end (delta: -55.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 05:56:38,829 INFO L158 Benchmark]: RCFGBuilder took 645.69ms. Allocated memory is still 186.6MB. Free memory was 150.2MB in the beginning and 99.9MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-14 05:56:38,830 INFO L158 Benchmark]: TraceAbstraction took 8896.00ms. Allocated memory was 186.6MB in the beginning and 432.0MB in the end (delta: 245.4MB). Free memory was 99.4MB in the beginning and 167.2MB in the end (delta: -67.8MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. [2024-10-14 05:56:38,830 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 432.0MB. Free memory was 167.2MB in the beginning and 166.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 05:56:38,833 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.09ms. Allocated memory is still 104.9MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.94ms. Allocated memory is still 186.6MB. Free memory was 120.3MB in the beginning and 103.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.76ms. Allocated memory is still 186.6MB. Free memory was 103.7MB in the beginning and 95.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 172.04ms. Allocated memory is still 186.6MB. Free memory was 95.1MB in the beginning and 150.2MB in the end (delta: -55.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 645.69ms. Allocated memory is still 186.6MB. Free memory was 150.2MB in the beginning and 99.9MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8896.00ms. Allocated memory was 186.6MB in the beginning and 432.0MB in the end (delta: 245.4MB). Free memory was 99.4MB in the beginning and 167.2MB in the end (delta: -67.8MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 432.0MB. Free memory was 167.2MB in the beginning and 166.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 123, overapproximation of bitwiseAnd at line 128. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_27 mask_SORT_27 = (SORT_27)-1 >> (sizeof(SORT_27) * 8 - 2); [L33] const SORT_27 msb_SORT_27 = (SORT_27)1 << (2 - 1); [L35] const SORT_1 var_11 = 0; [L36] const SORT_5 var_15 = 0; [L37] const SORT_5 var_21 = 2; [L38] const SORT_5 var_24 = 1; [L39] const SORT_1 var_41 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L43] SORT_1 input_4; [L44] SORT_5 input_6; [L45] SORT_5 input_7; [L46] SORT_1 input_8; [L47] SORT_5 input_9; [L48] SORT_5 input_10; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L50] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L51] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L52] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L53] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] SORT_1 init_13_arg_1 = var_11; [L56] state_12 = init_13_arg_1 [L57] SORT_5 init_17_arg_1 = var_15; [L58] state_16 = init_17_arg_1 [L59] SORT_1 init_19_arg_1 = var_11; [L60] state_18 = init_19_arg_1 [L61] SORT_5 init_31_arg_1 = var_15; [L62] state_30 = init_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L65] input_2 = __VERIFIER_nondet_uchar() [L66] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L66] input_2 = input_2 & mask_SORT_1 [L67] input_3 = __VERIFIER_nondet_uchar() [L68] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_30=0, var_11=0, var_15=0, var_21=2, var_24=1, var_41=1] [L68] input_3 = input_3 & mask_SORT_1 [L69] input_4 = __VERIFIER_nondet_uchar() [L70] input_6 = __VERIFIER_nondet_uchar() [L71] input_7 = __VERIFIER_nondet_uchar() [L72] input_8 = __VERIFIER_nondet_uchar() [L73] input_9 = __VERIFIER_nondet_uchar() [L74] input_10 = __VERIFIER_nondet_uchar() [L77] SORT_1 var_14_arg_0 = state_12; [L78] SORT_1 var_14 = ~var_14_arg_0; [L79] SORT_1 var_20_arg_0 = state_18; [L80] SORT_5 var_20_arg_1 = state_16; [L81] SORT_5 var_20_arg_2 = input_7; [L82] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_41=1] [L83] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_21=2, var_24=1, var_41=1] [L83] var_20 = var_20 & mask_SORT_5 [L84] SORT_5 var_25_arg_0 = var_20; [L85] SORT_5 var_25_arg_1 = var_24; [L86] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L87] SORT_1 var_26_arg_0 = var_25; [L88] SORT_1 var_26 = ~var_26_arg_0; [L89] SORT_5 var_22_arg_0 = var_20; [L90] SORT_5 var_22_arg_1 = var_21; [L91] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L92] SORT_1 var_23_arg_0 = var_22; [L93] SORT_1 var_23 = ~var_23_arg_0; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_23=-1, var_24=1, var_26=-1, var_41=1] [L94] EXPR var_23 & mask_SORT_1 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L94] var_23 = var_23 & mask_SORT_1 [L95] SORT_1 var_28_arg_0 = var_26; [L96] SORT_1 var_28_arg_1 = var_23; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_28_arg_0=-1, var_28_arg_1=0, var_41=1] [L97] EXPR ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L97] SORT_27 var_28 = ((SORT_27)var_28_arg_0 << 1) | var_28_arg_1; [L98] EXPR var_28 & mask_SORT_27 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, state_18=0, state_30=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_41=1] [L98] var_28 = var_28 & mask_SORT_27 [L99] SORT_27 var_29_arg_0 = var_28; [L100] SORT_1 var_29 = var_29_arg_0 == mask_SORT_27; [L101] SORT_1 var_32_arg_0 = state_18; [L102] SORT_5 var_32_arg_1 = state_30; [L103] SORT_5 var_32_arg_2 = input_7; [L104] SORT_5 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=0, var_32=0, var_41=1] [L105] EXPR var_32 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=0, var_41=1] [L105] var_32 = var_32 & mask_SORT_5 [L106] SORT_5 var_33_arg_0 = var_32; [L107] SORT_5 var_33_arg_1 = var_21; [L108] SORT_1 var_33 = var_33_arg_0 == var_33_arg_1; [L109] SORT_1 var_34_arg_0 = var_33; [L110] SORT_1 var_34 = ~var_34_arg_0; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=0, var_32=0, var_34=-1, var_41=1] [L111] EXPR var_34 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_26=-1, var_29=0, var_32=0, var_41=1] [L111] var_34 = var_34 & mask_SORT_1 [L112] SORT_1 var_35_arg_0 = var_26; [L113] SORT_1 var_35_arg_1 = var_34; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=0, var_32=0, var_35_arg_0=-1, var_35_arg_1=0, var_41=1] [L114] EXPR ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=0, var_32=0, var_41=1] [L114] SORT_27 var_35 = ((SORT_27)var_35_arg_0 << 1) | var_35_arg_1; [L115] EXPR var_35 & mask_SORT_27 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=2, var_24=1, var_29=0, var_32=0, var_41=1] [L115] var_35 = var_35 & mask_SORT_27 [L116] SORT_27 var_36_arg_0 = var_35; [L117] SORT_1 var_36 = var_36_arg_0 == mask_SORT_27; [L118] SORT_1 var_37_arg_0 = var_29; [L119] SORT_1 var_37_arg_1 = var_36; [L120] SORT_1 var_37 = var_37_arg_0 == var_37_arg_1; [L121] SORT_1 var_38_arg_0 = var_14; [L122] SORT_1 var_38_arg_1 = var_37; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_38_arg_0=-1, var_38_arg_1=1, var_41=1] [L123] EXPR var_38_arg_0 | var_38_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L123] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L124] SORT_1 var_42_arg_0 = var_38; [L125] SORT_1 var_42 = ~var_42_arg_0; [L126] SORT_1 var_43_arg_0 = var_41; [L127] SORT_1 var_43_arg_1 = var_42; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1, var_43_arg_0=1, var_43_arg_1=-1] [L128] EXPR var_43_arg_0 & var_43_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L128] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L129] EXPR var_43 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_27=3, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=2, var_24=1, var_32=0, var_41=1] [L129] var_43 = var_43 & mask_SORT_1 [L130] SORT_1 bad_44_arg_0 = var_43; [L131] CALL __VERIFIER_assert(!(bad_44_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2517 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2517 mSDsluCounter, 8271 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6221 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2711 IncrementalHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 2050 mSDtfsCounter, 2711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=18, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 180 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 939 ConstructedInterpolants, 0 QuantifiedInterpolants, 5455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 05:56:38,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:56:40,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:56:40,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 05:56:40,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:56:40,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:56:40,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:56:40,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:56:40,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:56:40,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:56:40,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:56:40,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:56:40,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:56:40,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:56:40,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:56:40,892 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:56:40,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:56:40,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:56:40,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:56:40,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:56:40,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:56:40,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:56:40,896 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 05:56:40,896 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 05:56:40,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:56:40,897 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 05:56:40,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:56:40,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:56:40,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:56:40,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:56:40,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:56:40,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:56:40,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:56:40,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:56:40,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:56:40,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:56:40,899 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 05:56:40,900 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 05:56:40,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:56:40,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:56:40,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:56:40,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:56:40,902 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 05:56:40,902 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 722f66c27e0daab44069acf5d7094f3a7f8b832453955e57154e2bc2fe9dd95b [2024-10-14 05:56:41,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:56:41,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:56:41,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:56:41,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:56:41,186 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:56:41,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2024-10-14 05:56:42,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:56:42,706 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:56:42,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c [2024-10-14 05:56:42,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd21e58c/3e098e29c33341c1b75423a121a14577/FLAGede7de3a8 [2024-10-14 05:56:43,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd21e58c/3e098e29c33341c1b75423a121a14577 [2024-10-14 05:56:43,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:56:43,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:56:43,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:56:43,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:56:43,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:56:43,112 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e7d55ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43, skipping insertion in model container [2024-10-14 05:56:43,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:56:43,290 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2024-10-14 05:56:43,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:56:43,375 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:56:43,387 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal51.c[1245,1258] [2024-10-14 05:56:43,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:56:43,428 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:56:43,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43 WrapperNode [2024-10-14 05:56:43,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:56:43,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:56:43,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:56:43,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:56:43,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,490 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 210 [2024-10-14 05:56:43,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:56:43,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:56:43,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:56:43,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:56:43,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,526 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-14 05:56:43,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,529 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,538 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,542 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,543 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:56:43,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:56:43,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:56:43,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:56:43,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (1/1) ... [2024-10-14 05:56:43,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:56:43,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:56:43,585 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) [2024-10-14 05:56:43,588 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 [2024-10-14 05:56:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:56:43,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 05:56:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 05:56:43,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:56:43,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:56:43,724 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:56:43,726 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:56:44,014 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-14 05:56:44,014 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:56:44,050 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:56:44,050 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 05:56:44,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:44 BoogieIcfgContainer [2024-10-14 05:56:44,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:56:44,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:56:44,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:56:44,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:56:44,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:56:43" (1/3) ... [2024-10-14 05:56:44,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4025ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:56:44, skipping insertion in model container [2024-10-14 05:56:44,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:56:43" (2/3) ... [2024-10-14 05:56:44,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4025ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:56:44, skipping insertion in model container [2024-10-14 05:56:44,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:44" (3/3) ... [2024-10-14 05:56:44,063 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal51.c [2024-10-14 05:56:44,078 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:56:44,079 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 05:56:44,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:56:44,137 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;@760e784e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:56:44,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 05:56:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 05:56:44,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:44,148 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 05:56:44,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:44,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:44,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 05:56:44,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:56:44,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422846652] [2024-10-14 05:56:44,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:44,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:56:44,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:56:44,166 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 05:56:44,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 05:56:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:44,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 05:56:44,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:56:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:44,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:56:44,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 05:56:44,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422846652] [2024-10-14 05:56:44,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422846652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:56:44,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:56:44,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:56:44,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570043983] [2024-10-14 05:56:44,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:56:44,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:56:44,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 05:56:44,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:56:44,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:56:44,473 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:44,529 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 05:56:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:56:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 05:56:44,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:44,540 INFO L225 Difference]: With dead ends: 15 [2024-10-14 05:56:44,542 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 05:56:44,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:56:44,548 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 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 [2024-10-14 05:56:44,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:56:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 05:56:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 05:56:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 05:56:44,571 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 05:56:44,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:44,571 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 05:56:44,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 05:56:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 05:56:44,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:44,572 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 05:56:44,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 05:56:44,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:56:44,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:44,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:44,777 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 05:56:44,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:56:44,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829490478] [2024-10-14 05:56:44,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:56:44,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:56:44,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:56:44,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 05:56:44,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 05:56:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:56:44,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-14 05:56:44,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:56:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:45,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:56:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:50,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 05:56:50,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829490478] [2024-10-14 05:56:50,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829490478] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:56:50,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 05:56:50,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 05:56:50,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313406779] [2024-10-14 05:56:50,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 05:56:50,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:56:50,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 05:56:50,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:56:50,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:56:50,934 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:51,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:56:51,019 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-14 05:56:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:56:51,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 05:56:51,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:56:51,020 INFO L225 Difference]: With dead ends: 13 [2024-10-14 05:56:51,020 INFO L226 Difference]: Without dead ends: 11 [2024-10-14 05:56:51,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:56:51,021 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:56:51,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:56:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-14 05:56:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-14 05:56:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 05:56:51,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 05:56:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:56:51,025 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 05:56:51,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:56:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 05:56:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 05:56:51,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:56:51,025 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 05:56:51,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 05:56:51,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:56:51,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:56:51,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:56:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 05:56:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:56:51,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834029106] [2024-10-14 05:56:51,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 05:56:51,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:56:51,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:56:51,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 05:56:51,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 05:56:51,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 05:56:51,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 05:56:51,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-14 05:56:51,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:56:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:56:52,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:57:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:57:19,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 05:57:19,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834029106] [2024-10-14 05:57:19,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834029106] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:57:19,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 05:57:19,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-14 05:57:19,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358723831] [2024-10-14 05:57:19,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 05:57:19,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 05:57:19,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 05:57:19,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 05:57:19,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:57:19,967 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:57:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:57:20,248 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-10-14 05:57:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:57:20,248 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 05:57:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:57:20,249 INFO L225 Difference]: With dead ends: 16 [2024-10-14 05:57:20,249 INFO L226 Difference]: Without dead ends: 14 [2024-10-14 05:57:20,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:57:20,250 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:57:20,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:57:20,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-14 05:57:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-14 05:57:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:57:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-14 05:57:20,253 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2024-10-14 05:57:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:57:20,254 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-14 05:57:20,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:57:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-14 05:57:20,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 05:57:20,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:57:20,254 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-14 05:57:20,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 05:57:20,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:57:20,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:57:20,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:57:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 3 times [2024-10-14 05:57:20,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:57:20,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099499310] [2024-10-14 05:57:20,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 05:57:20,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:57:20,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:57:20,459 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 05:57:20,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 05:57:20,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 05:57:20,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 05:57:20,620 WARN L253 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-10-14 05:57:20,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:57:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 05:57:22,272 INFO L311 TraceCheckSpWp]: Computing backward predicates...