./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label46.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label46.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 201cd0b9f7312851770c009ac8fff4b46d270c8816b37eb4df1c49891060a8fb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:19:36,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:19:36,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:19:36,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:19:36,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:19:36,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:19:36,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:19:36,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:19:36,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:19:36,771 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:19:36,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:19:36,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:19:36,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:19:36,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:19:36,772 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:19:36,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:19:36,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:19:36,773 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:19:36,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:19:36,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:19:36,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:19:36,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:19:36,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:19:36,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:19:36,776 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:19:36,776 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:19:36,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:19:36,776 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:19:36,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:19:36,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:19:36,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:19:36,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:19:36,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:19:36,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:19:36,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:19:36,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:19:36,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:19:36,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:19:36,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:19:36,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:19:36,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:19:36,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:19:36,781 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 201cd0b9f7312851770c009ac8fff4b46d270c8816b37eb4df1c49891060a8fb [2024-10-10 23:19:37,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:19:37,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:19:37,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:19:37,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:19:37,041 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:19:37,043 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label46.c [2024-10-10 23:19:38,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:19:38,610 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:19:38,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label46.c [2024-10-10 23:19:38,641 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6da04d50b/3d7af3310c97436fb40eadbc942c3140/FLAG05f896065 [2024-10-10 23:19:38,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6da04d50b/3d7af3310c97436fb40eadbc942c3140 [2024-10-10 23:19:38,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:19:38,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:19:38,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:38,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:19:38,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:19:38,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:38" (1/1) ... [2024-10-10 23:19:38,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7467e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:38, skipping insertion in model container [2024-10-10 23:19:38,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:38" (1/1) ... [2024-10-10 23:19:38,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:19:38,945 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label46.c[8949,8962] [2024-10-10 23:19:39,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:39,250 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:19:39,280 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label46.c[8949,8962] [2024-10-10 23:19:39,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:39,385 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:19:39,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39 WrapperNode [2024-10-10 23:19:39,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:39,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:39,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:19:39,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:19:39,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,490 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-10 23:19:39,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:39,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:19:39,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:19:39,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:19:39,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,551 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-10-10 23:19:39,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:19:39,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:19:39,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:19:39,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:19:39,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:19:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:19:39,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:19:39,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:19:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:19:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:19:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:19:39,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:19:39,723 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:19:39,724 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:19:40,896 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-10 23:19:40,896 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:19:40,951 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:19:40,951 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:19:40,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:40 BoogieIcfgContainer [2024-10-10 23:19:40,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:19:40,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:19:40,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:19:40,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:19:40,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:19:38" (1/3) ... [2024-10-10 23:19:40,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7583f9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:19:40, skipping insertion in model container [2024-10-10 23:19:40,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (2/3) ... [2024-10-10 23:19:40,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7583f9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:19:40, skipping insertion in model container [2024-10-10 23:19:40,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:40" (3/3) ... [2024-10-10 23:19:40,960 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label46.c [2024-10-10 23:19:40,974 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:19:40,974 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:19:41,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:19:41,045 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;@4223ac13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:19:41,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:19:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-10 23:19:41,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:41,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:41,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:41,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:41,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1542101384, now seen corresponding path program 1 times [2024-10-10 23:19:41,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:41,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863412703] [2024-10-10 23:19:41,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:41,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863412703] [2024-10-10 23:19:41,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863412703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:41,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:41,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:41,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118348976] [2024-10-10 23:19:41,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:41,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:19:41,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:41,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:19:41,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:19:41,438 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 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 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:41,491 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-10 23:19:41,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:19:41,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 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 61 [2024-10-10 23:19:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:41,502 INFO L225 Difference]: With dead ends: 441 [2024-10-10 23:19:41,502 INFO L226 Difference]: Without dead ends: 219 [2024-10-10 23:19:41,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:19:41,508 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:41,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:19:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-10 23:19:41,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-10 23:19:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-10 23:19:41,554 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 61 [2024-10-10 23:19:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:41,554 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-10 23:19:41,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-10 23:19:41,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-10 23:19:41,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:41,556 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:41,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:19:41,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:41,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:41,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1645941997, now seen corresponding path program 1 times [2024-10-10 23:19:41,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:41,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657348070] [2024-10-10 23:19:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:41,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657348070] [2024-10-10 23:19:41,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657348070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:41,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760119865] [2024-10-10 23:19:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:41,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:41,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:41,772 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:42,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:42,503 INFO L93 Difference]: Finished difference Result 630 states and 1029 transitions. [2024-10-10 23:19:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:42,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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 61 [2024-10-10 23:19:42,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:42,506 INFO L225 Difference]: With dead ends: 630 [2024-10-10 23:19:42,506 INFO L226 Difference]: Without dead ends: 412 [2024-10-10 23:19:42,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 23:19:42,511 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 146 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:42,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 144 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:19:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-10 23:19:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2024-10-10 23:19:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 409 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2024-10-10 23:19:42,526 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 61 [2024-10-10 23:19:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:42,526 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2024-10-10 23:19:42,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2024-10-10 23:19:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-10 23:19:42,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:42,530 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:42,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:19:42,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:42,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 441675973, now seen corresponding path program 1 times [2024-10-10 23:19:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:42,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517710182] [2024-10-10 23:19:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:42,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:42,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517710182] [2024-10-10 23:19:42,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517710182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:42,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:42,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:42,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724172462] [2024-10-10 23:19:42,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:42,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:42,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:42,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:42,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:42,672 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:43,291 INFO L93 Difference]: Finished difference Result 1208 states and 1764 transitions. [2024-10-10 23:19:43,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:43,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-10-10 23:19:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:43,295 INFO L225 Difference]: With dead ends: 1208 [2024-10-10 23:19:43,295 INFO L226 Difference]: Without dead ends: 799 [2024-10-10 23:19:43,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 23:19:43,297 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:43,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-10 23:19:43,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 786. [2024-10-10 23:19:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3847133757961783) internal successors, (1087), 785 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1087 transitions. [2024-10-10 23:19:43,317 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1087 transitions. Word has length 129 [2024-10-10 23:19:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:43,318 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1087 transitions. [2024-10-10 23:19:43,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1087 transitions. [2024-10-10 23:19:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-10 23:19:43,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:43,321 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:43,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:19:43,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:43,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:43,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1051544992, now seen corresponding path program 1 times [2024-10-10 23:19:43,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:43,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334183889] [2024-10-10 23:19:43,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:43,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334183889] [2024-10-10 23:19:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334183889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:43,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:43,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:43,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095372152] [2024-10-10 23:19:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:43,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:43,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:43,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:43,675 INFO L87 Difference]: Start difference. First operand 786 states and 1087 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:44,338 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2024-10-10 23:19:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:44,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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 131 [2024-10-10 23:19:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:44,343 INFO L225 Difference]: With dead ends: 1941 [2024-10-10 23:19:44,343 INFO L226 Difference]: Without dead ends: 1156 [2024-10-10 23:19:44,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 23:19:44,345 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:44,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:44,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-10-10 23:19:44,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1155. [2024-10-10 23:19:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2772963604852687) internal successors, (1474), 1154 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1474 transitions. [2024-10-10 23:19:44,372 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1474 transitions. Word has length 131 [2024-10-10 23:19:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:44,373 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1474 transitions. [2024-10-10 23:19:44,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1474 transitions. [2024-10-10 23:19:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-10 23:19:44,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:44,380 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:44,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:19:44,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:44,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1872934921, now seen corresponding path program 1 times [2024-10-10 23:19:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:44,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440809926] [2024-10-10 23:19:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:44,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440809926] [2024-10-10 23:19:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440809926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:44,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:44,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:44,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481537010] [2024-10-10 23:19:44,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:44,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:44,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:44,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:44,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:44,655 INFO L87 Difference]: Start difference. First operand 1155 states and 1474 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:45,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:45,652 INFO L93 Difference]: Finished difference Result 2690 states and 3512 transitions. [2024-10-10 23:19:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:45,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 173 [2024-10-10 23:19:45,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:45,664 INFO L225 Difference]: With dead ends: 2690 [2024-10-10 23:19:45,665 INFO L226 Difference]: Without dead ends: 1720 [2024-10-10 23:19:45,666 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-10-10 23:19:45,671 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 144 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:45,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 333 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:19:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-10-10 23:19:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1527. [2024-10-10 23:19:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1527 states, 1526 states have (on average 1.2608125819134994) internal successors, (1924), 1526 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1924 transitions. [2024-10-10 23:19:45,721 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1924 transitions. Word has length 173 [2024-10-10 23:19:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:45,722 INFO L471 AbstractCegarLoop]: Abstraction has 1527 states and 1924 transitions. [2024-10-10 23:19:45,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1924 transitions. [2024-10-10 23:19:45,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-10 23:19:45,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:45,729 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:45,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:19:45,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:45,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1099149436, now seen corresponding path program 1 times [2024-10-10 23:19:45,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:45,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83616522] [2024-10-10 23:19:45,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:45,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-10 23:19:46,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:46,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83616522] [2024-10-10 23:19:46,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83616522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:46,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:46,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:46,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342626190] [2024-10-10 23:19:46,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:46,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:46,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:46,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:46,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:46,073 INFO L87 Difference]: Start difference. First operand 1527 states and 1924 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:47,236 INFO L93 Difference]: Finished difference Result 4159 states and 5314 transitions. [2024-10-10 23:19:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:47,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 243 [2024-10-10 23:19:47,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:47,243 INFO L225 Difference]: With dead ends: 4159 [2024-10-10 23:19:47,243 INFO L226 Difference]: Without dead ends: 2633 [2024-10-10 23:19:47,245 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-10-10 23:19:47,246 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 152 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:47,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 349 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 23:19:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2024-10-10 23:19:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2633. [2024-10-10 23:19:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2632 states have (on average 1.2469604863221884) internal successors, (3282), 2632 states have internal predecessors, (3282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:47,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3282 transitions. [2024-10-10 23:19:47,278 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3282 transitions. Word has length 243 [2024-10-10 23:19:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:47,279 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3282 transitions. [2024-10-10 23:19:47,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3282 transitions. [2024-10-10 23:19:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-10 23:19:47,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:47,281 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:47,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:19:47,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:47,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:47,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1073805435, now seen corresponding path program 1 times [2024-10-10 23:19:47,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:47,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915120098] [2024-10-10 23:19:47,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:47,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-10 23:19:47,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:47,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915120098] [2024-10-10 23:19:47,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915120098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:47,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:47,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:47,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574321578] [2024-10-10 23:19:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:47,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:47,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:47,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:47,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:47,427 INFO L87 Difference]: Start difference. First operand 2633 states and 3282 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:48,638 INFO L93 Difference]: Finished difference Result 6552 states and 8156 transitions. [2024-10-10 23:19:48,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:48,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 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 254 [2024-10-10 23:19:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:48,648 INFO L225 Difference]: With dead ends: 6552 [2024-10-10 23:19:48,649 INFO L226 Difference]: Without dead ends: 3920 [2024-10-10 23:19:48,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 23:19:48,658 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:48,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 153 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:19:48,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2024-10-10 23:19:48,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3184. [2024-10-10 23:19:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3184 states, 3183 states have (on average 1.1699654414074772) internal successors, (3724), 3183 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3184 states to 3184 states and 3724 transitions. [2024-10-10 23:19:48,767 INFO L78 Accepts]: Start accepts. Automaton has 3184 states and 3724 transitions. Word has length 254 [2024-10-10 23:19:48,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:48,770 INFO L471 AbstractCegarLoop]: Abstraction has 3184 states and 3724 transitions. [2024-10-10 23:19:48,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 3184 states and 3724 transitions. [2024-10-10 23:19:48,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-10 23:19:48,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:48,777 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:48,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:19:48,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:48,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:48,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1584555167, now seen corresponding path program 1 times [2024-10-10 23:19:48,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:48,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815280622] [2024-10-10 23:19:48,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:48,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-10 23:19:49,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:49,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815280622] [2024-10-10 23:19:49,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815280622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:49,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:49,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472839682] [2024-10-10 23:19:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:49,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:49,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:49,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:49,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:49,076 INFO L87 Difference]: Start difference. First operand 3184 states and 3724 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:49,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:49,953 INFO L93 Difference]: Finished difference Result 7107 states and 8337 transitions. [2024-10-10 23:19:49,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:49,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 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 270 [2024-10-10 23:19:49,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:49,964 INFO L225 Difference]: With dead ends: 7107 [2024-10-10 23:19:49,964 INFO L226 Difference]: Without dead ends: 3924 [2024-10-10 23:19:49,968 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-10-10 23:19:49,971 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 139 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:49,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 369 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:19:49,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2024-10-10 23:19:50,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3735. [2024-10-10 23:19:50,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3735 states, 3734 states have (on average 1.1606855918585968) internal successors, (4334), 3734 states have internal predecessors, (4334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3735 states to 3735 states and 4334 transitions. [2024-10-10 23:19:50,023 INFO L78 Accepts]: Start accepts. Automaton has 3735 states and 4334 transitions. Word has length 270 [2024-10-10 23:19:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:50,023 INFO L471 AbstractCegarLoop]: Abstraction has 3735 states and 4334 transitions. [2024-10-10 23:19:50,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3735 states and 4334 transitions. [2024-10-10 23:19:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-10-10 23:19:50,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:50,027 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:50,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:19:50,027 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:50,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:50,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1519865807, now seen corresponding path program 1 times [2024-10-10 23:19:50,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:50,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922727911] [2024-10-10 23:19:50,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:50,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-10 23:19:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922727911] [2024-10-10 23:19:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922727911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:50,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:50,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:50,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848824501] [2024-10-10 23:19:50,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:50,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:50,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:50,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:50,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:50,306 INFO L87 Difference]: Start difference. First operand 3735 states and 4334 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:51,003 INFO L93 Difference]: Finished difference Result 8578 states and 9917 transitions. [2024-10-10 23:19:51,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:51,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 283 [2024-10-10 23:19:51,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:51,031 INFO L225 Difference]: With dead ends: 8578 [2024-10-10 23:19:51,032 INFO L226 Difference]: Without dead ends: 4844 [2024-10-10 23:19:51,039 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-10-10 23:19:51,040 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 158 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:51,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 387 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4844 states. [2024-10-10 23:19:51,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4844 to 4843. [2024-10-10 23:19:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4843 states, 4842 states have (on average 1.1526228831061545) internal successors, (5581), 4842 states have internal predecessors, (5581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:51,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 5581 transitions. [2024-10-10 23:19:51,166 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 5581 transitions. Word has length 283 [2024-10-10 23:19:51,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:51,167 INFO L471 AbstractCegarLoop]: Abstraction has 4843 states and 5581 transitions. [2024-10-10 23:19:51,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 5581 transitions. [2024-10-10 23:19:51,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-10-10 23:19:51,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:51,183 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:51,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:19:51,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:51,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:51,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1091091309, now seen corresponding path program 1 times [2024-10-10 23:19:51,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:51,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668764378] [2024-10-10 23:19:51,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:51,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2024-10-10 23:19:51,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:51,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668764378] [2024-10-10 23:19:51,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668764378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:51,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:51,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:51,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018264219] [2024-10-10 23:19:51,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:51,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:51,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:51,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:51,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:51,491 INFO L87 Difference]: Start difference. First operand 4843 states and 5581 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:52,041 INFO L93 Difference]: Finished difference Result 10237 states and 11864 transitions. [2024-10-10 23:19:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:52,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 292 [2024-10-10 23:19:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:52,054 INFO L225 Difference]: With dead ends: 10237 [2024-10-10 23:19:52,054 INFO L226 Difference]: Without dead ends: 5763 [2024-10-10 23:19:52,058 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-10-10 23:19:52,059 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 130 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:52,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 381 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5763 states. [2024-10-10 23:19:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5763 to 5211. [2024-10-10 23:19:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5211 states, 5210 states have (on average 1.1464491362763916) internal successors, (5973), 5210 states have internal predecessors, (5973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:52,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5211 states to 5211 states and 5973 transitions. [2024-10-10 23:19:52,124 INFO L78 Accepts]: Start accepts. Automaton has 5211 states and 5973 transitions. Word has length 292 [2024-10-10 23:19:52,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:52,124 INFO L471 AbstractCegarLoop]: Abstraction has 5211 states and 5973 transitions. [2024-10-10 23:19:52,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 5211 states and 5973 transitions. [2024-10-10 23:19:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-10 23:19:52,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:52,131 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:52,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:19:52,131 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:52,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:52,132 INFO L85 PathProgramCache]: Analyzing trace with hash -268361832, now seen corresponding path program 1 times [2024-10-10 23:19:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:52,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779636842] [2024-10-10 23:19:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:52,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-10 23:19:52,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:52,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779636842] [2024-10-10 23:19:52,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779636842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:52,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:52,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:52,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231601361] [2024-10-10 23:19:52,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:52,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:52,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:52,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:52,372 INFO L87 Difference]: Start difference. First operand 5211 states and 5973 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:53,070 INFO L93 Difference]: Finished difference Result 12261 states and 14254 transitions. [2024-10-10 23:19:53,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:53,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 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 320 [2024-10-10 23:19:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:53,096 INFO L225 Difference]: With dead ends: 12261 [2024-10-10 23:19:53,096 INFO L226 Difference]: Without dead ends: 7419 [2024-10-10 23:19:53,102 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-10-10 23:19:53,103 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 147 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:53,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 339 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:19:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2024-10-10 23:19:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 7234. [2024-10-10 23:19:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7234 states, 7233 states have (on average 1.1385317295727915) internal successors, (8235), 7233 states have internal predecessors, (8235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7234 states to 7234 states and 8235 transitions. [2024-10-10 23:19:53,196 INFO L78 Accepts]: Start accepts. Automaton has 7234 states and 8235 transitions. Word has length 320 [2024-10-10 23:19:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:53,196 INFO L471 AbstractCegarLoop]: Abstraction has 7234 states and 8235 transitions. [2024-10-10 23:19:53,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 7234 states and 8235 transitions. [2024-10-10 23:19:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-10-10 23:19:53,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:53,206 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:53,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:19:53,207 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:53,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash -718598189, now seen corresponding path program 1 times [2024-10-10 23:19:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:53,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889236725] [2024-10-10 23:19:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-10 23:19:53,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:53,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889236725] [2024-10-10 23:19:53,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889236725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:53,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:53,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:53,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966794776] [2024-10-10 23:19:53,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:53,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:53,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:53,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:53,514 INFO L87 Difference]: Start difference. First operand 7234 states and 8235 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:54,095 INFO L93 Difference]: Finished difference Result 15953 states and 18176 transitions. [2024-10-10 23:19:54,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:54,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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 433 [2024-10-10 23:19:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:54,107 INFO L225 Difference]: With dead ends: 15953 [2024-10-10 23:19:54,107 INFO L226 Difference]: Without dead ends: 8904 [2024-10-10 23:19:54,113 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-10-10 23:19:54,113 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 66 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:54,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 178 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8904 states. [2024-10-10 23:19:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8904 to 8890. [2024-10-10 23:19:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8890 states, 8889 states have (on average 1.1227359658004274) internal successors, (9980), 8889 states have internal predecessors, (9980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8890 states to 8890 states and 9980 transitions. [2024-10-10 23:19:54,201 INFO L78 Accepts]: Start accepts. Automaton has 8890 states and 9980 transitions. Word has length 433 [2024-10-10 23:19:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:54,201 INFO L471 AbstractCegarLoop]: Abstraction has 8890 states and 9980 transitions. [2024-10-10 23:19:54,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 8890 states and 9980 transitions. [2024-10-10 23:19:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2024-10-10 23:19:54,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:54,212 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:54,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:19:54,213 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:54,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:54,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1000956046, now seen corresponding path program 1 times [2024-10-10 23:19:54,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:54,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917101383] [2024-10-10 23:19:54,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:54,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 632 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-10 23:19:54,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:54,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917101383] [2024-10-10 23:19:54,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917101383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:54,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:54,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:54,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609593285] [2024-10-10 23:19:54,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:54,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:54,489 INFO L87 Difference]: Start difference. First operand 8890 states and 9980 transitions. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:55,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:55,081 INFO L93 Difference]: Finished difference Result 18698 states and 21105 transitions. [2024-10-10 23:19:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:55,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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 485 [2024-10-10 23:19:55,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:55,095 INFO L225 Difference]: With dead ends: 18698 [2024-10-10 23:19:55,095 INFO L226 Difference]: Without dead ends: 10177 [2024-10-10 23:19:55,101 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-10-10 23:19:55,101 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 70 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:55,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 351 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10177 states. [2024-10-10 23:19:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10177 to 9993. [2024-10-10 23:19:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9993 states, 9992 states have (on average 1.1253002401921537) internal successors, (11244), 9992 states have internal predecessors, (11244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9993 states to 9993 states and 11244 transitions. [2024-10-10 23:19:55,178 INFO L78 Accepts]: Start accepts. Automaton has 9993 states and 11244 transitions. Word has length 485 [2024-10-10 23:19:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:55,179 INFO L471 AbstractCegarLoop]: Abstraction has 9993 states and 11244 transitions. [2024-10-10 23:19:55,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:55,179 INFO L276 IsEmpty]: Start isEmpty. Operand 9993 states and 11244 transitions. [2024-10-10 23:19:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2024-10-10 23:19:55,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:55,191 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:55,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:19:55,191 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:55,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash 111486038, now seen corresponding path program 1 times [2024-10-10 23:19:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998297765] [2024-10-10 23:19:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2024-10-10 23:19:55,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998297765] [2024-10-10 23:19:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998297765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:55,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:55,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:55,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068247528] [2024-10-10 23:19:55,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:55,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:55,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:55,549 INFO L87 Difference]: Start difference. First operand 9993 states and 11244 transitions. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:56,165 INFO L93 Difference]: Finished difference Result 22026 states and 24893 transitions. [2024-10-10 23:19:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:56,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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 521 [2024-10-10 23:19:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:56,183 INFO L225 Difference]: With dead ends: 22026 [2024-10-10 23:19:56,183 INFO L226 Difference]: Without dead ends: 12402 [2024-10-10 23:19:56,192 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-10-10 23:19:56,192 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 138 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:56,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 131 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12402 states. [2024-10-10 23:19:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12402 to 12214. [2024-10-10 23:19:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12214 states, 12213 states have (on average 1.120036027184148) internal successors, (13679), 12213 states have internal predecessors, (13679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:56,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 13679 transitions. [2024-10-10 23:19:56,357 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 13679 transitions. Word has length 521 [2024-10-10 23:19:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:56,358 INFO L471 AbstractCegarLoop]: Abstraction has 12214 states and 13679 transitions. [2024-10-10 23:19:56,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:56,358 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 13679 transitions. [2024-10-10 23:19:56,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2024-10-10 23:19:56,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:56,371 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:56,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:19:56,372 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:56,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:56,372 INFO L85 PathProgramCache]: Analyzing trace with hash -970212154, now seen corresponding path program 1 times [2024-10-10 23:19:56,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:56,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731062867] [2024-10-10 23:19:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:56,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:56,714 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 619 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-10-10 23:19:56,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:56,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731062867] [2024-10-10 23:19:56,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731062867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:56,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:56,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:56,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254571148] [2024-10-10 23:19:56,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:56,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:56,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:56,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:56,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:56,716 INFO L87 Difference]: Start difference. First operand 12214 states and 13679 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:57,389 INFO L93 Difference]: Finished difference Result 27190 states and 30475 transitions. [2024-10-10 23:19:57,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:57,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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 525 [2024-10-10 23:19:57,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:57,407 INFO L225 Difference]: With dead ends: 27190 [2024-10-10 23:19:57,408 INFO L226 Difference]: Without dead ends: 15345 [2024-10-10 23:19:57,418 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-10-10 23:19:57,419 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:57,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 76 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15345 states. [2024-10-10 23:19:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15345 to 14414. [2024-10-10 23:19:57,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14414 states, 14413 states have (on average 1.1133698744189273) internal successors, (16047), 14413 states have internal predecessors, (16047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14414 states to 14414 states and 16047 transitions. [2024-10-10 23:19:57,567 INFO L78 Accepts]: Start accepts. Automaton has 14414 states and 16047 transitions. Word has length 525 [2024-10-10 23:19:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:57,568 INFO L471 AbstractCegarLoop]: Abstraction has 14414 states and 16047 transitions. [2024-10-10 23:19:57,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 14414 states and 16047 transitions. [2024-10-10 23:19:57,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2024-10-10 23:19:57,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:57,581 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:57,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:19:57,581 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:57,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:57,582 INFO L85 PathProgramCache]: Analyzing trace with hash 756091869, now seen corresponding path program 1 times [2024-10-10 23:19:57,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:57,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783802974] [2024-10-10 23:19:57,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:57,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 320 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-10-10 23:19:58,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:58,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783802974] [2024-10-10 23:19:58,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783802974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:19:58,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525331501] [2024-10-10 23:19:58,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:58,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:19:58,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:19:58,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:19:58,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:19:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:58,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 23:19:58,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:20:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 320 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-10-10 23:20:05,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:20:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 645 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-10-10 23:20:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525331501] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:20:08,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:20:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 9 [2024-10-10 23:20:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104898623] [2024-10-10 23:20:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:08,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:08,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:20:08,540 INFO L87 Difference]: Start difference. First operand 14414 states and 16047 transitions. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:09,606 INFO L93 Difference]: Finished difference Result 29933 states and 33326 transitions. [2024-10-10 23:20:09,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:09,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 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 531 [2024-10-10 23:20:09,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:09,625 INFO L225 Difference]: With dead ends: 29933 [2024-10-10 23:20:09,626 INFO L226 Difference]: Without dead ends: 15888 [2024-10-10 23:20:09,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1065 GetRequests, 1058 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:20:09,638 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 236 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:09,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 59 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:20:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15888 states. [2024-10-10 23:20:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15888 to 11838. [2024-10-10 23:20:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11838 states, 11837 states have (on average 1.119709385824111) internal successors, (13254), 11837 states have internal predecessors, (13254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11838 states to 11838 states and 13254 transitions. [2024-10-10 23:20:09,897 INFO L78 Accepts]: Start accepts. Automaton has 11838 states and 13254 transitions. Word has length 531 [2024-10-10 23:20:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:09,897 INFO L471 AbstractCegarLoop]: Abstraction has 11838 states and 13254 transitions. [2024-10-10 23:20:09,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 11838 states and 13254 transitions. [2024-10-10 23:20:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2024-10-10 23:20:09,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:09,912 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:09,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:20:10,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 23:20:10,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:10,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1867635112, now seen corresponding path program 1 times [2024-10-10 23:20:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:10,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012217936] [2024-10-10 23:20:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-10-10 23:20:10,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:10,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012217936] [2024-10-10 23:20:10,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012217936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:10,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:10,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:10,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481220188] [2024-10-10 23:20:10,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:10,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:20:10,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:10,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:20:10,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:10,471 INFO L87 Difference]: Start difference. First operand 11838 states and 13254 transitions. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:11,379 INFO L93 Difference]: Finished difference Result 29948 states and 33347 transitions. [2024-10-10 23:20:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:20:11,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 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 597 [2024-10-10 23:20:11,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:11,403 INFO L225 Difference]: With dead ends: 29948 [2024-10-10 23:20:11,403 INFO L226 Difference]: Without dead ends: 18111 [2024-10-10 23:20:11,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:20:11,418 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 170 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:11,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 82 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:20:11,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18111 states. [2024-10-10 23:20:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18111 to 16444. [2024-10-10 23:20:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16444 states, 16443 states have (on average 1.1089217296113847) internal successors, (18234), 16443 states have internal predecessors, (18234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16444 states to 16444 states and 18234 transitions. [2024-10-10 23:20:11,559 INFO L78 Accepts]: Start accepts. Automaton has 16444 states and 18234 transitions. Word has length 597 [2024-10-10 23:20:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:11,560 INFO L471 AbstractCegarLoop]: Abstraction has 16444 states and 18234 transitions. [2024-10-10 23:20:11,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 16444 states and 18234 transitions. [2024-10-10 23:20:11,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2024-10-10 23:20:11,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:11,575 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:11,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:20:11,575 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:11,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1670348849, now seen corresponding path program 1 times [2024-10-10 23:20:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295388937] [2024-10-10 23:20:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2024-10-10 23:20:11,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:11,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295388937] [2024-10-10 23:20:11,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295388937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:11,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:11,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:11,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213738166] [2024-10-10 23:20:11,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:11,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:11,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:11,908 INFO L87 Difference]: Start difference. First operand 16444 states and 18234 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:12,631 INFO L93 Difference]: Finished difference Result 34912 states and 38697 transitions. [2024-10-10 23:20:12,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:12,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 648 [2024-10-10 23:20:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:12,651 INFO L225 Difference]: With dead ends: 34912 [2024-10-10 23:20:12,651 INFO L226 Difference]: Without dead ends: 18837 [2024-10-10 23:20:12,664 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-10-10 23:20:12,664 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 146 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:12,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 126 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:20:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18837 states. [2024-10-10 23:20:12,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18837 to 16260. [2024-10-10 23:20:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16260 states, 16259 states have (on average 1.10283535272772) internal successors, (17931), 16259 states have internal predecessors, (17931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16260 states to 16260 states and 17931 transitions. [2024-10-10 23:20:12,892 INFO L78 Accepts]: Start accepts. Automaton has 16260 states and 17931 transitions. Word has length 648 [2024-10-10 23:20:12,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:12,892 INFO L471 AbstractCegarLoop]: Abstraction has 16260 states and 17931 transitions. [2024-10-10 23:20:12,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 16260 states and 17931 transitions. [2024-10-10 23:20:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2024-10-10 23:20:12,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:12,912 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:12,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 23:20:12,913 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:12,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:12,913 INFO L85 PathProgramCache]: Analyzing trace with hash -96785697, now seen corresponding path program 1 times [2024-10-10 23:20:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:12,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331896880] [2024-10-10 23:20:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:12,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:13,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 690 trivial. 0 not checked. [2024-10-10 23:20:13,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331896880] [2024-10-10 23:20:13,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331896880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:13,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:13,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:13,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381745465] [2024-10-10 23:20:13,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:13,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:13,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:13,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:13,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:13,363 INFO L87 Difference]: Start difference. First operand 16260 states and 17931 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:13,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:13,999 INFO L93 Difference]: Finished difference Result 33622 states and 37062 transitions. [2024-10-10 23:20:13,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:14,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 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 681 [2024-10-10 23:20:14,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:14,018 INFO L225 Difference]: With dead ends: 33622 [2024-10-10 23:20:14,018 INFO L226 Difference]: Without dead ends: 17731 [2024-10-10 23:20:14,030 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-10-10 23:20:14,031 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 113 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:14,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 142 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:20:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17731 states. [2024-10-10 23:20:14,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17731 to 15514. [2024-10-10 23:20:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15514 states, 15513 states have (on average 1.0981112615225939) internal successors, (17035), 15513 states have internal predecessors, (17035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15514 states to 15514 states and 17035 transitions. [2024-10-10 23:20:14,187 INFO L78 Accepts]: Start accepts. Automaton has 15514 states and 17035 transitions. Word has length 681 [2024-10-10 23:20:14,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:14,187 INFO L471 AbstractCegarLoop]: Abstraction has 15514 states and 17035 transitions. [2024-10-10 23:20:14,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 15514 states and 17035 transitions. [2024-10-10 23:20:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2024-10-10 23:20:14,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:20:14,202 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:20:14,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:20:14,202 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:20:14,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:20:14,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1468241767, now seen corresponding path program 1 times [2024-10-10 23:20:14,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:20:14,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460706064] [2024-10-10 23:20:14,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:20:14,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:20:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:20:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 1154 proven. 0 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2024-10-10 23:20:14,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:20:14,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460706064] [2024-10-10 23:20:14,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460706064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:20:14,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:20:14,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:20:14,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161714521] [2024-10-10 23:20:14,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:20:14,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:20:14,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:20:14,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:20:14,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:20:14,594 INFO L87 Difference]: Start difference. First operand 15514 states and 17035 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:20:15,217 INFO L93 Difference]: Finished difference Result 30470 states and 33381 transitions. [2024-10-10 23:20:15,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:20:15,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 730 [2024-10-10 23:20:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:20:15,219 INFO L225 Difference]: With dead ends: 30470 [2024-10-10 23:20:15,219 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:20:15,231 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-10-10 23:20:15,231 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 46 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:20:15,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 343 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:20:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:20:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:20:15,232 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-10-10 23:20:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:20:15,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 730 [2024-10-10 23:20:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:20:15,233 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:20:15,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:20:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:20:15,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:20:15,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:20:15,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:20:15,238 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] [2024-10-10 23:20:15,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:20:20,484 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 278 DAG size of output: 341 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-10 23:20:21,781 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:20:21,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:20:21 BoogieIcfgContainer [2024-10-10 23:20:21,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:20:21,809 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:20:21,809 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:20:21,809 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:20:21,809 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:40" (3/4) ... [2024-10-10 23:20:21,810 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:20:21,826 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:20:21,827 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:20:21,827 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:20:21,828 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:20:21,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:20:21,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:20:21,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:20:21,981 INFO L158 Benchmark]: Toolchain (without parser) took 43320.97ms. Allocated memory was 167.8MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 95.8MB in the beginning and 858.5MB in the end (delta: -762.7MB). Peak memory consumption was 879.0MB. Max. memory is 16.1GB. [2024-10-10 23:20:21,982 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:20:21,982 INFO L158 Benchmark]: CACSL2BoogieTranslator took 724.12ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 107.6MB in the end (delta: -12.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-10-10 23:20:21,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.84ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 90.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:20:21,982 INFO L158 Benchmark]: Boogie Preprocessor took 123.75ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 65.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:20:21,984 INFO L158 Benchmark]: RCFGBuilder took 1336.37ms. Allocated memory was 167.8MB in the beginning and 287.3MB in the end (delta: 119.5MB). Free memory was 65.0MB in the beginning and 149.2MB in the end (delta: -84.2MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. [2024-10-10 23:20:21,985 INFO L158 Benchmark]: TraceAbstraction took 40853.84ms. Allocated memory was 287.3MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 149.2MB in the beginning and 876.3MB in the end (delta: -727.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-10-10 23:20:21,985 INFO L158 Benchmark]: Witness Printer took 172.06ms. Allocated memory is still 1.8GB. Free memory was 876.3MB in the beginning and 858.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:20:21,986 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.15ms. Allocated memory is still 167.8MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 724.12ms. Allocated memory is still 167.8MB. Free memory was 95.6MB in the beginning and 107.6MB in the end (delta: -12.0MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.84ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 90.2MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.75ms. Allocated memory is still 167.8MB. Free memory was 90.2MB in the beginning and 65.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1336.37ms. Allocated memory was 167.8MB in the beginning and 287.3MB in the end (delta: 119.5MB). Free memory was 65.0MB in the beginning and 149.2MB in the end (delta: -84.2MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB. * TraceAbstraction took 40853.84ms. Allocated memory was 287.3MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 149.2MB in the beginning and 876.3MB in the end (delta: -727.1MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 172.06ms. Allocated memory is still 1.8GB. Free memory was 876.3MB in the beginning and 858.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. 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: 202]: 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, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.2s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2505 SdHoareTripleChecker+Valid, 13.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2505 mSDsluCounter, 4606 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 428 mSDsCounter, 1780 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11323 IncrementalHoareTripleChecker+Invalid, 13103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1780 mSolverCounterUnsat, 4178 mSDtfsCounter, 11323 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1117 GetRequests, 1091 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16444occurred in iteration=17, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 13700 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 7899 NumberOfCodeBlocks, 7899 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 8408 ConstructedInterpolants, 60 QuantifiedInterpolants, 42280 SizeOfPredicates, 1 NumberOfNonLiveVariables, 695 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 11473/12285 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: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807)) && (a25 <= 10)) && ((0 < ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5))))) && (a4 == 1)) || ((a23 <= 138) && (a4 == 1))) || (((a25 == 12) && (0 <= ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807))) && ((0 < ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5)))))) || (((((a25 == 13) && (0 <= ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807))) && ((0 < ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5))))) && (a23 <= 138)) && (0 <= ((long long) a23 + 42)))) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (246 <= a29))) || ((a4 == 1) && (a25 == 10))) || ((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a29 <= 274)) && (246 <= a29))) || ((((0 <= ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807)) && ((0 < ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5))))) && (a25 == 10)) && (a29 <= 130))) || (((((((long long) a23 + 43) <= 0) && (0 <= ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807))) && (a25 <= 10)) && ((0 < ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5))))) && (a29 <= 130))) || ((((((0 <= ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807)) && (a25 == 11)) && ((0 < ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5))))) && (217784 <= a23)) && (a29 <= 220)) && (a4 == 1))) || ((a25 == 13) && (a4 == 1))) || ((570382 <= a29) && (a4 == 1))) || (((((a29 <= 140) && (0 <= ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807))) && (a25 == 11)) && ((0 < ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5))))) && (a23 <= 138))) || ((((((a29 <= 140) && (0 <= ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807))) && (a25 <= 10)) && ((0 < ((((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) / 5) - 1)) + 109807)) || (0 != (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) >= 0) ? ((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) : (((((((long long) a29 * 9) >= 0) ? (((long long) a29 * 9) / 10) : ((((long long) a29 * 9) / 10) - 1)) + 1) % 5) + 5))))) && (a23 <= 138)) && (0 <= ((long long) a23 + 42)))) || (((a25 == 11) && (a23 <= 138)) && (246 <= a29))) || (((a25 == 11) && (a4 == 1)) && (246 <= a29))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:20:22,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE