./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.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 c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:25:41,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:25:41,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 18:25:41,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:25:41,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:25:41,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:25:41,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:25:41,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:25:41,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:25:41,348 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:25:41,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:25:41,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:25:41,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:25:41,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:25:41,350 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:25:41,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:25:41,352 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:25:41,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:25:41,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:25:41,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:25:41,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:25:41,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:25:41,357 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:25:41,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:25:41,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:25:41,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:25:41,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:25:41,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:25:41,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:25:41,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:25:41,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:25:41,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:25:41,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:25:41,365 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:25:41,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:25:41,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:25:41,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:25:41,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:25:41,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:25:41,366 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 -> c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 [2024-11-08 18:25:41,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:25:41,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:25:41,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:25:41,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:25:41,689 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:25:41,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-11-08 18:25:43,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:25:43,588 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:25:43,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-11-08 18:25:43,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f51ba3aa/f4511776a01a47a9b2b0f400f6cc49ba/FLAG39c94391d [2024-11-08 18:25:43,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f51ba3aa/f4511776a01a47a9b2b0f400f6cc49ba [2024-11-08 18:25:43,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:25:43,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:25:43,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:25:43,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:25:43,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:25:43,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:25:43" (1/1) ... [2024-11-08 18:25:43,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f21b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:43, skipping insertion in model container [2024-11-08 18:25:43,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:25:43" (1/1) ... [2024-11-08 18:25:43,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:25:43,855 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-11-08 18:25:43,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:25:44,009 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:25:44,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-11-08 18:25:44,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:25:44,111 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:25:44,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44 WrapperNode [2024-11-08 18:25:44,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:25:44,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:25:44,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:25:44,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:25:44,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,140 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,221 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 590 [2024-11-08 18:25:44,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:25:44,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:25:44,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:25:44,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:25:44,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,304 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:25:44,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,341 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:25:44,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:25:44,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:25:44,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:25:44,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (1/1) ... [2024-11-08 18:25:44,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:25:44,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:25:44,433 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-11-08 18:25:44,438 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-11-08 18:25:44,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:25:44,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:25:44,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:25:44,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:25:44,644 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:25:44,646 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:25:45,514 INFO L? ?]: Removed 347 outVars from TransFormulas that were not future-live. [2024-11-08 18:25:45,514 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:25:45,532 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:25:45,532 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:25:45,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:25:45 BoogieIcfgContainer [2024-11-08 18:25:45,532 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:25:45,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:25:45,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:25:45,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:25:45,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:25:43" (1/3) ... [2024-11-08 18:25:45,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c8c0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:25:45, skipping insertion in model container [2024-11-08 18:25:45,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:25:44" (2/3) ... [2024-11-08 18:25:45,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c8c0b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:25:45, skipping insertion in model container [2024-11-08 18:25:45,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:25:45" (3/3) ... [2024-11-08 18:25:45,543 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Spinner.c [2024-11-08 18:25:45,560 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:25:45,561 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:25:45,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:25:45,689 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;@29f3dccf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:25:45,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:25:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 160 states have (on average 1.49375) internal successors, (239), 161 states have internal predecessors, (239), 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-11-08 18:25:45,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 18:25:45,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:45,701 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] [2024-11-08 18:25:45,701 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:45,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:45,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1130863270, now seen corresponding path program 1 times [2024-11-08 18:25:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274848424] [2024-11-08 18:25:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:47,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:47,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274848424] [2024-11-08 18:25:47,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274848424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:47,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:47,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 18:25:47,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719760386] [2024-11-08 18:25:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:47,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 18:25:47,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:47,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 18:25:47,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:25:47,184 INFO L87 Difference]: Start difference. First operand has 162 states, 160 states have (on average 1.49375) internal successors, (239), 161 states have internal predecessors, (239), 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 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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-11-08 18:25:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:47,413 INFO L93 Difference]: Finished difference Result 352 states and 523 transitions. [2024-11-08 18:25:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:25:47,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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 35 [2024-11-08 18:25:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:47,432 INFO L225 Difference]: With dead ends: 352 [2024-11-08 18:25:47,432 INFO L226 Difference]: Without dead ends: 204 [2024-11-08 18:25:47,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:25:47,442 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 47 mSDsluCounter, 1755 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1972 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:47,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1972 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:25:47,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-08 18:25:47,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 185. [2024-11-08 18:25:47,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.4891304347826086) internal successors, (274), 184 states have internal predecessors, (274), 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-11-08 18:25:47,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 274 transitions. [2024-11-08 18:25:47,489 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 274 transitions. Word has length 35 [2024-11-08 18:25:47,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:47,490 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 274 transitions. [2024-11-08 18:25:47,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 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-11-08 18:25:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 274 transitions. [2024-11-08 18:25:47,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 18:25:47,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:47,492 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] [2024-11-08 18:25:47,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:25:47,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:47,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1698909476, now seen corresponding path program 1 times [2024-11-08 18:25:47,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:47,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776718778] [2024-11-08 18:25:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:47,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:47,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:47,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776718778] [2024-11-08 18:25:47,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776718778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:47,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:47,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:25:47,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596943671] [2024-11-08 18:25:47,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:47,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:25:47,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:25:47,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:25:47,812 INFO L87 Difference]: Start difference. First operand 185 states and 274 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-08 18:25:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:47,844 INFO L93 Difference]: Finished difference Result 189 states and 278 transitions. [2024-11-08 18:25:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:25:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-08 18:25:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:47,846 INFO L225 Difference]: With dead ends: 189 [2024-11-08 18:25:47,849 INFO L226 Difference]: Without dead ends: 187 [2024-11-08 18:25:47,849 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-11-08 18:25:47,850 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 693 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-11-08 18:25:47,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 693 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:25:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-08 18:25:47,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-08 18:25:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.4838709677419355) internal successors, (276), 186 states have internal predecessors, (276), 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-11-08 18:25:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 276 transitions. [2024-11-08 18:25:47,872 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 276 transitions. Word has length 36 [2024-11-08 18:25:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:47,875 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 276 transitions. [2024-11-08 18:25:47,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-08 18:25:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 276 transitions. [2024-11-08 18:25:47,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 18:25:47,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:47,877 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] [2024-11-08 18:25:47,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:25:47,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:47,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:47,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1124890856, now seen corresponding path program 1 times [2024-11-08 18:25:47,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:47,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877814929] [2024-11-08 18:25:47,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:47,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:48,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:48,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:48,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877814929] [2024-11-08 18:25:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877814929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:48,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:48,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:25:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323534682] [2024-11-08 18:25:48,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:48,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:25:48,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:48,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:25:48,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:25:48,091 INFO L87 Difference]: Start difference. First operand 187 states and 276 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-11-08 18:25:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:48,124 INFO L93 Difference]: Finished difference Result 362 states and 535 transitions. [2024-11-08 18:25:48,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:25:48,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2024-11-08 18:25:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:48,127 INFO L225 Difference]: With dead ends: 362 [2024-11-08 18:25:48,127 INFO L226 Difference]: Without dead ends: 189 [2024-11-08 18:25:48,128 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-11-08 18:25:48,129 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:48,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 689 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:25:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-08 18:25:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-08 18:25:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.4787234042553192) internal successors, (278), 188 states have internal predecessors, (278), 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-11-08 18:25:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 278 transitions. [2024-11-08 18:25:48,140 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 278 transitions. Word has length 37 [2024-11-08 18:25:48,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:48,141 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 278 transitions. [2024-11-08 18:25:48,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-11-08 18:25:48,141 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 278 transitions. [2024-11-08 18:25:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 18:25:48,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:48,144 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-11-08 18:25:48,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:25:48,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:48,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1609843915, now seen corresponding path program 1 times [2024-11-08 18:25:48,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:48,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556614272] [2024-11-08 18:25:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:48,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:48,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:48,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556614272] [2024-11-08 18:25:48,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556614272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:48,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:48,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 18:25:48,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731993844] [2024-11-08 18:25:48,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:48,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 18:25:48,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:48,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 18:25:48,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:25:48,918 INFO L87 Difference]: Start difference. First operand 189 states and 278 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 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-11-08 18:25:49,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:49,181 INFO L93 Difference]: Finished difference Result 386 states and 568 transitions. [2024-11-08 18:25:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:25:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 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-11-08 18:25:49,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:49,183 INFO L225 Difference]: With dead ends: 386 [2024-11-08 18:25:49,183 INFO L226 Difference]: Without dead ends: 211 [2024-11-08 18:25:49,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:25:49,185 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 30 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:49,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2342 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:25:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-08 18:25:49,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-08 18:25:49,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.4734299516908214) internal successors, (305), 207 states have internal predecessors, (305), 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-11-08 18:25:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 305 transitions. [2024-11-08 18:25:49,198 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 305 transitions. Word has length 38 [2024-11-08 18:25:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:49,198 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 305 transitions. [2024-11-08 18:25:49,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 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-11-08 18:25:49,198 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 305 transitions. [2024-11-08 18:25:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 18:25:49,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:49,200 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-11-08 18:25:49,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:25:49,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:49,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:49,201 INFO L85 PathProgramCache]: Analyzing trace with hash -63278127, now seen corresponding path program 1 times [2024-11-08 18:25:49,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:49,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309044556] [2024-11-08 18:25:49,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:49,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:49,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:49,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309044556] [2024-11-08 18:25:49,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309044556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:49,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:49,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 18:25:49,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555063025] [2024-11-08 18:25:49,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:49,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 18:25:49,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:49,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 18:25:49,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:25:49,633 INFO L87 Difference]: Start difference. First operand 208 states and 305 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-11-08 18:25:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:49,650 INFO L93 Difference]: Finished difference Result 357 states and 524 transitions. [2024-11-08 18:25:49,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 18:25:49,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-11-08 18:25:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:49,651 INFO L225 Difference]: With dead ends: 357 [2024-11-08 18:25:49,651 INFO L226 Difference]: Without dead ends: 163 [2024-11-08 18:25:49,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 18:25:49,653 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 2 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:49,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 457 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:25:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-08 18:25:49,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-11-08 18:25:49,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4691358024691359) internal successors, (238), 162 states have internal predecessors, (238), 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-11-08 18:25:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2024-11-08 18:25:49,667 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 38 [2024-11-08 18:25:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:49,668 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2024-11-08 18:25:49,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-11-08 18:25:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2024-11-08 18:25:49,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 18:25:49,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:49,669 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-11-08 18:25:49,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 18:25:49,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:49,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:49,670 INFO L85 PathProgramCache]: Analyzing trace with hash -739979155, now seen corresponding path program 1 times [2024-11-08 18:25:49,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:49,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777045154] [2024-11-08 18:25:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:49,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:49,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777045154] [2024-11-08 18:25:49,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777045154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:49,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:49,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:25:49,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858304049] [2024-11-08 18:25:49,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:49,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:25:49,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:49,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:25:49,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:25:49,934 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-11-08 18:25:49,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:49,984 INFO L93 Difference]: Finished difference Result 316 states and 462 transitions. [2024-11-08 18:25:49,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:25:49,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-11-08 18:25:49,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:49,986 INFO L225 Difference]: With dead ends: 316 [2024-11-08 18:25:49,987 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 18:25:49,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-11-08 18:25:49,990 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 210 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:49,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 683 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:25:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 18:25:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2024-11-08 18:25:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.4606060606060607) internal successors, (241), 165 states have internal predecessors, (241), 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-11-08 18:25:49,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 241 transitions. [2024-11-08 18:25:49,998 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 241 transitions. Word has length 38 [2024-11-08 18:25:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:49,999 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 241 transitions. [2024-11-08 18:25:49,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-11-08 18:25:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 241 transitions. [2024-11-08 18:25:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 18:25:50,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:50,004 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-11-08 18:25:50,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:25:50,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:50,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:50,005 INFO L85 PathProgramCache]: Analyzing trace with hash 100027971, now seen corresponding path program 1 times [2024-11-08 18:25:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:50,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928698571] [2024-11-08 18:25:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:50,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:50,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:50,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928698571] [2024-11-08 18:25:50,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928698571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:50,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:50,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 18:25:50,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011216428] [2024-11-08 18:25:50,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:50,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 18:25:50,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:50,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 18:25:50,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:25:50,632 INFO L87 Difference]: Start difference. First operand 166 states and 241 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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-11-08 18:25:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:50,805 INFO L93 Difference]: Finished difference Result 355 states and 517 transitions. [2024-11-08 18:25:50,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:25:50,805 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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-11-08 18:25:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:50,807 INFO L225 Difference]: With dead ends: 355 [2024-11-08 18:25:50,807 INFO L226 Difference]: Without dead ends: 203 [2024-11-08 18:25:50,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:25:50,809 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 41 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:50,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2120 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:25:50,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-08 18:25:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 184. [2024-11-08 18:25:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.453551912568306) internal successors, (266), 183 states have internal predecessors, (266), 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-11-08 18:25:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 266 transitions. [2024-11-08 18:25:50,818 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 266 transitions. Word has length 39 [2024-11-08 18:25:50,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:50,819 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 266 transitions. [2024-11-08 18:25:50,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 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-11-08 18:25:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 266 transitions. [2024-11-08 18:25:50,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 18:25:50,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:50,824 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-11-08 18:25:50,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 18:25:50,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:50,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash -555630329, now seen corresponding path program 1 times [2024-11-08 18:25:50,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:50,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713003087] [2024-11-08 18:25:50,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713003087] [2024-11-08 18:25:51,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713003087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:51,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:51,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:25:51,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327542102] [2024-11-08 18:25:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:51,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:25:51,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:51,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:25:51,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:25:51,268 INFO L87 Difference]: Start difference. First operand 184 states and 266 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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-11-08 18:25:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:51,342 INFO L93 Difference]: Finished difference Result 370 states and 536 transitions. [2024-11-08 18:25:51,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:25:51,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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-11-08 18:25:51,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:51,344 INFO L225 Difference]: With dead ends: 370 [2024-11-08 18:25:51,344 INFO L226 Difference]: Without dead ends: 200 [2024-11-08 18:25:51,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:25:51,346 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 12 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:51,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1109 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:25:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-08 18:25:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 194. [2024-11-08 18:25:51,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4455958549222798) internal successors, (279), 193 states have internal predecessors, (279), 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-11-08 18:25:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 279 transitions. [2024-11-08 18:25:51,355 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 279 transitions. Word has length 39 [2024-11-08 18:25:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:51,355 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 279 transitions. [2024-11-08 18:25:51,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 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-11-08 18:25:51,356 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2024-11-08 18:25:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 18:25:51,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:51,358 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-11-08 18:25:51,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:25:51,358 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:51,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:51,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1069522374, now seen corresponding path program 1 times [2024-11-08 18:25:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:51,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361296013] [2024-11-08 18:25:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:51,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:52,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:52,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361296013] [2024-11-08 18:25:52,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361296013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:52,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:52,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 18:25:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350012365] [2024-11-08 18:25:52,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:52,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 18:25:52,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:52,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 18:25:52,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:25:52,177 INFO L87 Difference]: Start difference. First operand 194 states and 279 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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-11-08 18:25:52,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:52,488 INFO L93 Difference]: Finished difference Result 395 states and 568 transitions. [2024-11-08 18:25:52,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 18:25:52,489 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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-11-08 18:25:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:52,490 INFO L225 Difference]: With dead ends: 395 [2024-11-08 18:25:52,490 INFO L226 Difference]: Without dead ends: 215 [2024-11-08 18:25:52,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:25:52,491 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 54 mSDsluCounter, 2311 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:52,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2522 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:25:52,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-08 18:25:52,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2024-11-08 18:25:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 1.4438775510204083) internal successors, (283), 196 states have internal predecessors, (283), 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-11-08 18:25:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 283 transitions. [2024-11-08 18:25:52,497 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 283 transitions. Word has length 40 [2024-11-08 18:25:52,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:52,497 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 283 transitions. [2024-11-08 18:25:52,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 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-11-08 18:25:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 283 transitions. [2024-11-08 18:25:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 18:25:52,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:52,499 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-11-08 18:25:52,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:25:52,499 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:52,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:52,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2076193843, now seen corresponding path program 1 times [2024-11-08 18:25:52,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:52,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571560688] [2024-11-08 18:25:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571560688] [2024-11-08 18:25:53,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571560688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:53,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:53,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 18:25:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355447365] [2024-11-08 18:25:53,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:53,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 18:25:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:53,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 18:25:53,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:25:53,590 INFO L87 Difference]: Start difference. First operand 197 states and 283 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 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-11-08 18:25:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:53,991 INFO L93 Difference]: Finished difference Result 400 states and 575 transitions. [2024-11-08 18:25:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:25:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 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-11-08 18:25:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:53,995 INFO L225 Difference]: With dead ends: 400 [2024-11-08 18:25:53,995 INFO L226 Difference]: Without dead ends: 217 [2024-11-08 18:25:53,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:25:53,996 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 27 mSDsluCounter, 3079 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:53,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3304 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:25:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-08 18:25:54,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2024-11-08 18:25:54,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4476190476190476) internal successors, (304), 210 states have internal predecessors, (304), 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-11-08 18:25:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 304 transitions. [2024-11-08 18:25:54,015 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 304 transitions. Word has length 40 [2024-11-08 18:25:54,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:54,015 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 304 transitions. [2024-11-08 18:25:54,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 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-11-08 18:25:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 304 transitions. [2024-11-08 18:25:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 18:25:54,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:54,016 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-11-08 18:25:54,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 18:25:54,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:54,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:54,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1563115153, now seen corresponding path program 1 times [2024-11-08 18:25:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:54,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068268481] [2024-11-08 18:25:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:54,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:54,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068268481] [2024-11-08 18:25:54,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068268481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:54,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:54,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:25:54,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4158518] [2024-11-08 18:25:54,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:54,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:25:54,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:54,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:25:54,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:25:54,586 INFO L87 Difference]: Start difference. First operand 211 states and 304 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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-11-08 18:25:54,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:54,676 INFO L93 Difference]: Finished difference Result 416 states and 601 transitions. [2024-11-08 18:25:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:25:54,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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-11-08 18:25:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:54,677 INFO L225 Difference]: With dead ends: 416 [2024-11-08 18:25:54,678 INFO L226 Difference]: Without dead ends: 219 [2024-11-08 18:25:54,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:25:54,679 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 11 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:54,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1499 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:25:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-08 18:25:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 207. [2024-11-08 18:25:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.441747572815534) internal successors, (297), 206 states have internal predecessors, (297), 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-11-08 18:25:54,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 297 transitions. [2024-11-08 18:25:54,687 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 297 transitions. Word has length 40 [2024-11-08 18:25:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:54,687 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 297 transitions. [2024-11-08 18:25:54,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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-11-08 18:25:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 297 transitions. [2024-11-08 18:25:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 18:25:54,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:54,689 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-11-08 18:25:54,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:25:54,689 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:54,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash -885198293, now seen corresponding path program 1 times [2024-11-08 18:25:54,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:54,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50599501] [2024-11-08 18:25:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:55,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:55,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50599501] [2024-11-08 18:25:55,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50599501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:55,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:55,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:25:55,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081575499] [2024-11-08 18:25:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:55,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:25:55,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:55,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:25:55,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:25:55,307 INFO L87 Difference]: Start difference. First operand 207 states and 297 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-11-08 18:25:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:55,383 INFO L93 Difference]: Finished difference Result 483 states and 688 transitions. [2024-11-08 18:25:55,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:25:55,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-11-08 18:25:55,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:55,386 INFO L225 Difference]: With dead ends: 483 [2024-11-08 18:25:55,386 INFO L226 Difference]: Without dead ends: 290 [2024-11-08 18:25:55,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:25:55,387 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 352 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:55,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 667 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:25:55,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-08 18:25:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 234. [2024-11-08 18:25:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.4291845493562232) internal successors, (333), 233 states have internal predecessors, (333), 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-11-08 18:25:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 333 transitions. [2024-11-08 18:25:55,396 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 333 transitions. Word has length 41 [2024-11-08 18:25:55,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:55,397 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 333 transitions. [2024-11-08 18:25:55,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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-11-08 18:25:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 333 transitions. [2024-11-08 18:25:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 18:25:55,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:55,398 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-11-08 18:25:55,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 18:25:55,399 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:55,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1968844420, now seen corresponding path program 1 times [2024-11-08 18:25:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:55,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786837869] [2024-11-08 18:25:55,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:55,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:56,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:56,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786837869] [2024-11-08 18:25:56,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786837869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:56,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:56,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 18:25:56,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091100783] [2024-11-08 18:25:56,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:56,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:25:56,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:56,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:25:56,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:25:56,193 INFO L87 Difference]: Start difference. First operand 234 states and 333 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 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-11-08 18:25:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:56,568 INFO L93 Difference]: Finished difference Result 543 states and 770 transitions. [2024-11-08 18:25:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 18:25:56,569 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 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-11-08 18:25:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:56,572 INFO L225 Difference]: With dead ends: 543 [2024-11-08 18:25:56,572 INFO L226 Difference]: Without dead ends: 350 [2024-11-08 18:25:56,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2024-11-08 18:25:56,573 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 376 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:56,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 2275 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:25:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-08 18:25:56,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 287. [2024-11-08 18:25:56,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 1.4265734265734267) internal successors, (408), 286 states have internal predecessors, (408), 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-11-08 18:25:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 408 transitions. [2024-11-08 18:25:56,584 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 408 transitions. Word has length 41 [2024-11-08 18:25:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:56,585 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 408 transitions. [2024-11-08 18:25:56,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 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-11-08 18:25:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 408 transitions. [2024-11-08 18:25:56,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 18:25:56,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:56,586 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-11-08 18:25:56,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 18:25:56,586 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:56,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:56,587 INFO L85 PathProgramCache]: Analyzing trace with hash 659910420, now seen corresponding path program 1 times [2024-11-08 18:25:56,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:56,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674689180] [2024-11-08 18:25:56,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:56,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:57,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:57,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674689180] [2024-11-08 18:25:57,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674689180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:57,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:57,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:25:57,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493568440] [2024-11-08 18:25:57,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:57,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:25:57,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:57,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:25:57,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:25:57,015 INFO L87 Difference]: Start difference. First operand 287 states and 408 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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-11-08 18:25:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:57,125 INFO L93 Difference]: Finished difference Result 577 states and 824 transitions. [2024-11-08 18:25:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:25:57,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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-11-08 18:25:57,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:57,127 INFO L225 Difference]: With dead ends: 577 [2024-11-08 18:25:57,127 INFO L226 Difference]: Without dead ends: 371 [2024-11-08 18:25:57,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-08 18:25:57,129 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 419 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:57,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1091 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:25:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-08 18:25:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 306. [2024-11-08 18:25:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.419672131147541) internal successors, (433), 305 states have internal predecessors, (433), 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-11-08 18:25:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 433 transitions. [2024-11-08 18:25:57,138 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 433 transitions. Word has length 42 [2024-11-08 18:25:57,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:57,139 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 433 transitions. [2024-11-08 18:25:57,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 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-11-08 18:25:57,139 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 433 transitions. [2024-11-08 18:25:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 18:25:57,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:57,140 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-11-08 18:25:57,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 18:25:57,140 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:57,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash -14992208, now seen corresponding path program 1 times [2024-11-08 18:25:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853062746] [2024-11-08 18:25:57,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:58,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:58,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853062746] [2024-11-08 18:25:58,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853062746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:58,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:58,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 18:25:58,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684912664] [2024-11-08 18:25:58,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:58,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 18:25:58,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:58,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 18:25:58,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:25:58,079 INFO L87 Difference]: Start difference. First operand 306 states and 433 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 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-11-08 18:25:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:58,370 INFO L93 Difference]: Finished difference Result 564 states and 794 transitions. [2024-11-08 18:25:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:25:58,370 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 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-11-08 18:25:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:58,373 INFO L225 Difference]: With dead ends: 564 [2024-11-08 18:25:58,373 INFO L226 Difference]: Without dead ends: 371 [2024-11-08 18:25:58,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:25:58,375 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 45 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:58,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2090 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:25:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-08 18:25:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 315. [2024-11-08 18:25:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.410828025477707) internal successors, (443), 314 states have internal predecessors, (443), 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-11-08 18:25:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 443 transitions. [2024-11-08 18:25:58,384 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 443 transitions. Word has length 42 [2024-11-08 18:25:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:58,384 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 443 transitions. [2024-11-08 18:25:58,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 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-11-08 18:25:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 443 transitions. [2024-11-08 18:25:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 18:25:58,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:58,385 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-11-08 18:25:58,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:25:58,386 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:58,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2045751268, now seen corresponding path program 1 times [2024-11-08 18:25:58,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:58,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066195312] [2024-11-08 18:25:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:58,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:59,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:59,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066195312] [2024-11-08 18:25:59,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066195312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:59,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:59,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 18:25:59,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850306867] [2024-11-08 18:25:59,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:59,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 18:25:59,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:59,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 18:25:59,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:25:59,188 INFO L87 Difference]: Start difference. First operand 315 states and 443 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 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-11-08 18:25:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:59,413 INFO L93 Difference]: Finished difference Result 568 states and 798 transitions. [2024-11-08 18:25:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:25:59,413 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 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-11-08 18:25:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:59,415 INFO L225 Difference]: With dead ends: 568 [2024-11-08 18:25:59,415 INFO L226 Difference]: Without dead ends: 333 [2024-11-08 18:25:59,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:25:59,417 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 409 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:59,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1507 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:25:59,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-08 18:25:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 295. [2024-11-08 18:25:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 294 states have (on average 1.4149659863945578) internal successors, (416), 294 states have internal predecessors, (416), 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-11-08 18:25:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 416 transitions. [2024-11-08 18:25:59,425 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 416 transitions. Word has length 43 [2024-11-08 18:25:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:59,425 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 416 transitions. [2024-11-08 18:25:59,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 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-11-08 18:25:59,426 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 416 transitions. [2024-11-08 18:25:59,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 18:25:59,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:59,426 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-11-08 18:25:59,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:25:59,427 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:59,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:59,427 INFO L85 PathProgramCache]: Analyzing trace with hash 266829603, now seen corresponding path program 1 times [2024-11-08 18:25:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:59,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200975667] [2024-11-08 18:25:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:25:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:25:59,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:25:59,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:25:59,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200975667] [2024-11-08 18:25:59,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200975667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:25:59,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:25:59,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:25:59,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592199860] [2024-11-08 18:25:59,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:25:59,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:25:59,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:25:59,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:25:59,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:25:59,937 INFO L87 Difference]: Start difference. First operand 295 states and 416 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-11-08 18:25:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:25:59,985 INFO L93 Difference]: Finished difference Result 535 states and 753 transitions. [2024-11-08 18:25:59,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:25:59,985 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-11-08 18:25:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:25:59,987 INFO L225 Difference]: With dead ends: 535 [2024-11-08 18:25:59,987 INFO L226 Difference]: Without dead ends: 307 [2024-11-08 18:25:59,987 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-11-08 18:25:59,988 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 223 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:25:59,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 669 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:25:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-08 18:25:59,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 301. [2024-11-08 18:25:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.4066666666666667) internal successors, (422), 300 states have internal predecessors, (422), 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-11-08 18:25:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 422 transitions. [2024-11-08 18:25:59,995 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 422 transitions. Word has length 43 [2024-11-08 18:25:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:25:59,996 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 422 transitions. [2024-11-08 18:25:59,996 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-11-08 18:25:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 422 transitions. [2024-11-08 18:25:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 18:25:59,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:25:59,997 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-11-08 18:25:59,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 18:25:59,997 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:25:59,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:25:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1870091917, now seen corresponding path program 1 times [2024-11-08 18:25:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:25:59,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339994169] [2024-11-08 18:25:59,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:25:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:01,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:01,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339994169] [2024-11-08 18:26:01,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339994169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:01,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:01,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-08 18:26:01,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925380349] [2024-11-08 18:26:01,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:01,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 18:26:01,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:01,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 18:26:01,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:26:01,441 INFO L87 Difference]: Start difference. First operand 301 states and 422 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-11-08 18:26:02,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:02,168 INFO L93 Difference]: Finished difference Result 577 states and 810 transitions. [2024-11-08 18:26:02,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:26:02,169 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-11-08 18:26:02,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:02,171 INFO L225 Difference]: With dead ends: 577 [2024-11-08 18:26:02,171 INFO L226 Difference]: Without dead ends: 380 [2024-11-08 18:26:02,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-11-08 18:26:02,173 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 398 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 3179 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:02,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 3179 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 18:26:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-08 18:26:02,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 313. [2024-11-08 18:26:02,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4006410256410255) internal successors, (437), 312 states have internal predecessors, (437), 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-11-08 18:26:02,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 437 transitions. [2024-11-08 18:26:02,181 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 437 transitions. Word has length 44 [2024-11-08 18:26:02,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:02,182 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 437 transitions. [2024-11-08 18:26:02,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-11-08 18:26:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 437 transitions. [2024-11-08 18:26:02,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 18:26:02,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:02,183 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-11-08 18:26:02,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:26:02,183 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:02,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:02,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1336705811, now seen corresponding path program 1 times [2024-11-08 18:26:02,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:02,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763702384] [2024-11-08 18:26:02,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:02,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:02,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:02,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763702384] [2024-11-08 18:26:02,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763702384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:02,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:02,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:26:02,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70605372] [2024-11-08 18:26:02,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:02,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:26:02,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:02,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:26:02,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:26:02,820 INFO L87 Difference]: Start difference. First operand 313 states and 437 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-11-08 18:26:02,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:02,897 INFO L93 Difference]: Finished difference Result 514 states and 725 transitions. [2024-11-08 18:26:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:26:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-11-08 18:26:02,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:02,899 INFO L225 Difference]: With dead ends: 514 [2024-11-08 18:26:02,899 INFO L226 Difference]: Without dead ends: 313 [2024-11-08 18:26:02,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:26:02,900 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 9 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:02,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1285 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-08 18:26:02,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2024-11-08 18:26:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.3928571428571428) internal successors, (429), 308 states have internal predecessors, (429), 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-11-08 18:26:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 429 transitions. [2024-11-08 18:26:02,906 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 429 transitions. Word has length 44 [2024-11-08 18:26:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:02,907 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 429 transitions. [2024-11-08 18:26:02,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-11-08 18:26:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 429 transitions. [2024-11-08 18:26:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 18:26:02,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:02,908 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-11-08 18:26:02,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 18:26:02,908 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:02,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:02,911 INFO L85 PathProgramCache]: Analyzing trace with hash 776800112, now seen corresponding path program 1 times [2024-11-08 18:26:02,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:02,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542918007] [2024-11-08 18:26:02,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:02,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:03,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:03,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542918007] [2024-11-08 18:26:03,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542918007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:03,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:03,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:26:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776595021] [2024-11-08 18:26:03,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:03,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:26:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:03,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:26:03,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:03,114 INFO L87 Difference]: Start difference. First operand 309 states and 429 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) 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-11-08 18:26:03,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:03,213 INFO L93 Difference]: Finished difference Result 591 states and 818 transitions. [2024-11-08 18:26:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:03,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) 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-11-08 18:26:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:03,216 INFO L225 Difference]: With dead ends: 591 [2024-11-08 18:26:03,216 INFO L226 Difference]: Without dead ends: 312 [2024-11-08 18:26:03,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:26:03,217 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 72 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:03,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1054 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:26:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-08 18:26:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 283. [2024-11-08 18:26:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.3900709219858156) internal successors, (392), 282 states have internal predecessors, (392), 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-11-08 18:26:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 392 transitions. [2024-11-08 18:26:03,225 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 392 transitions. Word has length 44 [2024-11-08 18:26:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:03,225 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 392 transitions. [2024-11-08 18:26:03,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) 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-11-08 18:26:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 392 transitions. [2024-11-08 18:26:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 18:26:03,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:03,229 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-11-08 18:26:03,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 18:26:03,229 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:03,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash 557281759, now seen corresponding path program 1 times [2024-11-08 18:26:03,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:03,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368909167] [2024-11-08 18:26:03,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:05,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:05,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:05,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368909167] [2024-11-08 18:26:05,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368909167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:05,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:05,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2024-11-08 18:26:05,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456521813] [2024-11-08 18:26:05,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:05,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-08 18:26:05,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:05,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-08 18:26:05,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:26:05,347 INFO L87 Difference]: Start difference. First operand 283 states and 392 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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-11-08 18:26:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:06,208 INFO L93 Difference]: Finished difference Result 563 states and 781 transitions. [2024-11-08 18:26:06,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 18:26:06,209 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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-11-08 18:26:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:06,211 INFO L225 Difference]: With dead ends: 563 [2024-11-08 18:26:06,211 INFO L226 Difference]: Without dead ends: 367 [2024-11-08 18:26:06,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2024-11-08 18:26:06,212 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 240 mSDsluCounter, 3497 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:06,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 3694 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:26:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-08 18:26:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2024-11-08 18:26:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.3796033994334278) internal successors, (487), 353 states have internal predecessors, (487), 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-11-08 18:26:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 487 transitions. [2024-11-08 18:26:06,221 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 487 transitions. Word has length 45 [2024-11-08 18:26:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:06,222 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 487 transitions. [2024-11-08 18:26:06,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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-11-08 18:26:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 487 transitions. [2024-11-08 18:26:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 18:26:06,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:06,223 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-11-08 18:26:06,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 18:26:06,223 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:06,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash 136106392, now seen corresponding path program 1 times [2024-11-08 18:26:06,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:06,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391332010] [2024-11-08 18:26:06,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:06,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:06,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:06,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391332010] [2024-11-08 18:26:06,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391332010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:06,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:06,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:26:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964520419] [2024-11-08 18:26:06,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:06,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:26:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:26:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:06,595 INFO L87 Difference]: Start difference. First operand 354 states and 487 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-11-08 18:26:06,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:06,636 INFO L93 Difference]: Finished difference Result 583 states and 813 transitions. [2024-11-08 18:26:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:26:06,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-11-08 18:26:06,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:06,639 INFO L225 Difference]: With dead ends: 583 [2024-11-08 18:26:06,639 INFO L226 Difference]: Without dead ends: 357 [2024-11-08 18:26:06,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:06,640 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 1 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:06,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 896 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-08 18:26:06,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 341. [2024-11-08 18:26:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 1.3852941176470588) internal successors, (471), 340 states have internal predecessors, (471), 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-11-08 18:26:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 471 transitions. [2024-11-08 18:26:06,649 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 471 transitions. Word has length 45 [2024-11-08 18:26:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:06,650 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 471 transitions. [2024-11-08 18:26:06,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 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-11-08 18:26:06,650 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 471 transitions. [2024-11-08 18:26:06,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 18:26:06,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:06,651 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-11-08 18:26:06,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 18:26:06,651 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:06,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash -365601492, now seen corresponding path program 1 times [2024-11-08 18:26:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:06,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026720923] [2024-11-08 18:26:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:06,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026720923] [2024-11-08 18:26:07,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026720923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:07,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:07,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33372652] [2024-11-08 18:26:07,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:07,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:07,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:07,057 INFO L87 Difference]: Start difference. First operand 341 states and 471 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-11-08 18:26:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:07,074 INFO L93 Difference]: Finished difference Result 581 states and 811 transitions. [2024-11-08 18:26:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:26:07,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-11-08 18:26:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:07,076 INFO L225 Difference]: With dead ends: 581 [2024-11-08 18:26:07,076 INFO L226 Difference]: Without dead ends: 317 [2024-11-08 18:26:07,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-08 18:26:07,077 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:07,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-08 18:26:07,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-11-08 18:26:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.370253164556962) internal successors, (433), 316 states have internal predecessors, (433), 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-11-08 18:26:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 433 transitions. [2024-11-08 18:26:07,085 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 433 transitions. Word has length 45 [2024-11-08 18:26:07,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:07,086 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 433 transitions. [2024-11-08 18:26:07,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-11-08 18:26:07,086 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 433 transitions. [2024-11-08 18:26:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 18:26:07,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:07,087 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-11-08 18:26:07,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 18:26:07,087 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:07,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:07,088 INFO L85 PathProgramCache]: Analyzing trace with hash 845346428, now seen corresponding path program 1 times [2024-11-08 18:26:07,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:07,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066903289] [2024-11-08 18:26:07,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:07,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:08,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:08,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:08,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066903289] [2024-11-08 18:26:08,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066903289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:08,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:08,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 18:26:08,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979537849] [2024-11-08 18:26:08,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:08,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 18:26:08,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:08,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 18:26:08,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:26:08,042 INFO L87 Difference]: Start difference. First operand 317 states and 433 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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-11-08 18:26:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:08,301 INFO L93 Difference]: Finished difference Result 659 states and 911 transitions. [2024-11-08 18:26:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 18:26:08,301 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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-11-08 18:26:08,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:08,303 INFO L225 Difference]: With dead ends: 659 [2024-11-08 18:26:08,303 INFO L226 Difference]: Without dead ends: 446 [2024-11-08 18:26:08,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:26:08,305 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 40 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:08,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2242 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:26:08,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-08 18:26:08,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 366. [2024-11-08 18:26:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 365 states have (on average 1.367123287671233) internal successors, (499), 365 states have internal predecessors, (499), 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-11-08 18:26:08,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 499 transitions. [2024-11-08 18:26:08,313 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 499 transitions. Word has length 45 [2024-11-08 18:26:08,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:08,314 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 499 transitions. [2024-11-08 18:26:08,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 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-11-08 18:26:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 499 transitions. [2024-11-08 18:26:08,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 18:26:08,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:08,315 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-11-08 18:26:08,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 18:26:08,315 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:08,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:08,316 INFO L85 PathProgramCache]: Analyzing trace with hash 189688128, now seen corresponding path program 1 times [2024-11-08 18:26:08,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:08,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316062616] [2024-11-08 18:26:08,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:08,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:09,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:09,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316062616] [2024-11-08 18:26:09,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316062616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:09,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:09,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:26:09,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014135960] [2024-11-08 18:26:09,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:09,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:26:09,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:09,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:26:09,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:26:09,116 INFO L87 Difference]: Start difference. First operand 366 states and 499 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-11-08 18:26:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:09,167 INFO L93 Difference]: Finished difference Result 656 states and 901 transitions. [2024-11-08 18:26:09,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:09,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-11-08 18:26:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:09,168 INFO L225 Difference]: With dead ends: 656 [2024-11-08 18:26:09,169 INFO L226 Difference]: Without dead ends: 361 [2024-11-08 18:26:09,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:26:09,172 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 341 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:09,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 661 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-08 18:26:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 332. [2024-11-08 18:26:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.3776435045317221) internal successors, (456), 331 states have internal predecessors, (456), 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-11-08 18:26:09,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 456 transitions. [2024-11-08 18:26:09,188 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 456 transitions. Word has length 45 [2024-11-08 18:26:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:09,188 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 456 transitions. [2024-11-08 18:26:09,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 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-11-08 18:26:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 456 transitions. [2024-11-08 18:26:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 18:26:09,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:09,189 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-11-08 18:26:09,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 18:26:09,189 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:09,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:09,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1713953040, now seen corresponding path program 1 times [2024-11-08 18:26:09,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:09,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593186904] [2024-11-08 18:26:09,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:10,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:10,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593186904] [2024-11-08 18:26:10,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593186904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:10,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:10,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 18:26:10,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520766451] [2024-11-08 18:26:10,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:10,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 18:26:10,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:10,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 18:26:10,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:26:10,226 INFO L87 Difference]: Start difference. First operand 332 states and 456 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 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-11-08 18:26:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:10,561 INFO L93 Difference]: Finished difference Result 621 states and 856 transitions. [2024-11-08 18:26:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 18:26:10,562 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 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-11-08 18:26:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:10,564 INFO L225 Difference]: With dead ends: 621 [2024-11-08 18:26:10,564 INFO L226 Difference]: Without dead ends: 345 [2024-11-08 18:26:10,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:26:10,565 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 287 mSDsluCounter, 2113 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:10,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 2326 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 18:26:10,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-08 18:26:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 316. [2024-11-08 18:26:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.384126984126984) internal successors, (436), 315 states have internal predecessors, (436), 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-11-08 18:26:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 436 transitions. [2024-11-08 18:26:10,574 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 436 transitions. Word has length 46 [2024-11-08 18:26:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:10,574 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 436 transitions. [2024-11-08 18:26:10,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 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-11-08 18:26:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 436 transitions. [2024-11-08 18:26:10,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 18:26:10,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:10,576 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-11-08 18:26:10,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 18:26:10,576 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:10,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:10,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2053794780, now seen corresponding path program 1 times [2024-11-08 18:26:10,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:10,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828003913] [2024-11-08 18:26:10,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:10,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:11,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:26:11,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828003913] [2024-11-08 18:26:11,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828003913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:11,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:11,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 18:26:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008401463] [2024-11-08 18:26:11,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:11,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 18:26:11,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:26:11,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 18:26:11,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-08 18:26:11,375 INFO L87 Difference]: Start difference. First operand 316 states and 436 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 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-11-08 18:26:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:11,795 INFO L93 Difference]: Finished difference Result 593 states and 826 transitions. [2024-11-08 18:26:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:26:11,796 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 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-11-08 18:26:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:11,798 INFO L225 Difference]: With dead ends: 593 [2024-11-08 18:26:11,798 INFO L226 Difference]: Without dead ends: 343 [2024-11-08 18:26:11,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:26:11,799 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 22 mSDsluCounter, 2822 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:11,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3026 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:26:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-08 18:26:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 333. [2024-11-08 18:26:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 1.3825301204819278) internal successors, (459), 332 states have internal predecessors, (459), 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-11-08 18:26:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 459 transitions. [2024-11-08 18:26:11,808 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 459 transitions. Word has length 46 [2024-11-08 18:26:11,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:11,808 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 459 transitions. [2024-11-08 18:26:11,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 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-11-08 18:26:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 459 transitions. [2024-11-08 18:26:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 18:26:11,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:11,809 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-11-08 18:26:11,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 18:26:11,809 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:11,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:11,810 INFO L85 PathProgramCache]: Analyzing trace with hash 442912650, now seen corresponding path program 1 times [2024-11-08 18:26:11,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:26:11,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423012309] [2024-11-08 18:26:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:11,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:26:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:26:11,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:26:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:26:11,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:26:11,981 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:26:11,982 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:26:11,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 18:26:11,989 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, 1, 1, 1, 1, 1, 1] [2024-11-08 18:26:12,059 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:26:12,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:26:12 BoogieIcfgContainer [2024-11-08 18:26:12,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:26:12,063 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:26:12,063 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:26:12,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:26:12,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:25:45" (3/4) ... [2024-11-08 18:26:12,069 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:26:12,071 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:26:12,071 INFO L158 Benchmark]: Toolchain (without parser) took 28447.52ms. Allocated memory was 130.0MB in the beginning and 687.9MB in the end (delta: 557.8MB). Free memory was 73.2MB in the beginning and 639.0MB in the end (delta: -565.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:26:12,071 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 130.0MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:26:12,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.81ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 72.9MB in the beginning and 146.3MB in the end (delta: -73.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 18:26:12,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.49ms. Allocated memory is still 180.4MB. Free memory was 146.3MB in the beginning and 134.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 18:26:12,072 INFO L158 Benchmark]: Boogie Preprocessor took 171.06ms. Allocated memory is still 180.4MB. Free memory was 134.8MB in the beginning and 127.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 18:26:12,072 INFO L158 Benchmark]: RCFGBuilder took 1137.04ms. Allocated memory is still 180.4MB. Free memory was 127.4MB in the beginning and 51.9MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-11-08 18:26:12,073 INFO L158 Benchmark]: TraceAbstraction took 26527.65ms. Allocated memory was 180.4MB in the beginning and 687.9MB in the end (delta: 507.5MB). Free memory was 50.9MB in the beginning and 639.0MB in the end (delta: -588.1MB). Peak memory consumption was 321.0MB. Max. memory is 16.1GB. [2024-11-08 18:26:12,073 INFO L158 Benchmark]: Witness Printer took 7.65ms. Allocated memory is still 687.9MB. Free memory is still 639.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:26:12,074 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.23ms. Allocated memory is still 130.0MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.81ms. Allocated memory was 130.0MB in the beginning and 180.4MB in the end (delta: 50.3MB). Free memory was 72.9MB in the beginning and 146.3MB in the end (delta: -73.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.49ms. Allocated memory is still 180.4MB. Free memory was 146.3MB in the beginning and 134.8MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 171.06ms. Allocated memory is still 180.4MB. Free memory was 134.8MB in the beginning and 127.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1137.04ms. Allocated memory is still 180.4MB. Free memory was 127.4MB in the beginning and 51.9MB in the end (delta: 75.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * TraceAbstraction took 26527.65ms. Allocated memory was 180.4MB in the beginning and 687.9MB in the end (delta: 507.5MB). Free memory was 50.9MB in the beginning and 639.0MB in the end (delta: -588.1MB). Peak memory consumption was 321.0MB. Max. memory is 16.1GB. * Witness Printer took 7.65ms. Allocated memory is still 687.9MB. Free memory is still 639.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 153, overapproximation of bitwiseAnd at line 161. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 5); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (5 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 32); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (32 - 1); [L35] const SORT_47 mask_SORT_47 = (SORT_47)-1 >> (sizeof(SORT_47) * 8 - 31); [L36] const SORT_47 msb_SORT_47 = (SORT_47)1 << (31 - 1); [L38] const SORT_57 mask_SORT_57 = (SORT_57)-1 >> (sizeof(SORT_57) * 8 - 30); [L39] const SORT_57 msb_SORT_57 = (SORT_57)1 << (30 - 1); [L41] const SORT_59 mask_SORT_59 = (SORT_59)-1 >> (sizeof(SORT_59) * 8 - 29); [L42] const SORT_59 msb_SORT_59 = (SORT_59)1 << (29 - 1); [L44] const SORT_65 mask_SORT_65 = (SORT_65)-1 >> (sizeof(SORT_65) * 8 - 2); [L45] const SORT_65 msb_SORT_65 = (SORT_65)1 << (2 - 1); [L47] const SORT_71 mask_SORT_71 = (SORT_71)-1 >> (sizeof(SORT_71) * 8 - 28); [L48] const SORT_71 msb_SORT_71 = (SORT_71)1 << (28 - 1); [L50] const SORT_73 mask_SORT_73 = (SORT_73)-1 >> (sizeof(SORT_73) * 8 - 26); [L51] const SORT_73 msb_SORT_73 = (SORT_73)1 << (26 - 1); [L53] const SORT_79 mask_SORT_79 = (SORT_79)-1 >> (sizeof(SORT_79) * 8 - 4); [L54] const SORT_79 msb_SORT_79 = (SORT_79)1 << (4 - 1); [L56] const SORT_85 mask_SORT_85 = (SORT_85)-1 >> (sizeof(SORT_85) * 8 - 24); [L57] const SORT_85 msb_SORT_85 = (SORT_85)1 << (24 - 1); [L59] const SORT_87 mask_SORT_87 = (SORT_87)-1 >> (sizeof(SORT_87) * 8 - 20); [L60] const SORT_87 msb_SORT_87 = (SORT_87)1 << (20 - 1); [L62] const SORT_93 mask_SORT_93 = (SORT_93)-1 >> (sizeof(SORT_93) * 8 - 8); [L63] const SORT_93 msb_SORT_93 = (SORT_93)1 << (8 - 1); [L65] const SORT_99 mask_SORT_99 = (SORT_99)-1 >> (sizeof(SORT_99) * 8 - 16); [L66] const SORT_99 msb_SORT_99 = (SORT_99)1 << (16 - 1); [L68] const SORT_5 var_8 = 0; [L69] const SORT_3 var_19 = 0; [L70] const SORT_3 var_40 = 1; [L72] SORT_1 input_2; [L73] SORT_3 input_4; [L74] SORT_5 input_6; [L75] SORT_3 input_7; [L77] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L77] SORT_5 state_9 = __VERIFIER_nondet_uint() & mask_SORT_5; [L78] EXPR __VERIFIER_nondet_uint() & mask_SORT_5 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L78] SORT_5 state_13 = __VERIFIER_nondet_uint() & mask_SORT_5; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, var_19=0, var_40=1, var_8=0] [L79] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L81] SORT_5 init_10_arg_1 = var_8; [L82] state_9 = init_10_arg_1 [L83] SORT_5 init_14_arg_1 = var_8; [L84] state_13 = init_14_arg_1 [L85] SORT_3 init_21_arg_1 = var_19; [L86] state_20 = init_21_arg_1 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L89] input_2 = __VERIFIER_nondet_uchar() [L90] input_4 = __VERIFIER_nondet_uchar() [L91] input_6 = __VERIFIER_nondet_uint() [L92] input_7 = __VERIFIER_nondet_uchar() [L93] EXPR input_7 & mask_SORT_3 VAL [mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L93] input_7 = input_7 & mask_SORT_3 [L96] SORT_5 var_11_arg_0 = state_9; [L97] SORT_5 var_11_arg_1 = var_8; [L98] SORT_3 var_11 = var_11_arg_0 == var_11_arg_1; [L99] SORT_3 var_12_arg_0 = var_11; [L100] SORT_3 var_12 = ~var_12_arg_0; [L101] SORT_5 var_15_arg_0 = state_13; [L102] SORT_5 var_15_arg_1 = var_8; [L103] SORT_3 var_15 = var_15_arg_0 == var_15_arg_1; [L104] SORT_3 var_16_arg_0 = var_15; [L105] SORT_3 var_16 = ~var_16_arg_0; [L106] SORT_3 var_17_arg_0 = var_12; [L107] SORT_3 var_17_arg_1 = var_16; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_17_arg_0=-2, var_17_arg_1=-2, var_40=1, var_8=0] [L108] EXPR var_17_arg_0 & var_17_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L108] SORT_3 var_17 = var_17_arg_0 & var_17_arg_1; [L109] SORT_3 var_18_arg_0 = var_17; [L110] SORT_3 var_18 = ~var_18_arg_0; [L111] SORT_3 var_22_arg_0 = state_20; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_22_arg_0=0, var_40=1, var_8=0] [L112] EXPR var_22_arg_0 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_40=1, var_8=0] [L112] var_22_arg_0 = var_22_arg_0 & mask_SORT_3 [L113] SORT_5 var_22 = var_22_arg_0; [L114] SORT_5 var_23_arg_0 = var_22; [L115] SORT_5 var_23_arg_1 = var_8; [L116] SORT_3 var_23 = var_23_arg_0 == var_23_arg_1; [L117] SORT_5 var_24_arg_0 = state_9; [L118] SORT_5 var_24_arg_1 = var_8; [L119] SORT_3 var_24 = var_24_arg_0 == var_24_arg_1; [L120] SORT_3 var_25_arg_0 = var_24; [L121] SORT_3 var_25 = ~var_25_arg_0; [L122] SORT_3 var_26_arg_0 = var_23; [L123] SORT_3 var_26_arg_1 = var_25; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_26_arg_0=1, var_26_arg_1=-2, var_40=1, var_8=0] [L124] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_18=-255, var_40=1, var_8=0] [L124] SORT_3 var_26 = var_26_arg_0 | var_26_arg_1; [L125] SORT_3 var_27_arg_0 = var_18; [L126] SORT_3 var_27_arg_1 = var_26; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27_arg_0=-255, var_27_arg_1=255, var_40=1, var_8=0] [L127] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L127] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L128] SORT_5 var_28_arg_0 = state_9; [L129] SORT_5 var_28_arg_1 = var_8; [L130] SORT_3 var_28 = var_28_arg_0 == var_28_arg_1; [L131] SORT_5 var_29_arg_0 = state_13; [L132] SORT_5 var_29_arg_1 = var_8; [L133] SORT_3 var_29 = var_29_arg_0 == var_29_arg_1; [L134] SORT_3 var_30_arg_0 = var_28; [L135] SORT_3 var_30_arg_1 = var_29; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_30_arg_0=1, var_30_arg_1=1, var_40=1, var_8=0] [L136] EXPR var_30_arg_0 & var_30_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_40=1, var_8=0] [L136] SORT_3 var_30 = var_30_arg_0 & var_30_arg_1; [L137] SORT_3 var_31_arg_0 = var_30; [L138] SORT_3 var_31 = ~var_31_arg_0; [L139] SORT_3 var_32_arg_0 = state_20; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_32_arg_0=0, var_40=1, var_8=0] [L140] EXPR var_32_arg_0 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_40=1, var_8=0] [L140] var_32_arg_0 = var_32_arg_0 & mask_SORT_3 [L141] SORT_5 var_32 = var_32_arg_0; [L142] SORT_5 var_33_arg_0 = var_32; [L143] SORT_5 var_33_arg_1 = var_8; [L144] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L145] SORT_5 var_34_arg_0 = state_9; [L146] SORT_5 var_34_arg_1 = var_8; [L147] SORT_3 var_34 = var_34_arg_0 == var_34_arg_1; [L148] SORT_3 var_35_arg_0 = var_33; [L149] SORT_3 var_35_arg_1 = var_34; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_35_arg_0=1, var_35_arg_1=1, var_40=1, var_8=0] [L150] EXPR var_35_arg_0 | var_35_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_31=-2, var_40=1, var_8=0] [L150] SORT_3 var_35 = var_35_arg_0 | var_35_arg_1; [L151] SORT_3 var_36_arg_0 = var_31; [L152] SORT_3 var_36_arg_1 = var_35; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_36_arg_0=-2, var_36_arg_1=1, var_40=1, var_8=0] [L153] EXPR var_36_arg_0 | var_36_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_27=256, var_40=1, var_8=0] [L153] SORT_3 var_36 = var_36_arg_0 | var_36_arg_1; [L154] SORT_3 var_37_arg_0 = var_27; [L155] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_37_arg_0=256, var_37_arg_1=254, var_40=1, var_8=0] [L156] EXPR var_37_arg_0 & var_37_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L156] SORT_3 var_37 = var_37_arg_0 & var_37_arg_1; [L157] SORT_3 var_41_arg_0 = var_37; [L158] SORT_3 var_41 = ~var_41_arg_0; [L159] SORT_3 var_42_arg_0 = var_40; [L160] SORT_3 var_42_arg_1 = var_41; VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_42_arg_0=1, var_42_arg_1=-1, var_8=0] [L161] EXPR var_42_arg_0 & var_42_arg_1 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L161] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L162] EXPR var_42 & mask_SORT_3 VAL [input_7=0, mask_SORT_3=1, mask_SORT_59=536870911, mask_SORT_5=-1, mask_SORT_65=3, mask_SORT_73=67108863, mask_SORT_79=15, mask_SORT_87=1048575, mask_SORT_93=255, mask_SORT_99=65535, state_13=0, state_20=0, state_9=0, var_40=1, var_8=0] [L162] var_42 = var_42 & mask_SORT_3 [L163] SORT_3 bad_43_arg_0 = var_42; [L164] CALL __VERIFIER_assert(!(bad_43_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 162 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3668 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3668 mSDsluCounter, 44503 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38582 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5147 IncrementalHoareTripleChecker+Invalid, 5191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 5921 mSDtfsCounter, 5147 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=24, InterpolantAutomatonStates: 263, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 645 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 1167 NumberOfCodeBlocks, 1167 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1094 ConstructedInterpolants, 0 QuantifiedInterpolants, 5960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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-11-08 18:26:12,119 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/11.0.12-open/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 ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.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 c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:26:14,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:26:14,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 18:26:14,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:26:14,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:26:14,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:26:14,703 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:26:14,704 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:26:14,704 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:26:14,706 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:26:14,706 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:26:14,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:26:14,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:26:14,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:26:14,708 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:26:14,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:26:14,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:26:14,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:26:14,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:26:14,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:26:14,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:26:14,714 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:26:14,714 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:26:14,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:26:14,715 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:26:14,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:26:14,715 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:26:14,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:26:14,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:26:14,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:26:14,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:26:14,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:26:14,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:26:14,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:26:14,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:26:14,719 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 18:26:14,727 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:26:14,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:26:14,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:26:14,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:26:14,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:26:14,730 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 -> c7f343ca08bbb19155b6fdcbbb14166f212aafb2275923d09d7fbaf9a31202b4 [2024-11-08 18:26:15,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:26:15,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:26:15,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:26:15,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:26:15,125 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:26:15,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-11-08 18:26:16,712 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:26:16,991 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:26:16,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c [2024-11-08 18:26:17,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e4c860b/d2e5695e09644985808c6c54ec895059/FLAGed2839b7e [2024-11-08 18:26:17,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e4c860b/d2e5695e09644985808c6c54ec895059 [2024-11-08 18:26:17,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:26:17,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:26:17,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:26:17,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:26:17,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:26:17,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27924541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17, skipping insertion in model container [2024-11-08 18:26:17,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:26:17,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-11-08 18:26:17,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:26:17,459 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:26:17,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Spinner.c[1249,1262] [2024-11-08 18:26:17,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:26:17,555 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:26:17,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17 WrapperNode [2024-11-08 18:26:17,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:26:17,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:26:17,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:26:17,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:26:17,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,633 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 286 [2024-11-08 18:26:17,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:26:17,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:26:17,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:26:17,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:26:17,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,679 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 18:26:17,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:26:17,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:26:17,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:26:17,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:26:17,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (1/1) ... [2024-11-08 18:26:17,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:26:17,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:26:17,742 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-11-08 18:26:17,746 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-11-08 18:26:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:26:17,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:26:17,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:26:17,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:26:17,911 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:26:17,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:26:18,340 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-08 18:26:18,340 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:26:18,355 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:26:18,357 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:26:18,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:18 BoogieIcfgContainer [2024-11-08 18:26:18,358 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:26:18,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:26:18,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:26:18,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:26:18,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:26:17" (1/3) ... [2024-11-08 18:26:18,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c557e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:18, skipping insertion in model container [2024-11-08 18:26:18,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:26:17" (2/3) ... [2024-11-08 18:26:18,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c557e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:26:18, skipping insertion in model container [2024-11-08 18:26:18,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:18" (3/3) ... [2024-11-08 18:26:18,368 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Spinner.c [2024-11-08 18:26:18,387 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:26:18,387 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:26:18,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:26:18,480 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;@76690000, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:26:18,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:26:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-11-08 18:26:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 18:26:18,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:26:18,492 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 18:26:18,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:26:18,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:26:18,500 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 18:26:18,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:26:18,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717139598] [2024-11-08 18:26:18,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:26:18,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:26:18,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:26:18,520 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-11-08 18:26:18,522 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-11-08 18:26:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:26:18,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 18:26:18,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:26:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:26:19,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:26:19,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:26:19,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717139598] [2024-11-08 18:26:19,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717139598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:26:19,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:26:19,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:26:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497235507] [2024-11-08 18:26:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:26:19,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:26:19,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:26:19,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:26:19,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:26:19,077 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11-08 18:26:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:26:19,165 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2024-11-08 18:26:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:26:19,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-08 18:26:19,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:26:19,175 INFO L225 Difference]: With dead ends: 16 [2024-11-08 18:26:19,175 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 18:26:19,179 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-11-08 18:26:19,185 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:26:19,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:26:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 18:26:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 18:26:19,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-11-08 18:26:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 18:26:19,212 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2024-11-08 18:26:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:26:19,212 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 18:26:19,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-11-08 18:26:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 18:26:19,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 18:26:19,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:26:19,219 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-11-08 18:26:19,416 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-11-08 18:26:19,419 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-08 18:26:19,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 18:26:19,432 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:26:19,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:26:19 BoogieIcfgContainer [2024-11-08 18:26:19,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:26:19,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:26:19,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:26:19,445 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:26:19,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:26:18" (3/4) ... [2024-11-08 18:26:19,448 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 18:26:19,462 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 18:26:19,463 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 18:26:19,463 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 18:26:19,464 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 18:26:19,640 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 18:26:19,641 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 18:26:19,641 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:26:19,642 INFO L158 Benchmark]: Toolchain (without parser) took 2610.57ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 40.8MB in the beginning and 63.4MB in the end (delta: -22.6MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-11-08 18:26:19,643 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 62.9MB. Free memory was 38.0MB in the beginning and 37.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:26:19,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 521.92ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 40.6MB in the beginning and 50.1MB in the end (delta: -9.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 18:26:19,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.91ms. Allocated memory is still 75.5MB. Free memory was 50.1MB in the beginning and 46.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:26:19,644 INFO L158 Benchmark]: Boogie Preprocessor took 63.23ms. Allocated memory is still 75.5MB. Free memory was 46.9MB in the beginning and 43.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:26:19,644 INFO L158 Benchmark]: RCFGBuilder took 656.67ms. Allocated memory is still 75.5MB. Free memory was 43.3MB in the beginning and 25.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-08 18:26:19,645 INFO L158 Benchmark]: TraceAbstraction took 1083.35ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 25.0MB in the beginning and 49.3MB in the end (delta: -24.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:26:19,645 INFO L158 Benchmark]: Witness Printer took 197.00ms. Allocated memory is still 92.3MB. Free memory was 49.3MB in the beginning and 63.4MB in the end (delta: -14.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 18:26:19,647 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.56ms. Allocated memory is still 62.9MB. Free memory was 38.0MB in the beginning and 37.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 521.92ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 40.6MB in the beginning and 50.1MB in the end (delta: -9.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.91ms. Allocated memory is still 75.5MB. Free memory was 50.1MB in the beginning and 46.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.23ms. Allocated memory is still 75.5MB. Free memory was 46.9MB in the beginning and 43.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 656.67ms. Allocated memory is still 75.5MB. Free memory was 43.3MB in the beginning and 25.5MB in the end (delta: 17.8MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1083.35ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 25.0MB in the beginning and 49.3MB in the end (delta: -24.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 197.00ms. Allocated memory is still 92.3MB. Free memory was 49.3MB in the beginning and 63.4MB in the end (delta: -14.1MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 4 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-11-08 18:26:19,683 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 Writing output log to file Ultimate.log Result: TRUE