./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/Problem14_label16.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label16.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93a127dc0b7a4d224911518339abd36637a414ede1527bd802daa3550402937e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:42:17,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:42:17,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:42:17,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:42:17,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:42:17,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:42:17,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:42:17,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:42:17,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:42:17,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:42:17,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:42:17,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:42:17,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:42:17,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:42:17,623 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:42:17,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:42:17,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:42:17,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:42:17,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:42:17,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:42:17,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:42:17,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:42:17,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:42:17,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:42:17,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:42:17,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:42:17,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:42:17,628 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:42:17,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:42:17,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:42:17,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:42:17,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:42:17,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:42:17,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:42:17,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:42:17,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:42:17,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:42:17,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:42:17,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:42:17,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:42:17,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:42:17,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:42:17,634 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93a127dc0b7a4d224911518339abd36637a414ede1527bd802daa3550402937e [2024-10-13 23:42:17,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:42:17,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:42:17,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:42:17,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:42:17,852 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:42:17,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label16.c [2024-10-13 23:42:19,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:42:19,403 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:42:19,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label16.c [2024-10-13 23:42:19,421 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae8385b4/38ab1379caf54a7db77f395f00f65133/FLAG3008af6c4 [2024-10-13 23:42:19,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae8385b4/38ab1379caf54a7db77f395f00f65133 [2024-10-13 23:42:19,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:42:19,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:42:19,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:42:19,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:42:19,788 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:42:19,789 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:42:19" (1/1) ... [2024-10-13 23:42:19,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e732879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:19, skipping insertion in model container [2024-10-13 23:42:19,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:42:19" (1/1) ... [2024-10-13 23:42:19,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:42:20,005 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/Problem14_label16.c[4807,4820] [2024-10-13 23:42:20,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:42:20,205 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:42:20,242 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/Problem14_label16.c[4807,4820] [2024-10-13 23:42:20,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:42:20,455 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:42:20,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20 WrapperNode [2024-10-13 23:42:20,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:42:20,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:42:20,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:42:20,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:42:20,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,497 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,560 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-13 23:42:20,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:42:20,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:42:20,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:42:20,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:42:20,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,610 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-13 23:42:20,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:42:20,657 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:42:20,657 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:42:20,657 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:42:20,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (1/1) ... [2024-10-13 23:42:20,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:42:20,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:20,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:42:20,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:42:20,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:42:20,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:42:20,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:42:20,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:42:20,776 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:42:20,779 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:42:21,741 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-13 23:42:21,742 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:42:21,784 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:42:21,786 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:42:21,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:42:21 BoogieIcfgContainer [2024-10-13 23:42:21,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:42:21,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:42:21,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:42:21,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:42:21,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:42:19" (1/3) ... [2024-10-13 23:42:21,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f22a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:42:21, skipping insertion in model container [2024-10-13 23:42:21,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:20" (2/3) ... [2024-10-13 23:42:21,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f22a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:42:21, skipping insertion in model container [2024-10-13 23:42:21,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:42:21" (3/3) ... [2024-10-13 23:42:21,795 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label16.c [2024-10-13 23:42:21,807 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:42:21,808 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:42:21,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:42:21,883 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;@568f33f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:42:21,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:42:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 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-13 23:42:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 23:42:21,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:21,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:21,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:21,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1110063371, now seen corresponding path program 1 times [2024-10-13 23:42:21,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:21,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317881382] [2024-10-13 23:42:21,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:21,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:22,030 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-13 23:42:22,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:22,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317881382] [2024-10-13 23:42:22,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317881382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:22,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:22,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:42:22,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084829626] [2024-10-13 23:42:22,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:22,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:42:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:22,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:42:22,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:42:22,053 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 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 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:22,088 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-13 23:42:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:42:22,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-13 23:42:22,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:22,098 INFO L225 Difference]: With dead ends: 365 [2024-10-13 23:42:22,099 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 23:42:22,101 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-13 23:42:22,103 INFO L432 NwaCegarLoop]: 295 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, 295 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-13 23:42:22,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:42:22,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 23:42:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-13 23:42:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 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-13 23:42:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-13 23:42:22,190 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 45 [2024-10-13 23:42:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:22,191 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-13 23:42:22,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-13 23:42:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 23:42:22,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:22,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:22,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:42:22,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:22,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:22,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1694707743, now seen corresponding path program 1 times [2024-10-13 23:42:22,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:22,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288253676] [2024-10-13 23:42:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:22,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:22,322 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-13 23:42:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288253676] [2024-10-13 23:42:22,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288253676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:22,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:22,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:42:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078633125] [2024-10-13 23:42:22,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:22,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:22,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:22,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:22,325 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:23,249 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2024-10-13 23:42:23,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:23,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-13 23:42:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:23,252 INFO L225 Difference]: With dead ends: 539 [2024-10-13 23:42:23,252 INFO L226 Difference]: Without dead ends: 359 [2024-10-13 23:42:23,253 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-13 23:42:23,254 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:23,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 51 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:42:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-13 23:42:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-13 23:42:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.5223463687150838) internal successors, (545), 358 states have internal predecessors, (545), 0 states have call successors, (0), 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-13 23:42:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2024-10-13 23:42:23,281 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 45 [2024-10-13 23:42:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:23,282 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2024-10-13 23:42:23,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:23,282 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2024-10-13 23:42:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-13 23:42:23,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:23,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:42:23,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:42:23,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:23,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1124660270, now seen corresponding path program 1 times [2024-10-13 23:42:23,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456436826] [2024-10-13 23:42:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:23,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:42:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456436826] [2024-10-13 23:42:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456436826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:23,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:23,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:42:23,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146898503] [2024-10-13 23:42:23,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:23,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:23,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:23,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:23,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:23,505 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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-13 23:42:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:24,092 INFO L93 Difference]: Finished difference Result 1073 states and 1632 transitions. [2024-10-13 23:42:24,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:24,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-10-13 23:42:24,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:24,097 INFO L225 Difference]: With dead ends: 1073 [2024-10-13 23:42:24,097 INFO L226 Difference]: Without dead ends: 715 [2024-10-13 23:42:24,101 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-13 23:42:24,102 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:24,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 93 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:42:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-13 23:42:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-13 23:42:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.354341736694678) internal successors, (967), 714 states have internal predecessors, (967), 0 states have call successors, (0), 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-13 23:42:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2024-10-13 23:42:24,121 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 120 [2024-10-13 23:42:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:24,121 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2024-10-13 23:42:24,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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-13 23:42:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2024-10-13 23:42:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-13 23:42:24,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:24,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:42:24,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:42:24,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:24,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash 886483144, now seen corresponding path program 1 times [2024-10-13 23:42:24,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:24,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9313623] [2024-10-13 23:42:24,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:24,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:42:24,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:24,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9313623] [2024-10-13 23:42:24,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9313623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:24,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:24,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:24,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959123439] [2024-10-13 23:42:24,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:24,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:42:24,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:24,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:42:24,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:24,396 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-13 23:42:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:25,125 INFO L93 Difference]: Finished difference Result 1963 states and 2569 transitions. [2024-10-13 23:42:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:42:25,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-10-13 23:42:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:25,132 INFO L225 Difference]: With dead ends: 1963 [2024-10-13 23:42:25,132 INFO L226 Difference]: Without dead ends: 1249 [2024-10-13 23:42:25,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:25,136 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:25,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 119 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:42:25,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-13 23:42:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2024-10-13 23:42:25,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.236378205128205) internal successors, (1543), 1248 states have internal predecessors, (1543), 0 states have call successors, (0), 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-13 23:42:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1543 transitions. [2024-10-13 23:42:25,174 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1543 transitions. Word has length 124 [2024-10-13 23:42:25,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:25,174 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1543 transitions. [2024-10-13 23:42:25,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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-13 23:42:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1543 transitions. [2024-10-13 23:42:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-13 23:42:25,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:25,181 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:42:25,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:42:25,181 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:25,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:25,182 INFO L85 PathProgramCache]: Analyzing trace with hash 43990108, now seen corresponding path program 1 times [2024-10-13 23:42:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224337193] [2024-10-13 23:42:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:25,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:25,381 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 23:42:25,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:25,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224337193] [2024-10-13 23:42:25,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224337193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:25,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:25,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:25,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302348358] [2024-10-13 23:42:25,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:25,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:42:25,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:25,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:42:25,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:25,387 INFO L87 Difference]: Start difference. First operand 1249 states and 1543 transitions. Second operand has 4 states, 4 states have (on average 47.5) 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-13 23:42:25,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:25,984 INFO L93 Difference]: Finished difference Result 2704 states and 3352 transitions. [2024-10-13 23:42:25,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:42:25,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) 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 204 [2024-10-13 23:42:25,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:25,989 INFO L225 Difference]: With dead ends: 2704 [2024-10-13 23:42:25,990 INFO L226 Difference]: Without dead ends: 1605 [2024-10-13 23:42:25,991 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-13 23:42:25,992 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 102 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:25,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 117 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:42:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-10-13 23:42:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2024-10-13 23:42:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1221945137157108) internal successors, (1800), 1604 states have internal predecessors, (1800), 0 states have call successors, (0), 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-13 23:42:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1800 transitions. [2024-10-13 23:42:26,047 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1800 transitions. Word has length 204 [2024-10-13 23:42:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:26,047 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1800 transitions. [2024-10-13 23:42:26,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) 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-13 23:42:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1800 transitions. [2024-10-13 23:42:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-10-13 23:42:26,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:26,050 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:26,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:42:26,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:26,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2119735221, now seen corresponding path program 1 times [2024-10-13 23:42:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:26,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306823488] [2024-10-13 23:42:26,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:26,390 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 179 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-13 23:42:26,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:26,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306823488] [2024-10-13 23:42:26,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306823488] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:26,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78052211] [2024-10-13 23:42:26,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:26,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:26,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:26,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:26,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:42:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:26,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:26,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-13 23:42:26,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:26,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78052211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:26,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:26,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-13 23:42:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791515258] [2024-10-13 23:42:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:26,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:26,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:26,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:26,794 INFO L87 Difference]: Start difference. First operand 1605 states and 1800 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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-13 23:42:27,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:27,232 INFO L93 Difference]: Finished difference Result 3387 states and 3900 transitions. [2024-10-13 23:42:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:27,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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 331 [2024-10-13 23:42:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:27,242 INFO L225 Difference]: With dead ends: 3387 [2024-10-13 23:42:27,243 INFO L226 Difference]: Without dead ends: 1961 [2024-10-13 23:42:27,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:27,246 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:27,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 45 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-10-13 23:42:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2024-10-13 23:42:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.131874298540965) internal successors, (2017), 1782 states have internal predecessors, (2017), 0 states have call successors, (0), 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-13 23:42:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2017 transitions. [2024-10-13 23:42:27,270 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2017 transitions. Word has length 331 [2024-10-13 23:42:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:27,271 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2017 transitions. [2024-10-13 23:42:27,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 0 states have call successors, (0), 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-13 23:42:27,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2017 transitions. [2024-10-13 23:42:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-10-13 23:42:27,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:27,275 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:27,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:42:27,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 23:42:27,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:27,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash 284789547, now seen corresponding path program 1 times [2024-10-13 23:42:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:27,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587999342] [2024-10-13 23:42:27,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:27,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-13 23:42:27,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:27,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587999342] [2024-10-13 23:42:27,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587999342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:27,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:27,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:27,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663825588] [2024-10-13 23:42:27,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:27,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:27,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:27,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:27,788 INFO L87 Difference]: Start difference. First operand 1783 states and 2017 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-13 23:42:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:28,194 INFO L93 Difference]: Finished difference Result 3743 states and 4281 transitions. [2024-10-13 23:42:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:28,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 335 [2024-10-13 23:42:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:28,200 INFO L225 Difference]: With dead ends: 3743 [2024-10-13 23:42:28,200 INFO L226 Difference]: Without dead ends: 2139 [2024-10-13 23:42:28,202 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-13 23:42:28,202 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:28,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 75 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-13 23:42:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2024-10-13 23:42:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.128157156220767) internal successors, (2412), 2138 states have internal predecessors, (2412), 0 states have call successors, (0), 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-13 23:42:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2412 transitions. [2024-10-13 23:42:28,229 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2412 transitions. Word has length 335 [2024-10-13 23:42:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:28,229 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2412 transitions. [2024-10-13 23:42:28,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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-13 23:42:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2412 transitions. [2024-10-13 23:42:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2024-10-13 23:42:28,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:28,233 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2024-10-13 23:42:28,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:42:28,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:28,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:28,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1341655257, now seen corresponding path program 1 times [2024-10-13 23:42:28,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:28,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132108826] [2024-10-13 23:42:28,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:28,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:28,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:28,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132108826] [2024-10-13 23:42:28,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132108826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:28,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:28,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285906437] [2024-10-13 23:42:28,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:28,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:28,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:28,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:28,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:28,400 INFO L87 Difference]: Start difference. First operand 2139 states and 2412 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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-13 23:42:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:28,844 INFO L93 Difference]: Finished difference Result 4633 states and 5294 transitions. [2024-10-13 23:42:28,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:28,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 362 [2024-10-13 23:42:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:28,852 INFO L225 Difference]: With dead ends: 4633 [2024-10-13 23:42:28,852 INFO L226 Difference]: Without dead ends: 2673 [2024-10-13 23:42:28,854 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-13 23:42:28,855 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:28,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 255 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-13 23:42:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2673. [2024-10-13 23:42:28,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.1208832335329342) internal successors, (2995), 2672 states have internal predecessors, (2995), 0 states have call successors, (0), 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-13 23:42:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2995 transitions. [2024-10-13 23:42:28,887 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2995 transitions. Word has length 362 [2024-10-13 23:42:28,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:28,887 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2995 transitions. [2024-10-13 23:42:28,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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-13 23:42:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2995 transitions. [2024-10-13 23:42:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-10-13 23:42:28,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:28,891 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:28,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:42:28,891 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:28,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:28,892 INFO L85 PathProgramCache]: Analyzing trace with hash 872818326, now seen corresponding path program 1 times [2024-10-13 23:42:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:28,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423431720] [2024-10-13 23:42:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:29,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:29,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423431720] [2024-10-13 23:42:29,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423431720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:29,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:29,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840495323] [2024-10-13 23:42:29,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:29,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:29,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:29,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:29,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:29,056 INFO L87 Difference]: Start difference. First operand 2673 states and 2995 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-13 23:42:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:29,480 INFO L93 Difference]: Finished difference Result 5523 states and 6280 transitions. [2024-10-13 23:42:29,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:29,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 369 [2024-10-13 23:42:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:29,488 INFO L225 Difference]: With dead ends: 5523 [2024-10-13 23:42:29,488 INFO L226 Difference]: Without dead ends: 3029 [2024-10-13 23:42:29,491 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-13 23:42:29,491 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 138 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:29,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 222 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2024-10-13 23:42:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 2851. [2024-10-13 23:42:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 1.1417543859649122) internal successors, (3254), 2850 states have internal predecessors, (3254), 0 states have call successors, (0), 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-13 23:42:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3254 transitions. [2024-10-13 23:42:29,524 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3254 transitions. Word has length 369 [2024-10-13 23:42:29,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:29,524 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 3254 transitions. [2024-10-13 23:42:29,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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-13 23:42:29,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3254 transitions. [2024-10-13 23:42:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2024-10-13 23:42:29,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:29,528 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:29,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:42:29,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:29,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1406424554, now seen corresponding path program 1 times [2024-10-13 23:42:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:29,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59255040] [2024-10-13 23:42:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:29,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:29,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59255040] [2024-10-13 23:42:29,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59255040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:29,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:29,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:29,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621579243] [2024-10-13 23:42:29,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:29,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:29,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:29,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:29,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:29,681 INFO L87 Difference]: Start difference. First operand 2851 states and 3254 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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-13 23:42:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:30,123 INFO L93 Difference]: Finished difference Result 6591 states and 7589 transitions. [2024-10-13 23:42:30,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:30,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 441 [2024-10-13 23:42:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:30,132 INFO L225 Difference]: With dead ends: 6591 [2024-10-13 23:42:30,132 INFO L226 Difference]: Without dead ends: 3919 [2024-10-13 23:42:30,135 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-13 23:42:30,135 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 119 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:30,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 56 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:30,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-13 23:42:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3919. [2024-10-13 23:42:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.1375701888718734) internal successors, (4457), 3918 states have internal predecessors, (4457), 0 states have call successors, (0), 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-13 23:42:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4457 transitions. [2024-10-13 23:42:30,185 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4457 transitions. Word has length 441 [2024-10-13 23:42:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:30,185 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 4457 transitions. [2024-10-13 23:42:30,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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-13 23:42:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4457 transitions. [2024-10-13 23:42:30,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2024-10-13 23:42:30,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:30,189 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, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:30,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:42:30,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:30,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1739476626, now seen corresponding path program 1 times [2024-10-13 23:42:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:30,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903713142] [2024-10-13 23:42:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:30,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1059 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-10-13 23:42:30,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:30,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903713142] [2024-10-13 23:42:30,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903713142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:30,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:30,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:30,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153776007] [2024-10-13 23:42:30,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:30,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:42:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:30,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:42:30,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:30,539 INFO L87 Difference]: Start difference. First operand 3919 states and 4457 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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-13 23:42:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:31,035 INFO L93 Difference]: Finished difference Result 7895 states and 8988 transitions. [2024-10-13 23:42:31,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:42:31,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 516 [2024-10-13 23:42:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:31,046 INFO L225 Difference]: With dead ends: 7895 [2024-10-13 23:42:31,046 INFO L226 Difference]: Without dead ends: 4097 [2024-10-13 23:42:31,049 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-13 23:42:31,050 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:31,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:42:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2024-10-13 23:42:31,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 3919. [2024-10-13 23:42:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.0941807044410414) internal successors, (4287), 3918 states have internal predecessors, (4287), 0 states have call successors, (0), 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-13 23:42:31,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4287 transitions. [2024-10-13 23:42:31,096 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4287 transitions. Word has length 516 [2024-10-13 23:42:31,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:31,097 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 4287 transitions. [2024-10-13 23:42:31,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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-13 23:42:31,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4287 transitions. [2024-10-13 23:42:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2024-10-13 23:42:31,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:31,100 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, 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, 4, 4, 4, 4, 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] [2024-10-13 23:42:31,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:42:31,100 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:31,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1807296973, now seen corresponding path program 1 times [2024-10-13 23:42:31,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139851370] [2024-10-13 23:42:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2024-10-13 23:42:31,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139851370] [2024-10-13 23:42:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139851370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080755258] [2024-10-13 23:42:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:31,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:31,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:31,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:31,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:42:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:31,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:31,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2024-10-13 23:42:32,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:32,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080755258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:32,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-13 23:42:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068139646] [2024-10-13 23:42:32,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:32,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:32,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:32,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:32,147 INFO L87 Difference]: Start difference. First operand 3919 states and 4287 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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-13 23:42:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:32,504 INFO L93 Difference]: Finished difference Result 5167 states and 5635 transitions. [2024-10-13 23:42:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:32,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 524 [2024-10-13 23:42:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:32,514 INFO L225 Difference]: With dead ends: 5167 [2024-10-13 23:42:32,514 INFO L226 Difference]: Without dead ends: 5165 [2024-10-13 23:42:32,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:32,515 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:32,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 9 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:42:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2024-10-13 23:42:32,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 4097. [2024-10-13 23:42:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.095703125) internal successors, (4488), 4096 states have internal predecessors, (4488), 0 states have call successors, (0), 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-13 23:42:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4488 transitions. [2024-10-13 23:42:32,554 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4488 transitions. Word has length 524 [2024-10-13 23:42:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:32,554 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4488 transitions. [2024-10-13 23:42:32,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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-13 23:42:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4488 transitions. [2024-10-13 23:42:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2024-10-13 23:42:32,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:32,558 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, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:32,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:42:32,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 23:42:32,759 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:32,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:32,760 INFO L85 PathProgramCache]: Analyzing trace with hash 295184739, now seen corresponding path program 1 times [2024-10-13 23:42:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:32,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764638578] [2024-10-13 23:42:32,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:32,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 883 proven. 11 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-10-13 23:42:33,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:33,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764638578] [2024-10-13 23:42:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764638578] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:33,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302945294] [2024-10-13 23:42:33,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:33,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:33,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:33,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:33,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:42:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:33,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:33,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 1033 trivial. 0 not checked. [2024-10-13 23:42:33,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:33,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302945294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:33,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:33,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:42:33,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65482509] [2024-10-13 23:42:33,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:33,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:33,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:33,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:33,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:33,536 INFO L87 Difference]: Start difference. First operand 4097 states and 4488 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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-13 23:42:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:33,984 INFO L93 Difference]: Finished difference Result 5701 states and 6209 transitions. [2024-10-13 23:42:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:33,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 571 [2024-10-13 23:42:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:33,997 INFO L225 Difference]: With dead ends: 5701 [2024-10-13 23:42:33,997 INFO L226 Difference]: Without dead ends: 5699 [2024-10-13 23:42:33,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:33,999 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 155 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:33,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 9 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:34,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2024-10-13 23:42:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 4097. [2024-10-13 23:42:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.095703125) internal successors, (4488), 4096 states have internal predecessors, (4488), 0 states have call successors, (0), 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-13 23:42:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4488 transitions. [2024-10-13 23:42:34,062 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4488 transitions. Word has length 571 [2024-10-13 23:42:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:34,062 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4488 transitions. [2024-10-13 23:42:34,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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-13 23:42:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4488 transitions. [2024-10-13 23:42:34,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2024-10-13 23:42:34,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:34,069 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, 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, 3, 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] [2024-10-13 23:42:34,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 23:42:34,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:34,270 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:34,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2120236365, now seen corresponding path program 1 times [2024-10-13 23:42:34,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:34,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297857609] [2024-10-13 23:42:34,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:34,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:34,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 848 proven. 2 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-10-13 23:42:34,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:34,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297857609] [2024-10-13 23:42:34,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297857609] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:34,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129216939] [2024-10-13 23:42:34,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:34,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:34,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:34,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:34,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 23:42:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:34,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:34,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1208 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 989 trivial. 0 not checked. [2024-10-13 23:42:34,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129216939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:34,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:34,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-13 23:42:34,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326147347] [2024-10-13 23:42:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:34,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:34,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:34,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:34,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:42:34,955 INFO L87 Difference]: Start difference. First operand 4097 states and 4488 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-13 23:42:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:35,378 INFO L93 Difference]: Finished difference Result 9081 states and 9997 transitions. [2024-10-13 23:42:35,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:35,378 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 578 [2024-10-13 23:42:35,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:35,379 INFO L225 Difference]: With dead ends: 9081 [2024-10-13 23:42:35,379 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:42:35,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:42:35,386 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 139 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:35,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 46 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:42:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:42:35,387 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-13 23:42:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:42:35,387 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 578 [2024-10-13 23:42:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:35,388 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:42:35,391 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-13 23:42:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:42:35,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:42:35,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:42:35,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 23:42:35,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:35,598 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:35,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:42:35,943 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:42:35,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:42:35 BoogieIcfgContainer [2024-10-13 23:42:35,957 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:42:35,957 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:42:35,957 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:42:35,957 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:42:35,958 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:42:21" (3/4) ... [2024-10-13 23:42:35,959 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:42:35,971 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 23:42:35,972 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:42:35,973 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:42:35,974 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:42:36,179 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:42:36,183 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:42:36,183 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:42:36,184 INFO L158 Benchmark]: Toolchain (without parser) took 16413.15ms. Allocated memory was 184.5MB in the beginning and 610.3MB in the end (delta: 425.7MB). Free memory was 112.8MB in the beginning and 561.4MB in the end (delta: -448.7MB). Peak memory consumption was 332.4MB. Max. memory is 16.1GB. [2024-10-13 23:42:36,184 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:42:36,184 INFO L158 Benchmark]: CACSL2BoogieTranslator took 680.54ms. Allocated memory is still 184.5MB. Free memory was 112.5MB in the beginning and 141.5MB in the end (delta: -29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 23:42:36,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.67ms. Allocated memory is still 184.5MB. Free memory was 141.5MB in the beginning and 131.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 23:42:36,185 INFO L158 Benchmark]: Boogie Preprocessor took 94.85ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 118.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 23:42:36,185 INFO L158 Benchmark]: RCFGBuilder took 1130.17ms. Allocated memory is still 184.5MB. Free memory was 118.5MB in the beginning and 88.7MB in the end (delta: 29.8MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. [2024-10-13 23:42:36,185 INFO L158 Benchmark]: TraceAbstraction took 14167.46ms. Allocated memory was 184.5MB in the beginning and 610.3MB in the end (delta: 425.7MB). Free memory was 87.6MB in the beginning and 215.9MB in the end (delta: -128.2MB). Peak memory consumption was 296.5MB. Max. memory is 16.1GB. [2024-10-13 23:42:36,186 INFO L158 Benchmark]: Witness Printer took 226.26ms. Allocated memory is still 610.3MB. Free memory was 215.9MB in the beginning and 561.4MB in the end (delta: -345.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-10-13 23:42:36,189 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.13ms. Allocated memory is still 184.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 680.54ms. Allocated memory is still 184.5MB. Free memory was 112.5MB in the beginning and 141.5MB in the end (delta: -29.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.67ms. Allocated memory is still 184.5MB. Free memory was 141.5MB in the beginning and 131.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.85ms. Allocated memory is still 184.5MB. Free memory was 131.0MB in the beginning and 118.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1130.17ms. Allocated memory is still 184.5MB. Free memory was 118.5MB in the beginning and 88.7MB in the end (delta: 29.8MB). Peak memory consumption was 73.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14167.46ms. Allocated memory was 184.5MB in the beginning and 610.3MB in the end (delta: 425.7MB). Free memory was 87.6MB in the beginning and 215.9MB in the end (delta: -128.2MB). Peak memory consumption was 296.5MB. Max. memory is 16.1GB. * Witness Printer took 226.26ms. Allocated memory is still 610.3MB. Free memory was 215.9MB in the beginning and 561.4MB in the end (delta: -345.6MB). Peak memory consumption was 8.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: 152]: 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, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.7s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1827 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1827 mSDsluCounter, 1406 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 879 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6883 IncrementalHoareTripleChecker+Invalid, 7762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 879 mSolverCounterUnsat, 1342 mSDtfsCounter, 6883 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2044 GetRequests, 2015 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4097occurred in iteration=12, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 3204 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 6569 NumberOfCodeBlocks, 6569 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 6551 ConstructedInterpolants, 0 QuantifiedInterpolants, 22334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2560 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 10272/10608 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: 890]: Loop Invariant Derived loop invariant: ((((((7 <= a15) && (a24 == 1)) || ((9 <= a21) && (a24 == 1))) || (((a15 <= 8) && (a21 <= 7)) && (((long long) 49 + a12) <= 0))) || ((a12 <= 80) && (a24 == 1))) || ((a24 == 1) && (a21 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:42:36,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE