./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i --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/loop-zilu/benchmark23_conjunctive.i -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 c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:54:52,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:54:52,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:54:52,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:54:52,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:54:52,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:54:52,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:54:52,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:54:52,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:54:52,340 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:54:52,340 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:54:52,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:54:52,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:54:52,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:54:52,341 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:54:52,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:54:52,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:54:52,343 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:54:52,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:54:52,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:54:52,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:54:52,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:54:52,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:54:52,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:54:52,347 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:54:52,348 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:54:52,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:54:52,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:54:52,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:54:52,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:54:52,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:54:52,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:54:52,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:54:52,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:54:52,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:54:52,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:54:52,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:54:52,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:54:52,355 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:54:52,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:54:52,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:54:52,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:54:52,357 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 -> c8661b1e533413e4de6576c4feab251d05a672526bd5f59b260c6cb9f9c05939 [2024-11-11 19:54:52,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:54:52,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:54:52,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:54:52,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:54:52,686 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:54:52,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2024-11-11 19:54:54,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:54:54,416 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:54:54,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-zilu/benchmark23_conjunctive.i [2024-11-11 19:54:54,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c86c0bf6/4e93c6d86cc14155aa19aec3ed394540/FLAGd2f2ee924 [2024-11-11 19:54:54,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c86c0bf6/4e93c6d86cc14155aa19aec3ed394540 [2024-11-11 19:54:54,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:54:54,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:54:54,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:54:54,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:54:54,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:54:54,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4f72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54, skipping insertion in model container [2024-11-11 19:54:54,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:54:54,686 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/loop-zilu/benchmark23_conjunctive.i[873,886] [2024-11-11 19:54:54,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:54:54,712 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:54:54,726 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/loop-zilu/benchmark23_conjunctive.i[873,886] [2024-11-11 19:54:54,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:54:54,748 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:54:54,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54 WrapperNode [2024-11-11 19:54:54,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:54:54,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:54:54,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:54:54,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:54:54,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,782 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2024-11-11 19:54:54,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:54:54,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:54:54,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:54:54,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:54:54,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,796 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,811 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 19:54:54,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:54:54,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:54:54,827 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:54:54,827 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:54:54,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (1/1) ... [2024-11-11 19:54:54,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:54:54,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:54:54,862 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 19:54:54,865 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 19:54:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:54:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:54:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:54:54,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:54:54,979 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:54:54,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:54:55,092 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-11 19:54:55,092 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:54:55,107 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:54:55,107 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 19:54:55,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:54:55 BoogieIcfgContainer [2024-11-11 19:54:55,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:54:55,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:54:55,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:54:55,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:54:55,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:54:54" (1/3) ... [2024-11-11 19:54:55,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28380ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:54:55, skipping insertion in model container [2024-11-11 19:54:55,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:54:54" (2/3) ... [2024-11-11 19:54:55,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28380ae9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:54:55, skipping insertion in model container [2024-11-11 19:54:55,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:54:55" (3/3) ... [2024-11-11 19:54:55,119 INFO L112 eAbstractionObserver]: Analyzing ICFG benchmark23_conjunctive.i [2024-11-11 19:54:55,140 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:54:55,140 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:54:55,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:54:55,213 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;@335e83dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:54:55,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:54:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 19:54:55,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-11 19:54:55,223 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:54:55,224 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:54:55,225 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:54:55,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:54:55,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1807089479, now seen corresponding path program 1 times [2024-11-11 19:54:55,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:54:55,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779495146] [2024-11-11 19:54:55,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:54:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:54:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:54:55,397 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 19:54:55,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:54:55,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779495146] [2024-11-11 19:54:55,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779495146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:54:55,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:54:55,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:54:55,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467157647] [2024-11-11 19:54:55,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:54:55,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:54:55,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:54:55,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:54:55,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:54:55,454 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 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 19:54:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:54:55,467 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2024-11-11 19:54:55,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:54:55,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-11 19:54:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:54:55,479 INFO L225 Difference]: With dead ends: 20 [2024-11-11 19:54:55,479 INFO L226 Difference]: Without dead ends: 8 [2024-11-11 19:54:55,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:54:55,487 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:54:55,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:54:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-11-11 19:54:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-11-11 19:54:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:54:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-11-11 19:54:55,517 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2024-11-11 19:54:55,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:54:55,517 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-11-11 19:54:55,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 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 19:54:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-11-11 19:54:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-11 19:54:55,518 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:54:55,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:54:55,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:54:55,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:54:55,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:54:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1806970315, now seen corresponding path program 1 times [2024-11-11 19:54:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:54:55,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880957562] [2024-11-11 19:54:55,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:54:55,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:54:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:54:55,593 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 19:54:55,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:54:55,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880957562] [2024-11-11 19:54:55,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880957562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:54:55,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:54:55,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:54:55,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034838719] [2024-11-11 19:54:55,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:54:55,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:54:55,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:54:55,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:54:55,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:54:55,601 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 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 19:54:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:54:55,618 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-11-11 19:54:55,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:54:55,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-11 19:54:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:54:55,621 INFO L225 Difference]: With dead ends: 13 [2024-11-11 19:54:55,621 INFO L226 Difference]: Without dead ends: 9 [2024-11-11 19:54:55,622 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 19:54:55,624 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:54:55,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:54:55,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-11 19:54:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-11 19:54:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 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 19:54:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-11 19:54:55,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2024-11-11 19:54:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:54:55,631 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-11 19:54:55,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 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 19:54:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-11 19:54:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-11 19:54:55,632 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:54:55,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:54:55,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:54:55,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:54:55,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:54:55,636 INFO L85 PathProgramCache]: Analyzing trace with hash 183170323, now seen corresponding path program 1 times [2024-11-11 19:54:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:54:55,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828371743] [2024-11-11 19:54:55,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:54:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:54:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:54:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:55,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:54:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828371743] [2024-11-11 19:54:55,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828371743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:54:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829691723] [2024-11-11 19:54:55,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:54:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:54:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:54:55,713 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 19:54:55,715 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 19:54:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:54:55,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 19:54:55,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:54:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:55,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:54:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:55,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829691723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:54:55,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:54:55,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-11 19:54:55,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624619062] [2024-11-11 19:54:55,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:54:55,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:54:55,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:54:55,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:54:55,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:54:55,855 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:54:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:54:55,874 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2024-11-11 19:54:55,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:54:55,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-11 19:54:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:54:55,876 INFO L225 Difference]: With dead ends: 16 [2024-11-11 19:54:55,877 INFO L226 Difference]: Without dead ends: 12 [2024-11-11 19:54:55,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:54:55,879 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:54:55,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:54:55,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-11 19:54:55,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-11 19:54:55,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 19:54:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-11 19:54:55,890 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-11 19:54:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:54:55,891 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-11 19:54:55,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:54:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-11 19:54:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 19:54:55,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:54:55,893 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:54:55,907 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 19:54:56,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:54:56,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:54:56,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:54:56,099 INFO L85 PathProgramCache]: Analyzing trace with hash -422592565, now seen corresponding path program 2 times [2024-11-11 19:54:56,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:54:56,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667933856] [2024-11-11 19:54:56,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:54:56,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:54:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:54:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:56,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:54:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667933856] [2024-11-11 19:54:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667933856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:54:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525051198] [2024-11-11 19:54:56,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:54:56,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:54:56,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:54:56,278 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 19:54:56,279 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 19:54:56,331 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:54:56,332 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:54:56,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 19:54:56,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:54:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:56,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:54:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:56,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525051198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:54:56,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:54:56,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-11 19:54:56,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754388113] [2024-11-11 19:54:56,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:54:56,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 19:54:56,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:54:56,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 19:54:56,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-11 19:54:56,459 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 19:54:56,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:54:56,496 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-11 19:54:56,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 19:54:56,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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 11 [2024-11-11 19:54:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:54:56,498 INFO L225 Difference]: With dead ends: 22 [2024-11-11 19:54:56,498 INFO L226 Difference]: Without dead ends: 18 [2024-11-11 19:54:56,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-11 19:54:56,499 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:54:56,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:54:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-11 19:54:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-11 19:54:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 19:54:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-11 19:54:56,504 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2024-11-11 19:54:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:54:56,504 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-11 19:54:56,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 19:54:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-11 19:54:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-11 19:54:56,505 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:54:56,506 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:54:56,521 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 19:54:56,706 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,SelfDestructingSolverStorable3 [2024-11-11 19:54:56,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:54:56,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:54:56,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1035090635, now seen corresponding path program 3 times [2024-11-11 19:54:56,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:54:56,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050059148] [2024-11-11 19:54:56,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:54:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:54:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:54:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:54:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050059148] [2024-11-11 19:54:56,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050059148] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:54:56,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024283331] [2024-11-11 19:54:56,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 19:54:56,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:54:56,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:54:56,979 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:54:56,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:54:57,032 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-11 19:54:57,032 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:54:57,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 19:54:57,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:54:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:57,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:54:57,351 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:57,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024283331] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:54:57,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:54:57,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-11-11 19:54:57,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619206065] [2024-11-11 19:54:57,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:54:57,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-11 19:54:57,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:54:57,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-11 19:54:57,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-11 19:54:57,359 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 19:54:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:54:57,417 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2024-11-11 19:54:57,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 19:54:57,417 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 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 17 [2024-11-11 19:54:57,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:54:57,418 INFO L225 Difference]: With dead ends: 34 [2024-11-11 19:54:57,419 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 19:54:57,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-11 19:54:57,420 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:54:57,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:54:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 19:54:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-11 19:54:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 19:54:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-11-11 19:54:57,428 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 17 [2024-11-11 19:54:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:54:57,429 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-11-11 19:54:57,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 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 19:54:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-11-11 19:54:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 19:54:57,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:54:57,430 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:54:57,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 19:54:57,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:54:57,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:54:57,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:54:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash 160329931, now seen corresponding path program 4 times [2024-11-11 19:54:57,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:54:57,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375652922] [2024-11-11 19:54:57,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:54:57,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:54:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:54:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:58,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:54:58,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375652922] [2024-11-11 19:54:58,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375652922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:54:58,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437532857] [2024-11-11 19:54:58,196 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 19:54:58,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:54:58,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:54:58,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:54:58,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 19:54:58,256 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 19:54:58,257 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:54:58,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-11 19:54:58,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:54:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:58,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:54:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:54:59,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437532857] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:54:59,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:54:59,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2024-11-11 19:54:59,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720351925] [2024-11-11 19:54:59,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:54:59,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-11 19:54:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:54:59,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-11 19:54:59,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-11 19:54:59,212 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 19:54:59,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:54:59,296 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2024-11-11 19:54:59,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-11 19:54:59,296 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 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 29 [2024-11-11 19:54:59,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:54:59,297 INFO L225 Difference]: With dead ends: 58 [2024-11-11 19:54:59,297 INFO L226 Difference]: Without dead ends: 54 [2024-11-11 19:54:59,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-11 19:54:59,299 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:54:59,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:54:59,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-11 19:54:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-11 19:54:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 0 states have call successors, (0), 0 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 19:54:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2024-11-11 19:54:59,314 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 29 [2024-11-11 19:54:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:54:59,315 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2024-11-11 19:54:59,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 0 states have call successors, (0), 0 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 19:54:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2024-11-11 19:54:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-11 19:54:59,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:54:59,319 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:54:59,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 19:54:59,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:54:59,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:54:59,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:54:59,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1226580789, now seen corresponding path program 5 times [2024-11-11 19:54:59,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:54:59,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412604662] [2024-11-11 19:54:59,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:54:59,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:54:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:55:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:55:01,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:55:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412604662] [2024-11-11 19:55:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412604662] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:55:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349433938] [2024-11-11 19:55:01,025 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 19:55:01,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:55:01,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:55:01,029 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:55:01,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 19:55:01,111 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-11 19:55:01,112 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:55:01,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-11 19:55:01,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:55:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:55:01,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:55:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:55:03,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349433938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:55:03,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:55:03,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 96 [2024-11-11 19:55:03,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791929396] [2024-11-11 19:55:03,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:55:03,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-11-11 19:55:03,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:55:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-11 19:55:03,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-11 19:55:03,755 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 96 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 0 states have call successors, (0), 0 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 19:55:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:55:03,890 INFO L93 Difference]: Finished difference Result 106 states and 153 transitions. [2024-11-11 19:55:03,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-11 19:55:03,891 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 0 states have call successors, (0), 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 53 [2024-11-11 19:55:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:55:03,892 INFO L225 Difference]: With dead ends: 106 [2024-11-11 19:55:03,892 INFO L226 Difference]: Without dead ends: 102 [2024-11-11 19:55:03,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-11 19:55:03,895 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:55:03,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:55:03,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-11 19:55:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-11 19:55:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.00990099009901) internal successors, (102), 101 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 19:55:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2024-11-11 19:55:03,910 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 53 [2024-11-11 19:55:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:55:03,910 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2024-11-11 19:55:03,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 96 states have internal predecessors, (101), 0 states have call successors, (0), 0 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 19:55:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2024-11-11 19:55:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 19:55:03,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:55:03,917 INFO L218 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:55:03,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 19:55:04,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:55:04,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:55:04,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:55:04,118 INFO L85 PathProgramCache]: Analyzing trace with hash 839038155, now seen corresponding path program 6 times [2024-11-11 19:55:04,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:55:04,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306157057] [2024-11-11 19:55:04,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:55:04,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:55:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:55:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:55:08,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:55:08,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306157057] [2024-11-11 19:55:08,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306157057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:55:08,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244720459] [2024-11-11 19:55:08,646 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-11 19:55:08,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:55:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:55:08,648 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:55:08,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 19:55:08,770 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2024-11-11 19:55:08,770 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:55:08,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-11 19:55:08,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:55:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:55:08,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:55:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:55:12,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244720459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:55:12,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:55:12,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 102 [2024-11-11 19:55:12,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102392848] [2024-11-11 19:55:12,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:55:12,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-11 19:55:12,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:55:12,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-11 19:55:12,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2024-11-11 19:55:12,627 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 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 19:55:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:55:12,760 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2024-11-11 19:55:12,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-11 19:55:12,760 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 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 101 [2024-11-11 19:55:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:55:12,762 INFO L225 Difference]: With dead ends: 112 [2024-11-11 19:55:12,762 INFO L226 Difference]: Without dead ends: 108 [2024-11-11 19:55:12,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 107 SyntacticMatches, 90 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2024-11-11 19:55:12,765 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:55:12,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:55:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-11 19:55:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-11 19:55:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0093457943925233) internal successors, (108), 107 states have internal predecessors, (108), 0 states have call successors, (0), 0 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 19:55:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2024-11-11 19:55:12,774 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 101 [2024-11-11 19:55:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:55:12,775 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2024-11-11 19:55:12,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 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 19:55:12,775 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2024-11-11 19:55:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 19:55:12,776 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:55:12,776 INFO L218 NwaCegarLoop]: trace histogram [100, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:55:12,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 19:55:12,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:55:12,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:55:12,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:55:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash 840527819, now seen corresponding path program 7 times [2024-11-11 19:55:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:55:12,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491187976] [2024-11-11 19:55:12,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:55:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:55:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:55:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:55:17,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:55:17,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491187976] [2024-11-11 19:55:17,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491187976] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:55:17,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115482019] [2024-11-11 19:55:17,764 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-11 19:55:17,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:55:17,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:55:17,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:55:17,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 19:55:17,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:55:17,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 205 conjuncts are in the unsatisfiable core [2024-11-11 19:55:17,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:55:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:55:18,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:55:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:55:18,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115482019] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:55:18,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:55:18,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 105 [2024-11-11 19:55:18,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234934584] [2024-11-11 19:55:18,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:55:18,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2024-11-11 19:55:18,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:55:18,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2024-11-11 19:55:18,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2024-11-11 19:55:18,389 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand has 105 states, 105 states have (on average 1.0380952380952382) internal successors, (109), 105 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 19:55:22,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:55:22,073 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2024-11-11 19:55:22,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-11-11 19:55:22,073 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 1.0380952380952382) internal successors, (109), 105 states have internal predecessors, (109), 0 states have call successors, (0), 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 107 [2024-11-11 19:55:22,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:55:22,074 INFO L225 Difference]: With dead ends: 113 [2024-11-11 19:55:22,075 INFO L226 Difference]: Without dead ends: 109 [2024-11-11 19:55:22,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=208, Invalid=10712, Unknown=0, NotChecked=0, Total=10920 [2024-11-11 19:55:22,078 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 10711 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 10711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-11 19:55:22,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 420 Invalid, 10711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10711 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-11 19:55:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-11 19:55:22,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-11 19:55:22,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.0092592592592593) internal successors, (109), 108 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 19:55:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2024-11-11 19:55:22,091 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2024-11-11 19:55:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:55:22,091 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2024-11-11 19:55:22,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 1.0380952380952382) internal successors, (109), 105 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 19:55:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2024-11-11 19:55:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 19:55:22,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:55:22,093 INFO L218 NwaCegarLoop]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:55:22,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 19:55:22,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:55:22,294 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:55:22,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:55:22,295 INFO L85 PathProgramCache]: Analyzing trace with hash 288224019, now seen corresponding path program 8 times [2024-11-11 19:55:22,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:55:22,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655314214] [2024-11-11 19:55:22,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:55:22,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:55:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:55:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 5151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:55:26,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:55:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655314214] [2024-11-11 19:55:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655314214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:55:26,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:55:26,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [103] imperfect sequences [] total 103 [2024-11-11 19:55:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017571255] [2024-11-11 19:55:26,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:55:26,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-11-11 19:55:26,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:55:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-11-11 19:55:26,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-11-11 19:55:26,837 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 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 19:55:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:55:27,098 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2024-11-11 19:55:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2024-11-11 19:55:27,098 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-11 19:55:27,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:55:27,099 INFO L225 Difference]: With dead ends: 109 [2024-11-11 19:55:27,099 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 19:55:27,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-11-11 19:55:27,100 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:55:27,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:55:27,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 19:55:27,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 19:55:27,101 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 19:55:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 19:55:27,101 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2024-11-11 19:55:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:55:27,102 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 19:55:27,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 states have internal predecessors, (108), 0 states have call successors, (0), 0 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 19:55:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 19:55:27,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 19:55:27,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 19:55:27,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 19:55:27,108 INFO L421 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2024-11-11 19:55:27,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 19:55:28,367 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 19:55:28,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 07:55:28 BoogieIcfgContainer [2024-11-11 19:55:28,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 19:55:28,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 19:55:28,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 19:55:28,401 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 19:55:28,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:54:55" (3/4) ... [2024-11-11 19:55:28,406 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 19:55:28,415 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-11 19:55:28,415 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 19:55:28,415 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 19:55:28,415 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 19:55:28,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 19:55:28,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 19:55:28,515 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 19:55:28,516 INFO L158 Benchmark]: Toolchain (without parser) took 34071.21ms. Allocated memory was 155.2MB in the beginning and 333.4MB in the end (delta: 178.3MB). Free memory was 99.8MB in the beginning and 203.0MB in the end (delta: -103.2MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2024-11-11 19:55:28,516 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 19:55:28,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.52ms. Allocated memory is still 155.2MB. Free memory was 99.8MB in the beginning and 87.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 19:55:28,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.07ms. Allocated memory is still 155.2MB. Free memory was 87.6MB in the beginning and 85.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:55:28,517 INFO L158 Benchmark]: Boogie Preprocessor took 42.29ms. Allocated memory is still 155.2MB. Free memory was 85.9MB in the beginning and 84.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 19:55:28,517 INFO L158 Benchmark]: RCFGBuilder took 281.67ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 74.6MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-11 19:55:28,518 INFO L158 Benchmark]: TraceAbstraction took 33288.23ms. Allocated memory was 155.2MB in the beginning and 333.4MB in the end (delta: 178.3MB). Free memory was 74.2MB in the beginning and 207.2MB in the end (delta: -133.0MB). Peak memory consumption was 151.2MB. Max. memory is 16.1GB. [2024-11-11 19:55:28,518 INFO L158 Benchmark]: Witness Printer took 114.64ms. Allocated memory is still 333.4MB. Free memory was 207.2MB in the beginning and 203.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 19:55:28,519 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.24ms. Allocated memory is still 155.2MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.52ms. Allocated memory is still 155.2MB. Free memory was 99.8MB in the beginning and 87.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.07ms. Allocated memory is still 155.2MB. Free memory was 87.6MB in the beginning and 85.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.29ms. Allocated memory is still 155.2MB. Free memory was 85.9MB in the beginning and 84.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 281.67ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 74.6MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 33288.23ms. Allocated memory was 155.2MB in the beginning and 333.4MB in the end (delta: 178.3MB). Free memory was 74.2MB in the beginning and 207.2MB in the end (delta: -133.0MB). Peak memory consumption was 151.2MB. Max. memory is 16.1GB. * Witness Printer took 114.64ms. Allocated memory is still 333.4MB. Free memory was 207.2MB in the beginning and 203.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 16]: 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, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 589 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 518 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11534 IncrementalHoareTripleChecker+Invalid, 11539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 71 mSDtfsCounter, 11534 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1045 GetRequests, 473 SyntacticMatches, 91 SemanticMatches, 481 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4455 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=9, InterpolantAutomatonStates: 500, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 774 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 94 NumberOfCheckSat, 1076 ConstructedInterpolants, 0 QuantifiedInterpolants, 2997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1616 ConjunctsInSsa, 394 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 5151/37896 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: 23]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((j == 124) && (62 == i)) || ((i == 11) && (22 == j))) || ((76 == j) && (i == 38))) || ((41 == i) && (82 == j))) || ((94 == i) && (j == 188))) || ((i == 15) && (30 == j))) || ((i == 63) && (j == 126))) || ((23 == i) && (46 == j))) || ((j == 80) && (40 == i))) || ((134 == j) && (67 == i))) || ((154 == j) && (77 == i))) || ((9 == i) && (j == 18))) || ((i == 4) && (j == 8))) || ((j == 166) && (i == 83))) || ((j == 12) && (6 == i))) || ((88 == i) && (176 == j))) || ((88 == j) && (44 == i))) || ((i == 26) && (52 == j))) || ((i == 39) && (j == 78))) || ((68 == j) && (i == 34))) || ((7 == i) && (14 == j))) || ((32 == j) && (16 == i))) || ((i == 93) && (j == 186))) || ((j == 180) && (i == 90))) || ((j == 26) && (i == 13))) || ((42 == i) && (84 == j))) || ((j == 38) && (19 == i))) || ((68 == i) && (j == 136))) || ((40 == j) && (i == 20))) || ((71 == i) && (142 == j))) || ((i == 8) && (16 == j))) || ((100 <= i) && (200 == j))) || ((56 == i) && (112 == j))) || ((2 == j) && (i == 1))) || ((91 == i) && (j == 182))) || ((156 == j) && (i == 78))) || ((35 == i) && (j == 70))) || ((j == 100) && (i == 50))) || ((j == 50) && (i == 25))) || ((i == 0) && (j == 0))) || ((j == 198) && (i == 99))) || ((108 == j) && (i == 54))) || ((i == 96) && (192 == j))) || ((j == 90) && (i == 45))) || ((144 == j) && (72 == i))) || ((57 == i) && (j == 114))) || ((i == 80) && (160 == j))) || ((i == 79) && (158 == j))) || ((190 == j) && (95 == i))) || ((i == 43) && (j == 86))) || ((j == 60) && (30 == i))) || ((46 == i) && (92 == j))) || ((106 == j) && (53 == i))) || ((i == 33) && (66 == j))) || ((i == 86) && (j == 172))) || ((64 == j) && (32 == i))) || ((i == 60) && (j == 120))) || ((5 == i) && (j == 10))) || ((j == 162) && (81 == i))) || ((29 == i) && (j == 58))) || ((14 == i) && (j == 28))) || ((94 == j) && (47 == i))) || ((i == 28) && (56 == j))) || ((62 == j) && (31 == i))) || ((194 == j) && (97 == i))) || ((i == 55) && (110 == j))) || ((j == 54) && (i == 27))) || ((j == 102) && (51 == i))) || ((164 == j) && (82 == i))) || ((138 == j) && (69 == i))) || ((64 == i) && (j == 128))) || ((j == 130) && (i == 65))) || ((i == 61) && (j == 122))) || ((6 == j) && (3 == i))) || ((104 == j) && (52 == i))) || ((98 == j) && (49 == i))) || ((j == 36) && (i == 18))) || ((196 == j) && (98 == i))) || ((i == 85) && (170 == j))) || ((i == 24) && (j == 48))) || ((152 == j) && (76 == i))) || ((i == 17) && (j == 34))) || ((j == 20) && (i == 10))) || ((66 == i) && (j == 132))) || ((i == 12) && (j == 24))) || ((j == 168) && (84 == i))) || ((i == 70) && (140 == j))) || ((92 == i) && (184 == j))) || ((j == 96) && (i == 48))) || ((j == 4) && (2 == i))) || ((21 == i) && (42 == j))) || ((22 == i) && (44 == j))) || ((146 == j) && (i == 73))) || ((116 == j) && (i == 58))) || ((178 == j) && (89 == i))) || ((i == 37) && (j == 74))) || ((i == 75) && (j == 150))) || ((i == 74) && (148 == j))) || ((i == 36) && (72 == j))) || ((87 == i) && (j == 174))) || ((j == 118) && (59 == i))) RESULT: Ultimate proved your program to be correct! [2024-11-11 19:55:28,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE