./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/Mono6_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/Mono6_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d34109ac38ddcd69eb693c43509c1355293ac88c80ebd192d8e2af9a8be8f805 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:49:08,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:49:08,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:49:08,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:49:08,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:49:08,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:49:08,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:49:08,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:49:08,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:49:08,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:49:08,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:49:08,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:49:08,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:49:08,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:49:08,993 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:49:08,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:49:08,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:49:08,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:49:08,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:49:08,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:49:08,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:49:08,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:49:08,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:49:08,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:49:08,997 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:49:08,997 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:49:08,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:49:08,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:49:08,997 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:49:08,997 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:49:08,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:49:08,998 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:49:08,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:49:08,998 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:49:08,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:49:08,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:49:08,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:49:08,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:49:08,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:49:08,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:49:08,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:49:09,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:49:09,000 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 -> d34109ac38ddcd69eb693c43509c1355293ac88c80ebd192d8e2af9a8be8f805 [2024-11-11 19:49:09,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:49:09,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:49:09,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:49:09,233 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:49:09,234 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:49:09,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/Mono6_1.c [2024-11-11 19:49:10,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:49:10,579 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:49:10,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono6_1.c [2024-11-11 19:49:10,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd6ea456/91b773bb57f742e09ca7e32c62f3823e/FLAG720e50786 [2024-11-11 19:49:11,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bd6ea456/91b773bb57f742e09ca7e32c62f3823e [2024-11-11 19:49:11,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:49:11,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:49:11,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:49:11,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:49:11,015 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:49:11,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0000e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11, skipping insertion in model container [2024-11-11 19:49:11,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:49:11,172 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/loops-crafted-1/Mono6_1.c[311,324] [2024-11-11 19:49:11,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:49:11,191 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:49:11,201 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/loops-crafted-1/Mono6_1.c[311,324] [2024-11-11 19:49:11,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:49:11,217 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:49:11,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11 WrapperNode [2024-11-11 19:49:11,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:49:11,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:49:11,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:49:11,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:49:11,225 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:49:11" (1/1) ... [2024-11-11 19:49:11,230 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:49:11" (1/1) ... [2024-11-11 19:49:11,241 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2024-11-11 19:49:11,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:49:11,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:49:11,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:49:11,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:49:11,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,251 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,258 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:49:11,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,265 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:49:11,265 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:49:11,266 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:49:11,266 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:49:11,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11" (1/1) ... [2024-11-11 19:49:11,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:49:11,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:49:11,290 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:49:11,292 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:49:11,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:49:11,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:49:11,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:49:11,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:49:11,371 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:49:11,374 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:49:11,469 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-11 19:49:11,470 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:49:11,480 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:49:11,481 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 19:49:11,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:49:11 BoogieIcfgContainer [2024-11-11 19:49:11,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:49:11,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:49:11,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:49:11,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:49:11,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:49:11" (1/3) ... [2024-11-11 19:49:11,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0ab787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:49:11, skipping insertion in model container [2024-11-11 19:49:11,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:49:11" (2/3) ... [2024-11-11 19:49:11,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0ab787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:49:11, skipping insertion in model container [2024-11-11 19:49:11,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:49:11" (3/3) ... [2024-11-11 19:49:11,509 INFO L112 eAbstractionObserver]: Analyzing ICFG Mono6_1.c [2024-11-11 19:49:11,529 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:49:11,533 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:49:11,621 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:49:11,626 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;@5e1aae81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:49:11,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:49:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 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:49:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-11 19:49:11,637 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:49:11,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-11 19:49:11,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:49:11,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:49:11,644 INFO L85 PathProgramCache]: Analyzing trace with hash 889968487, now seen corresponding path program 1 times [2024-11-11 19:49:11,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:49:11,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434757334] [2024-11-11 19:49:11,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:49:11,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:49:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:49:11,774 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:49:11,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:49:11,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434757334] [2024-11-11 19:49:11,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434757334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:49:11,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:49:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:49:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332299106] [2024-11-11 19:49:11,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:49:11,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:49:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:49:11,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:49:11,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:49:11,798 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 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.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:49:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:49:11,806 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-11 19:49:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:49:11,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-11 19:49:11,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:49:11,812 INFO L225 Difference]: With dead ends: 21 [2024-11-11 19:49:11,812 INFO L226 Difference]: Without dead ends: 9 [2024-11-11 19:49:11,814 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:49:11,816 INFO L435 NwaCegarLoop]: 14 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, 14 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:49:11,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:49:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-11 19:49:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-11 19:49:11,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 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:49:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-11-11 19:49:11,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2024-11-11 19:49:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:49:11,837 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-11-11 19:49:11,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:49:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-11-11 19:49:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-11 19:49:11,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:49:11,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-11 19:49:11,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:49:11,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:49:11,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:49:11,839 INFO L85 PathProgramCache]: Analyzing trace with hash 889640786, now seen corresponding path program 1 times [2024-11-11 19:49:11,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:49:11,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743206737] [2024-11-11 19:49:11,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:49:11,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:49:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:49:12,000 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:49:12,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:49:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743206737] [2024-11-11 19:49:12,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743206737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:49:12,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:49:12,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:49:12,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352642655] [2024-11-11 19:49:12,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:49:12,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:49:12,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:49:12,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:49:12,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:49:12,003 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:49:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:49:12,028 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2024-11-11 19:49:12,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:49:12,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-11 19:49:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:49:12,030 INFO L225 Difference]: With dead ends: 19 [2024-11-11 19:49:12,030 INFO L226 Difference]: Without dead ends: 12 [2024-11-11 19:49:12,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:49:12,032 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:49:12,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:49:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-11 19:49:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-11-11 19:49:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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:49:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2024-11-11 19:49:12,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2024-11-11 19:49:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:49:12,038 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2024-11-11 19:49:12,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:49:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2024-11-11 19:49:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-11 19:49:12,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:49:12,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:49:12,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:49:12,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:49:12,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:49:12,039 INFO L85 PathProgramCache]: Analyzing trace with hash 641725625, now seen corresponding path program 1 times [2024-11-11 19:49:12,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:49:12,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022516586] [2024-11-11 19:49:12,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:49:12,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:49:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:49:12,238 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:49:12,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:49:12,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022516586] [2024-11-11 19:49:12,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022516586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:49:12,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606507850] [2024-11-11 19:49:12,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:49:12,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:49:12,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:49:12,242 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:49:12,243 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:49:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:49:12,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 19:49:12,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:49:12,375 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:49:12,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:49:12,450 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:49:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606507850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:49:12,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:49:12,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 9 [2024-11-11 19:49:12,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036068877] [2024-11-11 19:49:12,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:49:12,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 19:49:12,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:49:12,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 19:49:12,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:49:12,453 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:49:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:49:12,552 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-11-11 19:49:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:49:12,554 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 9 [2024-11-11 19:49:12,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:49:12,554 INFO L225 Difference]: With dead ends: 32 [2024-11-11 19:49:12,554 INFO L226 Difference]: Without dead ends: 22 [2024-11-11 19:49:12,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-11 19:49:12,555 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:49:12,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 16 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:49:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-11 19:49:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-11 19:49:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 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:49:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-11 19:49:12,562 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2024-11-11 19:49:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:49:12,563 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-11 19:49:12,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 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:49:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-11 19:49:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 19:49:12,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:49:12,564 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2024-11-11 19:49:12,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 19:49:12,768 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:49:12,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:49:12,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:49:12,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1171899538, now seen corresponding path program 2 times [2024-11-11 19:49:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:49:12,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46241589] [2024-11-11 19:49:12,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:49:12,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:49:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:49:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:49:13,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:49:13,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46241589] [2024-11-11 19:49:13,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46241589] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:49:13,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306882882] [2024-11-11 19:49:13,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:49:13,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:49:13,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:49:13,026 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:49:13,033 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:49:13,064 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-11 19:49:13,064 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:49:13,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 19:49:13,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:49:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 19:49:13,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:49:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306882882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:49:13,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:49:13,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-11 19:49:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421455310] [2024-11-11 19:49:13,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:49:13,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:49:13,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:49:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:49:13,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:49:13,162 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:49:13,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:49:13,185 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-11-11 19:49:13,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:49:13,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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) Word has length 18 [2024-11-11 19:49:13,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:49:13,187 INFO L225 Difference]: With dead ends: 30 [2024-11-11 19:49:13,188 INFO L226 Difference]: Without dead ends: 26 [2024-11-11 19:49:13,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:49:13,189 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:49:13,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:49:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-11 19:49:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-11 19:49:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 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:49:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-11 19:49:13,196 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2024-11-11 19:49:13,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:49:13,197 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-11 19:49:13,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:49:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-11 19:49:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 19:49:13,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:49:13,198 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:49:13,211 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:49:13,399 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:49:13,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:49:13,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:49:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash 491841168, now seen corresponding path program 1 times [2024-11-11 19:49:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:49:13,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236968756] [2024-11-11 19:49:13,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:49:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:49:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:49:13,467 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:49:13,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:49:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236968756] [2024-11-11 19:49:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236968756] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:49:13,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709013358] [2024-11-11 19:49:13,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:49:13,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:49:13,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:49:13,471 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:49:13,472 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:49:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:49:13,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 19:49:13,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:49:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:49:13,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:49:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:49:13,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709013358] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:49:13,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:49:13,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2024-11-11 19:49:13,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703177110] [2024-11-11 19:49:13,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:49:13,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 19:49:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:49:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 19:49:13,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-11 19:49:13,618 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 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:49:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:49:13,700 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-11 19:49:13,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:49:13,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 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 18 [2024-11-11 19:49:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:49:13,701 INFO L225 Difference]: With dead ends: 40 [2024-11-11 19:49:13,702 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 19:49:13,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-11 19:49:13,703 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 10 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:49:13,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:49:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 19:49:13,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-11 19:49:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 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:49:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-11 19:49:13,710 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 18 [2024-11-11 19:49:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:49:13,710 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-11 19:49:13,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 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:49:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-11 19:49:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 19:49:13,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:49:13,712 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:49:13,726 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:49:13,913 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:49:13,913 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:49:13,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:49:13,914 INFO L85 PathProgramCache]: Analyzing trace with hash 330303387, now seen corresponding path program 2 times [2024-11-11 19:49:13,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:49:13,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454500657] [2024-11-11 19:49:13,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:49:13,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:49:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:49:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:49:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:49:14,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454500657] [2024-11-11 19:49:14,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454500657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:49:14,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931345382] [2024-11-11 19:49:14,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:49:14,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:49:14,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:49:14,016 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:49:14,017 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:49:14,051 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:49:14,051 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:49:14,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 19:49:14,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:49:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:49:14,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:49:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:49:14,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931345382] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:49:14,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:49:14,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 26 [2024-11-11 19:49:14,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893699775] [2024-11-11 19:49:14,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:49:14,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 19:49:14,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:49:14,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 19:49:14,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2024-11-11 19:49:14,465 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:49:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:49:17,009 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2024-11-11 19:49:17,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-11 19:49:17,010 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 0 states have call successors, (0), 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 27 [2024-11-11 19:49:17,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:49:17,011 INFO L225 Difference]: With dead ends: 92 [2024-11-11 19:49:17,012 INFO L226 Difference]: Without dead ends: 78 [2024-11-11 19:49:17,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=340, Invalid=992, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 19:49:17,013 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 23 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 19:49:17,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 19:49:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-11 19:49:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2024-11-11 19:49:17,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 70 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:49:17,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2024-11-11 19:49:17,030 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 86 transitions. Word has length 27 [2024-11-11 19:49:17,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:49:17,030 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 86 transitions. [2024-11-11 19:49:17,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8846153846153846) internal successors, (75), 26 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:49:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2024-11-11 19:49:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-11 19:49:17,031 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:49:17,031 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:49:17,045 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:49:17,232 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:49:17,232 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:49:17,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:49:17,233 INFO L85 PathProgramCache]: Analyzing trace with hash 365937652, now seen corresponding path program 3 times [2024-11-11 19:49:17,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:49:17,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976875260] [2024-11-11 19:49:17,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:49:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:49:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:49:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 153 proven. 77 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-11 19:49:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:49:17,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976875260] [2024-11-11 19:49:17,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976875260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:49:17,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40832491] [2024-11-11 19:49:17,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 19:49:17,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:49:17,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:49:17,394 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:49:17,395 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:49:17,425 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-11 19:49:17,425 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:49:17,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:49:17,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:49:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-11 19:49:17,524 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:49:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40832491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:49:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:49:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-11 19:49:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856546248] [2024-11-11 19:49:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:49:17,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:49:17,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:49:17,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:49:17,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:49:17,526 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:49:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:49:17,563 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2024-11-11 19:49:17,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:49:17,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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) Word has length 48 [2024-11-11 19:49:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:49:17,564 INFO L225 Difference]: With dead ends: 105 [2024-11-11 19:49:17,564 INFO L226 Difference]: Without dead ends: 101 [2024-11-11 19:49:17,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-11 19:49:17,565 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:49:17,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:49:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-11 19:49:17,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 52. [2024-11-11 19:49:17,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:49:17,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2024-11-11 19:49:17,573 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 48 [2024-11-11 19:49:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:49:17,573 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2024-11-11 19:49:17,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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:49:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2024-11-11 19:49:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 19:49:17,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:49:17,574 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:49:17,586 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:49:17,774 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:49:17,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:49:17,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:49:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash 188849435, now seen corresponding path program 4 times [2024-11-11 19:49:17,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:49:17,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900952418] [2024-11-11 19:49:17,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:49:17,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:49:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:49:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:49:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:49:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900952418] [2024-11-11 19:49:18,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900952418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:49:18,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593638934] [2024-11-11 19:49:18,067 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 19:49:18,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:49:18,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:49:18,068 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:49:18,069 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:49:18,112 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 19:49:18,113 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:49:18,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-11 19:49:18,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:49:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 29 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:49:18,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:49:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:49:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593638934] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:49:18,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:49:18,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 20] total 37 [2024-11-11 19:49:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234518922] [2024-11-11 19:49:18,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:49:18,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-11 19:49:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:49:18,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-11 19:49:18,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=970, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 19:49:18,877 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 37 states, 37 states have (on average 2.72972972972973) internal successors, (101), 37 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:49:47,896 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 25 DAG size of output: 21 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-11 19:49:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:49:48,348 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2024-11-11 19:49:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-11 19:49:48,349 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.72972972972973) internal successors, (101), 37 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 51 [2024-11-11 19:49:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:49:48,350 INFO L225 Difference]: With dead ends: 127 [2024-11-11 19:49:48,350 INFO L226 Difference]: Without dead ends: 100 [2024-11-11 19:49:48,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1438 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=2022, Invalid=4458, Unknown=0, NotChecked=0, Total=6480 [2024-11-11 19:49:48,353 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 84 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:49:48,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 57 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:49:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-11 19:49:48,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-11 19:49:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.02020202020202) internal successors, (101), 99 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:49:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2024-11-11 19:49:48,368 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 51 [2024-11-11 19:49:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:49:48,368 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2024-11-11 19:49:48,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.72972972972973) internal successors, (101), 37 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:49:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2024-11-11 19:49:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 19:49:48,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:49:48,370 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:49:48,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 19:49:48,570 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:49:48,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:49:48,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:49:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash -506771429, now seen corresponding path program 5 times [2024-11-11 19:49:48,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:49:48,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554780513] [2024-11-11 19:49:48,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:49:48,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:49:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:49:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 61 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:49:49,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:49:49,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554780513] [2024-11-11 19:49:49,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554780513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:49:49,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395993245] [2024-11-11 19:49:49,383 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-11 19:49:49,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:49:49,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:49:49,385 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:49:49,385 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:49:49,991 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-11-11 19:49:49,992 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:49:49,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-11 19:49:49,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:49:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:49:51,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:49:53,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1424 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-11 19:49:53,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395993245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:49:53,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:49:53,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36, 34] total 99 [2024-11-11 19:49:53,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667812050] [2024-11-11 19:49:53,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:49:53,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2024-11-11 19:49:53,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:49:53,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2024-11-11 19:49:53,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1311, Invalid=8391, Unknown=0, NotChecked=0, Total=9702 [2024-11-11 19:49:53,692 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 99 states, 99 states have (on average 2.9494949494949494) internal successors, (292), 99 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)