./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label59.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 c3365f1635b74f6a53afd889ed9f5ab40e7b8a98b6d57619b7925d1a2f204728 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:48:07,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:48:07,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:48:07,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:48:07,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:48:07,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:48:07,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:48:07,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:48:07,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:48:07,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:48:07,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:48:07,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:48:07,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:48:07,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:48:07,867 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:48:07,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:48:07,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:48:07,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:48:07,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:48:07,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:48:07,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:48:07,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:48:07,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:48:07,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:48:07,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:48:07,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:48:07,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:48:07,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:48:07,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:48:07,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:48:07,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:48:07,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:48:07,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:48:07,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:48:07,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:48:07,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:48:07,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:48:07,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:48:07,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:48:07,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:48:07,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:48:07,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:48:07,873 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 -> c3365f1635b74f6a53afd889ed9f5ab40e7b8a98b6d57619b7925d1a2f204728 [2024-11-11 16:48:08,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:48:08,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:48:08,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:48:08,095 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:48:08,095 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:48:08,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label59.c [2024-11-11 16:48:09,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:48:09,530 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:48:09,530 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label59.c [2024-11-11 16:48:09,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed750bdf/8630a1d346384f178ff33eaa90c126af/FLAG1891f46b7 [2024-11-11 16:48:09,556 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aed750bdf/8630a1d346384f178ff33eaa90c126af [2024-11-11 16:48:09,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:48:09,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:48:09,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:48:09,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:48:09,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:48:09,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:09,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da3a1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09, skipping insertion in model container [2024-11-11 16:48:09,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:09,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:48:09,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label59.c[7385,7398] [2024-11-11 16:48:09,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:48:09,890 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:48:09,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label59.c[7385,7398] [2024-11-11 16:48:09,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:48:09,980 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:48:09,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09 WrapperNode [2024-11-11 16:48:09,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:48:09,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:48:09,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:48:09,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:48:09,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,092 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-11-11 16:48:10,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:48:10,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:48:10,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:48:10,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:48:10,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,144 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:48:10,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:48:10,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:48:10,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:48:10,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:48:10,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (1/1) ... [2024-11-11 16:48:10,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:48:10,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:10,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:48:10,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:48:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:48:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:48:10,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:48:10,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:48:10,318 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:48:10,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:48:11,090 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-11 16:48:11,090 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:48:11,104 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:48:11,106 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:48:11,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:11 BoogieIcfgContainer [2024-11-11 16:48:11,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:48:11,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:48:11,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:48:11,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:48:11,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:48:09" (1/3) ... [2024-11-11 16:48:11,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1279d8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:48:11, skipping insertion in model container [2024-11-11 16:48:11,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:09" (2/3) ... [2024-11-11 16:48:11,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1279d8f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:48:11, skipping insertion in model container [2024-11-11 16:48:11,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:11" (3/3) ... [2024-11-11 16:48:11,113 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label59.c [2024-11-11 16:48:11,125 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:48:11,125 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:48:11,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:48:11,187 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;@6613f5f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:48:11,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:48:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 16:48:11,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:11,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:11,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:11,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:11,200 INFO L85 PathProgramCache]: Analyzing trace with hash 962891993, now seen corresponding path program 1 times [2024-11-11 16:48:11,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:11,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150298170] [2024-11-11 16:48:11,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:11,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:11,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:11,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150298170] [2024-11-11 16:48:11,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150298170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:11,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:11,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:48:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059030888] [2024-11-11 16:48:11,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:11,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:11,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:11,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:11,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:11,596 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 0 states have call successors, (0), 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 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:12,212 INFO L93 Difference]: Finished difference Result 567 states and 981 transitions. [2024-11-11 16:48:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:12,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-11-11 16:48:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:12,222 INFO L225 Difference]: With dead ends: 567 [2024-11-11 16:48:12,222 INFO L226 Difference]: Without dead ends: 282 [2024-11-11 16:48:12,225 INFO L434 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-11-11 16:48:12,227 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:12,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 32 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-11 16:48:12,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-11 16:48:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2024-11-11 16:48:12,269 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 65 [2024-11-11 16:48:12,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:12,269 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2024-11-11 16:48:12,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:12,270 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2024-11-11 16:48:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 16:48:12,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:12,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:12,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:48:12,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:12,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash -2138327860, now seen corresponding path program 1 times [2024-11-11 16:48:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:12,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380867172] [2024-11-11 16:48:12,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:12,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:12,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380867172] [2024-11-11 16:48:12,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380867172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:12,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:12,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:12,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924583752] [2024-11-11 16:48:12,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:12,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:12,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:12,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:12,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:12,511 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:12,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:12,891 INFO L93 Difference]: Finished difference Result 840 states and 1291 transitions. [2024-11-11 16:48:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:12,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-11-11 16:48:12,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:12,894 INFO L225 Difference]: With dead ends: 840 [2024-11-11 16:48:12,894 INFO L226 Difference]: Without dead ends: 560 [2024-11-11 16:48:12,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:12,897 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 77 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:12,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 226 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:48:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-11 16:48:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-11 16:48:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3059033989266546) internal successors, (730), 559 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 730 transitions. [2024-11-11 16:48:12,925 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 730 transitions. Word has length 131 [2024-11-11 16:48:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:12,925 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 730 transitions. [2024-11-11 16:48:12,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 730 transitions. [2024-11-11 16:48:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-11 16:48:12,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:12,931 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:12,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:48:12,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:12,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:12,932 INFO L85 PathProgramCache]: Analyzing trace with hash -675083717, now seen corresponding path program 1 times [2024-11-11 16:48:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:12,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717275661] [2024-11-11 16:48:12,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:13,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:13,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717275661] [2024-11-11 16:48:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717275661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:13,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:13,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:48:13,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111045555] [2024-11-11 16:48:13,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:13,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:13,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:13,163 INFO L87 Difference]: Start difference. First operand 560 states and 730 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:13,520 INFO L93 Difference]: Finished difference Result 1257 states and 1672 transitions. [2024-11-11 16:48:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:13,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-11-11 16:48:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:13,522 INFO L225 Difference]: With dead ends: 1257 [2024-11-11 16:48:13,522 INFO L226 Difference]: Without dead ends: 699 [2024-11-11 16:48:13,523 INFO L434 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-11-11 16:48:13,524 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 69 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:13,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:48:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-11 16:48:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-11 16:48:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2951289398280803) internal successors, (904), 698 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 904 transitions. [2024-11-11 16:48:13,536 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 904 transitions. Word has length 138 [2024-11-11 16:48:13,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:13,537 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 904 transitions. [2024-11-11 16:48:13,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:13,537 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 904 transitions. [2024-11-11 16:48:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-11 16:48:13,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:13,539 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:13,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:48:13,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:13,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:13,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1097584517, now seen corresponding path program 1 times [2024-11-11 16:48:13,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:13,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615351244] [2024-11-11 16:48:13,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:13,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:13,661 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:13,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:13,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615351244] [2024-11-11 16:48:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615351244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:13,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:13,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:48:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965226250] [2024-11-11 16:48:13,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:13,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:13,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:13,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:13,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:13,666 INFO L87 Difference]: Start difference. First operand 699 states and 904 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:14,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:14,060 INFO L93 Difference]: Finished difference Result 1674 states and 2235 transitions. [2024-11-11 16:48:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:14,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2024-11-11 16:48:14,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:14,063 INFO L225 Difference]: With dead ends: 1674 [2024-11-11 16:48:14,063 INFO L226 Difference]: Without dead ends: 977 [2024-11-11 16:48:14,064 INFO L434 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-11-11 16:48:14,065 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 70 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:14,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 75 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:48:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-11 16:48:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-11 16:48:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2274590163934427) internal successors, (1198), 976 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1198 transitions. [2024-11-11 16:48:14,078 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1198 transitions. Word has length 142 [2024-11-11 16:48:14,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:14,078 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1198 transitions. [2024-11-11 16:48:14,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1198 transitions. [2024-11-11 16:48:14,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-11 16:48:14,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:14,080 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:14,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:48:14,081 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:14,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:14,081 INFO L85 PathProgramCache]: Analyzing trace with hash -466379074, now seen corresponding path program 1 times [2024-11-11 16:48:14,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:14,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138218013] [2024-11-11 16:48:14,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:14,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:14,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:14,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138218013] [2024-11-11 16:48:14,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138218013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:14,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:14,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:14,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371962146] [2024-11-11 16:48:14,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:14,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:48:14,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:14,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:48:14,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:14,302 INFO L87 Difference]: Start difference. First operand 977 states and 1198 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:14,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:14,717 INFO L93 Difference]: Finished difference Result 1813 states and 2245 transitions. [2024-11-11 16:48:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:48:14,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2024-11-11 16:48:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:14,720 INFO L225 Difference]: With dead ends: 1813 [2024-11-11 16:48:14,720 INFO L226 Difference]: Without dead ends: 977 [2024-11-11 16:48:14,721 INFO L434 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-11-11 16:48:14,721 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 127 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:14,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:48:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-11 16:48:14,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-11 16:48:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2223360655737705) internal successors, (1193), 976 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1193 transitions. [2024-11-11 16:48:14,733 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1193 transitions. Word has length 152 [2024-11-11 16:48:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:14,734 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1193 transitions. [2024-11-11 16:48:14,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1193 transitions. [2024-11-11 16:48:14,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-11 16:48:14,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:14,736 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:14,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:48:14,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:14,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash -354141657, now seen corresponding path program 1 times [2024-11-11 16:48:14,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:14,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826856506] [2024-11-11 16:48:14,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:14,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 125 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:14,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:14,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826856506] [2024-11-11 16:48:14,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826856506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:48:14,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453595232] [2024-11-11 16:48:14,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:14,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:48:14,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:14,988 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-11-11 16:48:14,989 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-11-11 16:48:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:15,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 16:48:15,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:48:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 127 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:15,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:48:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 127 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453595232] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:48:15,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:48:15,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-11 16:48:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580112722] [2024-11-11 16:48:15,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:48:15,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 16:48:15,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:15,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 16:48:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-11 16:48:15,592 INFO L87 Difference]: Start difference. First operand 977 states and 1193 transitions. Second operand has 9 states, 9 states have (on average 63.44444444444444) internal successors, (571), 9 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:17,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:17,900 INFO L93 Difference]: Finished difference Result 4037 states and 5311 transitions. [2024-11-11 16:48:17,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 16:48:17,901 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 63.44444444444444) internal successors, (571), 9 states have internal predecessors, (571), 0 states have call successors, (0), 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 213 [2024-11-11 16:48:17,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:17,908 INFO L225 Difference]: With dead ends: 4037 [2024-11-11 16:48:17,908 INFO L226 Difference]: Without dead ends: 3201 [2024-11-11 16:48:17,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-11 16:48:17,910 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1262 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 2306 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 3224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 2306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:17,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 48 Invalid, 3224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 2306 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 16:48:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2024-11-11 16:48:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 2089. [2024-11-11 16:48:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.26772030651341) internal successors, (2647), 2088 states have internal predecessors, (2647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2647 transitions. [2024-11-11 16:48:17,961 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2647 transitions. Word has length 213 [2024-11-11 16:48:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:17,961 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2647 transitions. [2024-11-11 16:48:17,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 63.44444444444444) internal successors, (571), 9 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:17,962 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2647 transitions. [2024-11-11 16:48:17,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-11 16:48:17,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:17,964 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:17,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:48:18,164 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-11-11 16:48:18,165 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:18,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:18,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1412343006, now seen corresponding path program 1 times [2024-11-11 16:48:18,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:18,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361521709] [2024-11-11 16:48:18,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:18,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 16:48:18,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:18,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361521709] [2024-11-11 16:48:18,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361521709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:18,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:18,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:48:18,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315325737] [2024-11-11 16:48:18,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:18,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 16:48:18,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:18,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 16:48:18,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:48:18,420 INFO L87 Difference]: Start difference. First operand 2089 states and 2647 transitions. Second operand has 7 states, 7 states have (on average 30.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:18,813 INFO L93 Difference]: Finished difference Result 4092 states and 5203 transitions. [2024-11-11 16:48:18,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 16:48:18,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2024-11-11 16:48:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:18,818 INFO L225 Difference]: With dead ends: 4092 [2024-11-11 16:48:18,818 INFO L226 Difference]: Without dead ends: 2089 [2024-11-11 16:48:18,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:48:18,820 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:18,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:48:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-11 16:48:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2024-11-11 16:48:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.2634099616858236) internal successors, (2638), 2088 states have internal predecessors, (2638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2638 transitions. [2024-11-11 16:48:18,845 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2638 transitions. Word has length 217 [2024-11-11 16:48:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:18,846 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2638 transitions. [2024-11-11 16:48:18,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2638 transitions. [2024-11-11 16:48:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-11 16:48:18,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:18,849 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:48:18,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:48:18,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1299344947, now seen corresponding path program 1 times [2024-11-11 16:48:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703038521] [2024-11-11 16:48:18,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:18,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-11 16:48:18,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703038521] [2024-11-11 16:48:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703038521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:18,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749448832] [2024-11-11 16:48:18,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:18,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:18,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:18,993 INFO L87 Difference]: Start difference. First operand 2089 states and 2638 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:19,350 INFO L93 Difference]: Finished difference Result 4037 states and 5131 transitions. [2024-11-11 16:48:19,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:19,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2024-11-11 16:48:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:19,357 INFO L225 Difference]: With dead ends: 4037 [2024-11-11 16:48:19,357 INFO L226 Difference]: Without dead ends: 2089 [2024-11-11 16:48:19,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:19,360 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 77 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:19,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 225 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:48:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-11 16:48:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2024-11-11 16:48:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.1992337164750957) internal successors, (2504), 2088 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2504 transitions. [2024-11-11 16:48:19,389 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2504 transitions. Word has length 259 [2024-11-11 16:48:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:19,389 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2504 transitions. [2024-11-11 16:48:19,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2504 transitions. [2024-11-11 16:48:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-11 16:48:19,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:19,392 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:19,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:48:19,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:19,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:19,393 INFO L85 PathProgramCache]: Analyzing trace with hash -883397783, now seen corresponding path program 1 times [2024-11-11 16:48:19,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:19,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423680764] [2024-11-11 16:48:19,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:19,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 125 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:48:19,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:19,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423680764] [2024-11-11 16:48:19,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423680764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:48:19,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807392257] [2024-11-11 16:48:19,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:19,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:48:19,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:19,708 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-11-11 16:48:19,716 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-11-11 16:48:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:19,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:48:19,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:48:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-11 16:48:19,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:48:19,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807392257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:19,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:48:19,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-11 16:48:19,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029182744] [2024-11-11 16:48:19,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:19,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:19,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:19,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:19,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:48:20,000 INFO L87 Difference]: Start difference. First operand 2089 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:20,321 INFO L93 Difference]: Finished difference Result 4732 states and 5731 transitions. [2024-11-11 16:48:20,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:20,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2024-11-11 16:48:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:20,329 INFO L225 Difference]: With dead ends: 4732 [2024-11-11 16:48:20,329 INFO L226 Difference]: Without dead ends: 2784 [2024-11-11 16:48:20,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:48:20,332 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 64 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:20,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:48:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2024-11-11 16:48:20,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2024-11-11 16:48:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2783 states have (on average 1.1595400646784046) internal successors, (3227), 2783 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 3227 transitions. [2024-11-11 16:48:20,366 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 3227 transitions. Word has length 266 [2024-11-11 16:48:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:20,367 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 3227 transitions. [2024-11-11 16:48:20,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 3227 transitions. [2024-11-11 16:48:20,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-11 16:48:20,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:20,370 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:20,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 16:48:20,574 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,SelfDestructingSolverStorable8 [2024-11-11 16:48:20,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:20,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash -574209587, now seen corresponding path program 1 times [2024-11-11 16:48:20,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:20,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710413909] [2024-11-11 16:48:20,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:20,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-11 16:48:20,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:20,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710413909] [2024-11-11 16:48:20,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710413909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:20,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:20,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:20,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465892665] [2024-11-11 16:48:20,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:20,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:20,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:20,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:20,716 INFO L87 Difference]: Start difference. First operand 2784 states and 3227 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:21,049 INFO L93 Difference]: Finished difference Result 5427 states and 6309 transitions. [2024-11-11 16:48:21,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:21,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 275 [2024-11-11 16:48:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:21,056 INFO L225 Difference]: With dead ends: 5427 [2024-11-11 16:48:21,056 INFO L226 Difference]: Without dead ends: 2784 [2024-11-11 16:48:21,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:21,059 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 83 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:21,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 200 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:48:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2024-11-11 16:48:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2506. [2024-11-11 16:48:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2505 states have (on average 1.1261477045908184) internal successors, (2821), 2505 states have internal predecessors, (2821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2821 transitions. [2024-11-11 16:48:21,088 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2821 transitions. Word has length 275 [2024-11-11 16:48:21,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:21,089 INFO L471 AbstractCegarLoop]: Abstraction has 2506 states and 2821 transitions. [2024-11-11 16:48:21,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2821 transitions. [2024-11-11 16:48:21,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-11 16:48:21,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:21,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:21,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:48:21,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:21,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1001154550, now seen corresponding path program 1 times [2024-11-11 16:48:21,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:21,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472018574] [2024-11-11 16:48:21,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:21,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 16:48:21,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472018574] [2024-11-11 16:48:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472018574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:21,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:21,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:21,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743027192] [2024-11-11 16:48:21,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:21,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:21,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:21,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:21,238 INFO L87 Difference]: Start difference. First operand 2506 states and 2821 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:21,569 INFO L93 Difference]: Finished difference Result 4732 states and 5353 transitions. [2024-11-11 16:48:21,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:21,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2024-11-11 16:48:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:21,575 INFO L225 Difference]: With dead ends: 4732 [2024-11-11 16:48:21,575 INFO L226 Difference]: Without dead ends: 2367 [2024-11-11 16:48:21,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:21,578 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 78 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:21,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 215 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:48:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2024-11-11 16:48:21,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2024-11-11 16:48:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 2366 states have (on average 1.095942519019442) internal successors, (2593), 2366 states have internal predecessors, (2593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2593 transitions. [2024-11-11 16:48:21,600 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2593 transitions. Word has length 281 [2024-11-11 16:48:21,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:21,601 INFO L471 AbstractCegarLoop]: Abstraction has 2367 states and 2593 transitions. [2024-11-11 16:48:21,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2593 transitions. [2024-11-11 16:48:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-11 16:48:21,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:21,606 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:21,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:48:21,606 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:21,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash 352328165, now seen corresponding path program 1 times [2024-11-11 16:48:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:21,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459990724] [2024-11-11 16:48:21,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:21,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:21,901 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 16:48:21,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:21,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459990724] [2024-11-11 16:48:21,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459990724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:21,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:21,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:48:21,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321994458] [2024-11-11 16:48:21,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:21,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:48:21,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:21,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:48:21,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:21,903 INFO L87 Difference]: Start difference. First operand 2367 states and 2593 transitions. Second operand has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:22,510 INFO L93 Difference]: Finished difference Result 5010 states and 5483 transitions. [2024-11-11 16:48:22,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:48:22,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 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 363 [2024-11-11 16:48:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:22,517 INFO L225 Difference]: With dead ends: 5010 [2024-11-11 16:48:22,517 INFO L226 Difference]: Without dead ends: 2784 [2024-11-11 16:48:22,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:48:22,519 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 151 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:22,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 17 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:48:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2024-11-11 16:48:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2228. [2024-11-11 16:48:22,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2227 states have (on average 1.0951953300404131) internal successors, (2439), 2227 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2439 transitions. [2024-11-11 16:48:22,552 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2439 transitions. Word has length 363 [2024-11-11 16:48:22,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:22,553 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 2439 transitions. [2024-11-11 16:48:22,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2439 transitions. [2024-11-11 16:48:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2024-11-11 16:48:22,557 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:22,558 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:22,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:48:22,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:22,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash -597199170, now seen corresponding path program 1 times [2024-11-11 16:48:22,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:22,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742155700] [2024-11-11 16:48:22,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:22,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-11 16:48:22,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:22,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742155700] [2024-11-11 16:48:22,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742155700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:22,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:48:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742961835] [2024-11-11 16:48:22,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:22,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:48:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:48:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:22,714 INFO L87 Difference]: Start difference. First operand 2228 states and 2439 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:23,011 INFO L93 Difference]: Finished difference Result 4315 states and 4733 transitions. [2024-11-11 16:48:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:48:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 373 [2024-11-11 16:48:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:23,017 INFO L225 Difference]: With dead ends: 4315 [2024-11-11 16:48:23,017 INFO L226 Difference]: Without dead ends: 2228 [2024-11-11 16:48:23,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:48:23,019 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 90 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:23,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 190 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:48:23,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2024-11-11 16:48:23,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2089. [2024-11-11 16:48:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.0756704980842913) internal successors, (2246), 2088 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2246 transitions. [2024-11-11 16:48:23,039 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2246 transitions. Word has length 373 [2024-11-11 16:48:23,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:23,039 INFO L471 AbstractCegarLoop]: Abstraction has 2089 states and 2246 transitions. [2024-11-11 16:48:23,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2246 transitions. [2024-11-11 16:48:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-11-11 16:48:23,043 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:23,043 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:23,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:48:23,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:23,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1789996429, now seen corresponding path program 1 times [2024-11-11 16:48:23,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:23,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665198380] [2024-11-11 16:48:23,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:48:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:48:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-11 16:48:23,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:48:23,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665198380] [2024-11-11 16:48:23,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665198380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:48:23,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:48:23,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 16:48:23,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828369780] [2024-11-11 16:48:23,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:48:23,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 16:48:23,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:48:23,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 16:48:23,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:48:23,383 INFO L87 Difference]: Start difference. First operand 2089 states and 2246 transitions. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 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-11-11 16:48:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:48:23,719 INFO L93 Difference]: Finished difference Result 3953 states and 4254 transitions. [2024-11-11 16:48:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 16:48:23,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 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 379 [2024-11-11 16:48:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:48:23,721 INFO L225 Difference]: With dead ends: 3953 [2024-11-11 16:48:23,721 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:48:23,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:48:23,724 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:48:23,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 19 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 16:48:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:48:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:48:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:48:23,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 379 [2024-11-11 16:48:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:48:23,725 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:48:23,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 6 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-11-11 16:48:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:48:23,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:48:23,728 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:48:23,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:48:23,730 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:48:23,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:48:23,881 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:48:23,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:48:23 BoogieIcfgContainer [2024-11-11 16:48:23,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:48:23,899 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:48:23,899 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:48:23,900 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:48:23,900 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:11" (3/4) ... [2024-11-11 16:48:23,901 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:48:23,911 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:48:23,912 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:48:23,912 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:48:23,913 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:48:24,029 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:48:24,031 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:48:24,031 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:48:24,032 INFO L158 Benchmark]: Toolchain (without parser) took 14472.31ms. Allocated memory was 144.7MB in the beginning and 360.7MB in the end (delta: 216.0MB). Free memory was 91.8MB in the beginning and 319.1MB in the end (delta: -227.4MB). Peak memory consumption was 202.3MB. Max. memory is 16.1GB. [2024-11-11 16:48:24,032 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 144.7MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:48:24,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.16ms. Allocated memory is still 144.7MB. Free memory was 91.8MB in the beginning and 62.0MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-11 16:48:24,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.08ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 62.0MB in the beginning and 164.6MB in the end (delta: -102.6MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-11-11 16:48:24,033 INFO L158 Benchmark]: Boogie Preprocessor took 106.50ms. Allocated memory is still 199.2MB. Free memory was 164.6MB in the beginning and 155.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 16:48:24,033 INFO L158 Benchmark]: RCFGBuilder took 905.85ms. Allocated memory is still 199.2MB. Free memory was 155.1MB in the beginning and 61.8MB in the end (delta: 93.3MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2024-11-11 16:48:24,033 INFO L158 Benchmark]: TraceAbstraction took 12790.89ms. Allocated memory was 199.2MB in the beginning and 360.7MB in the end (delta: 161.5MB). Free memory was 60.8MB in the beginning and 116.8MB in the end (delta: -56.0MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. [2024-11-11 16:48:24,033 INFO L158 Benchmark]: Witness Printer took 132.13ms. Allocated memory is still 360.7MB. Free memory was 116.8MB in the beginning and 319.1MB in the end (delta: -202.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 16:48:24,037 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.11ms. Allocated memory is still 144.7MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.16ms. Allocated memory is still 144.7MB. Free memory was 91.8MB in the beginning and 62.0MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.08ms. Allocated memory was 144.7MB in the beginning and 199.2MB in the end (delta: 54.5MB). Free memory was 62.0MB in the beginning and 164.6MB in the end (delta: -102.6MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.50ms. Allocated memory is still 199.2MB. Free memory was 164.6MB in the beginning and 155.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 905.85ms. Allocated memory is still 199.2MB. Free memory was 155.1MB in the beginning and 61.8MB in the end (delta: 93.3MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12790.89ms. Allocated memory was 199.2MB in the beginning and 360.7MB in the end (delta: 161.5MB). Free memory was 60.8MB in the beginning and 116.8MB in the end (delta: -56.0MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. * Witness Printer took 132.13ms. Allocated memory is still 360.7MB. Free memory was 116.8MB in the beginning and 319.1MB in the end (delta: -202.3MB). Peak memory consumption was 10.5MB. 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: 209]: 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2514 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2514 mSDsluCounter, 1443 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 1564 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8414 IncrementalHoareTripleChecker+Invalid, 9978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1564 mSolverCounterUnsat, 1322 mSDtfsCounter, 8414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 753 GetRequests, 711 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2784occurred in iteration=9, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 2085 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 3733 NumberOfCodeBlocks, 3733 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3929 ConstructedInterpolants, 0 QuantifiedInterpolants, 13937 SizeOfPredicates, 1 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 3159/3439 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: 592]: Loop Invariant Derived loop invariant: ((((((((((a10 == 1) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1))) || (((((a19 <= 9) && (a10 == 4)) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1)))) || (((((a10 <= 0) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1))) && (10 <= a19))) || (((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0)) && (0 <= ((long long) 600000 + a1)))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((((a10 == 0) && (14 == a4)) && (a12 == 0)) && (a19 == 6)) && (0 <= ((long long) 600000 + a1)))) || ((((0 <= ((long long) a1 + 12)) && (a10 <= 0)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:48:24,056 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