./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label17.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 eca4fa24c7d17d702b457b7d1d0ed6513492942e324299a6e335f63078cc8b55 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:42:32,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:42:32,574 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:42:32,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:42:32,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:42:32,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:42:32,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:42:32,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:42:32,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:42:32,609 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:42:32,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:42:32,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:42:32,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:42:32,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:42:32,611 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:42:32,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:42:32,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:42:32,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:42:32,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:42:32,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:42:32,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:42:32,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:42:32,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:42:32,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:42:32,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:42:32,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:42:32,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:42:32,621 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:42:32,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:42:32,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:42:32,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:42:32,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:42:32,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:42:32,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:42:32,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:42:32,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:42:32,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:42:32,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:42:32,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:42:32,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:42:32,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:42:32,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:42:32,624 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 -> eca4fa24c7d17d702b457b7d1d0ed6513492942e324299a6e335f63078cc8b55 [2024-10-13 23:42:32,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:42:32,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:42:32,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:42:32,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:42:32,910 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:42:32,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label17.c [2024-10-13 23:42:34,392 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:42:34,654 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:42:34,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label17.c [2024-10-13 23:42:34,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd851ea8/dba3373a2c5c47ceb2ea595666ffbf36/FLAG70abda2c8 [2024-10-13 23:42:34,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd851ea8/dba3373a2c5c47ceb2ea595666ffbf36 [2024-10-13 23:42:34,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:42:34,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:42:34,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:42:34,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:42:34,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:42:34,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:42:34" (1/1) ... [2024-10-13 23:42:34,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7467e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:34, skipping insertion in model container [2024-10-13 23:42:34,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:42:34" (1/1) ... [2024-10-13 23:42:34,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:42:34,976 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label17.c[5746,5759] [2024-10-13 23:42:35,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:42:35,209 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:42:35,237 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label17.c[5746,5759] [2024-10-13 23:42:35,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:42:35,371 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:42:35,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35 WrapperNode [2024-10-13 23:42:35,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:42:35,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:42:35,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:42:35,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:42:35,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,474 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-13 23:42:35,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:42:35,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:42:35,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:42:35,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:42:35,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,540 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:42:35,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:42:35,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:42:35,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:42:35,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:42:35,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (1/1) ... [2024-10-13 23:42:35,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:42:35,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:35,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:42:35,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:42:35,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:42:35,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:42:35,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:42:35,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:42:35,781 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:42:35,785 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:42:37,066 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-13 23:42:37,067 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:42:37,125 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:42:37,126 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:42:37,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:42:37 BoogieIcfgContainer [2024-10-13 23:42:37,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:42:37,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:42:37,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:42:37,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:42:37,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:42:34" (1/3) ... [2024-10-13 23:42:37,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba82266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:42:37, skipping insertion in model container [2024-10-13 23:42:37,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:42:35" (2/3) ... [2024-10-13 23:42:37,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba82266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:42:37, skipping insertion in model container [2024-10-13 23:42:37,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:42:37" (3/3) ... [2024-10-13 23:42:37,137 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label17.c [2024-10-13 23:42:37,154 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:42:37,155 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:42:37,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:42:37,229 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;@1970d212, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:42:37,229 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:42:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 23:42:37,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:37,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:37,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:37,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash 482238175, now seen corresponding path program 1 times [2024-10-13 23:42:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439581833] [2024-10-13 23:42:37,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:42:37,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:37,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439581833] [2024-10-13 23:42:37,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439581833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:37,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:37,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:42:37,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853244304] [2024-10-13 23:42:37,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:37,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:42:37,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:37,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:42:37,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:42:37,508 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:37,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:37,559 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-13 23:42:37,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:42:37,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-13 23:42:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:37,574 INFO L225 Difference]: With dead ends: 365 [2024-10-13 23:42:37,574 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 23:42:37,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:42:37,583 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:37,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:42:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 23:42:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-13 23:42:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-13 23:42:37,638 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 55 [2024-10-13 23:42:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:37,639 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-13 23:42:37,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-13 23:42:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 23:42:37,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:37,642 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:37,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:42:37,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:37,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash 254476582, now seen corresponding path program 1 times [2024-10-13 23:42:37,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:37,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651617025] [2024-10-13 23:42:37,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:37,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:42:37,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651617025] [2024-10-13 23:42:37,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651617025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:37,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:37,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:42:37,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116882832] [2024-10-13 23:42:37,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:37,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:37,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:37,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:37,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:37,888 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:38,764 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2024-10-13 23:42:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:38,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-13 23:42:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:38,768 INFO L225 Difference]: With dead ends: 539 [2024-10-13 23:42:38,768 INFO L226 Difference]: Without dead ends: 359 [2024-10-13 23:42:38,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:38,772 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:38,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 51 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:42:38,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-13 23:42:38,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-13 23:42:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.5223463687150838) internal successors, (545), 358 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2024-10-13 23:42:38,797 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 55 [2024-10-13 23:42:38,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:38,798 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2024-10-13 23:42:38,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2024-10-13 23:42:38,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 23:42:38,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:38,803 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:38,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:42:38,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:38,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1083116251, now seen corresponding path program 1 times [2024-10-13 23:42:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:38,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848516222] [2024-10-13 23:42:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:38,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:42:39,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:39,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848516222] [2024-10-13 23:42:39,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848516222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:39,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:39,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:42:39,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482037734] [2024-10-13 23:42:39,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:39,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:39,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:39,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:39,005 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:39,634 INFO L93 Difference]: Finished difference Result 1073 states and 1632 transitions. [2024-10-13 23:42:39,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:39,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-13 23:42:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:39,638 INFO L225 Difference]: With dead ends: 1073 [2024-10-13 23:42:39,638 INFO L226 Difference]: Without dead ends: 715 [2024-10-13 23:42:39,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:39,641 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:39,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 93 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:42:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-13 23:42:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-13 23:42:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.354341736694678) internal successors, (967), 714 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2024-10-13 23:42:39,694 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 130 [2024-10-13 23:42:39,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:39,695 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2024-10-13 23:42:39,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:39,695 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2024-10-13 23:42:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-13 23:42:39,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:39,705 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:39,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:42:39,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:39,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash -137673775, now seen corresponding path program 1 times [2024-10-13 23:42:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:39,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591575922] [2024-10-13 23:42:39,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:39,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:42:40,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:40,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591575922] [2024-10-13 23:42:40,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591575922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:40,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:40,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:40,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761547186] [2024-10-13 23:42:40,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:40,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:42:40,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:40,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:42:40,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:40,117 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:40,970 INFO L93 Difference]: Finished difference Result 1963 states and 2569 transitions. [2024-10-13 23:42:40,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:42:40,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2024-10-13 23:42:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:40,975 INFO L225 Difference]: With dead ends: 1963 [2024-10-13 23:42:40,975 INFO L226 Difference]: Without dead ends: 1249 [2024-10-13 23:42:40,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:40,978 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:40,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 119 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:42:40,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-13 23:42:40,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2024-10-13 23:42:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.236378205128205) internal successors, (1543), 1248 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1543 transitions. [2024-10-13 23:42:41,003 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1543 transitions. Word has length 134 [2024-10-13 23:42:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:41,004 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1543 transitions. [2024-10-13 23:42:41,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1543 transitions. [2024-10-13 23:42:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-13 23:42:41,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:41,009 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:41,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:42:41,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:41,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1843322619, now seen corresponding path program 1 times [2024-10-13 23:42:41,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:41,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981449589] [2024-10-13 23:42:41,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:41,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-13 23:42:41,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:41,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981449589] [2024-10-13 23:42:41,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981449589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:41,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:41,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:41,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832203580] [2024-10-13 23:42:41,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:41,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:42:41,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:41,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:42:41,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:41,299 INFO L87 Difference]: Start difference. First operand 1249 states and 1543 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:42,034 INFO L93 Difference]: Finished difference Result 2704 states and 3352 transitions. [2024-10-13 23:42:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:42:42,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2024-10-13 23:42:42,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:42,042 INFO L225 Difference]: With dead ends: 2704 [2024-10-13 23:42:42,042 INFO L226 Difference]: Without dead ends: 1605 [2024-10-13 23:42:42,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:42,045 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 102 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:42,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 117 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 23:42:42,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-10-13 23:42:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2024-10-13 23:42:42,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1221945137157108) internal successors, (1800), 1604 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1800 transitions. [2024-10-13 23:42:42,072 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1800 transitions. Word has length 214 [2024-10-13 23:42:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:42,073 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1800 transitions. [2024-10-13 23:42:42,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1800 transitions. [2024-10-13 23:42:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-10-13 23:42:42,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:42,077 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:42,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:42:42,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:42,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:42,079 INFO L85 PathProgramCache]: Analyzing trace with hash -254545828, now seen corresponding path program 1 times [2024-10-13 23:42:42,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:42,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088089274] [2024-10-13 23:42:42,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:42,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 209 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-13 23:42:42,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:42,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088089274] [2024-10-13 23:42:42,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088089274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:42,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446965164] [2024-10-13 23:42:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:42,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:42,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:42,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:42,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:42:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:42,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:42,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-13 23:42:43,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:43,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446965164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:43,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:43,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-13 23:42:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42660629] [2024-10-13 23:42:43,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:43,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:43,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:43,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:43,216 INFO L87 Difference]: Start difference. First operand 1605 states and 1800 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:43,781 INFO L93 Difference]: Finished difference Result 3387 states and 3900 transitions. [2024-10-13 23:42:43,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:43,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 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 341 [2024-10-13 23:42:43,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:43,795 INFO L225 Difference]: With dead ends: 3387 [2024-10-13 23:42:43,795 INFO L226 Difference]: Without dead ends: 1961 [2024-10-13 23:42:43,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:43,799 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:43,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 45 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:42:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-10-13 23:42:43,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2024-10-13 23:42:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.131874298540965) internal successors, (2017), 1782 states have internal predecessors, (2017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2017 transitions. [2024-10-13 23:42:43,832 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2017 transitions. Word has length 341 [2024-10-13 23:42:43,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:43,833 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2017 transitions. [2024-10-13 23:42:43,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2017 transitions. [2024-10-13 23:42:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-10-13 23:42:43,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:43,838 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:43,856 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-10-13 23:42:44,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 23:42:44,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:44,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2010152750, now seen corresponding path program 1 times [2024-10-13 23:42:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:44,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499893895] [2024-10-13 23:42:44,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-13 23:42:44,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:44,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499893895] [2024-10-13 23:42:44,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499893895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:44,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:44,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:44,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501124598] [2024-10-13 23:42:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:44,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:44,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:44,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:44,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:44,410 INFO L87 Difference]: Start difference. First operand 1783 states and 2017 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:44,957 INFO L93 Difference]: Finished difference Result 3743 states and 4281 transitions. [2024-10-13 23:42:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:44,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 345 [2024-10-13 23:42:44,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:44,978 INFO L225 Difference]: With dead ends: 3743 [2024-10-13 23:42:44,979 INFO L226 Difference]: Without dead ends: 2139 [2024-10-13 23:42:44,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:44,981 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:44,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 75 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:42:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-13 23:42:45,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2024-10-13 23:42:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.128157156220767) internal successors, (2412), 2138 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2412 transitions. [2024-10-13 23:42:45,016 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2412 transitions. Word has length 345 [2024-10-13 23:42:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:45,017 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2412 transitions. [2024-10-13 23:42:45,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2412 transitions. [2024-10-13 23:42:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-10-13 23:42:45,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:45,022 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-10-13 23:42:45,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:42:45,023 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:45,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:45,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1372929616, now seen corresponding path program 1 times [2024-10-13 23:42:45,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:45,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80767518] [2024-10-13 23:42:45,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:45,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:45,276 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:45,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:45,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80767518] [2024-10-13 23:42:45,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80767518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:45,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:45,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:45,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198344052] [2024-10-13 23:42:45,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:45,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:45,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:45,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:45,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:45,279 INFO L87 Difference]: Start difference. First operand 2139 states and 2412 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:45,881 INFO L93 Difference]: Finished difference Result 4633 states and 5294 transitions. [2024-10-13 23:42:45,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:45,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 372 [2024-10-13 23:42:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:45,891 INFO L225 Difference]: With dead ends: 4633 [2024-10-13 23:42:45,891 INFO L226 Difference]: Without dead ends: 2673 [2024-10-13 23:42:45,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:45,895 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:45,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 255 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:42:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-13 23:42:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2673. [2024-10-13 23:42:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.1208832335329342) internal successors, (2995), 2672 states have internal predecessors, (2995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2995 transitions. [2024-10-13 23:42:45,955 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2995 transitions. Word has length 372 [2024-10-13 23:42:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:45,956 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2995 transitions. [2024-10-13 23:42:45,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:45,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2995 transitions. [2024-10-13 23:42:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-10-13 23:42:45,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:45,964 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:45,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:42:45,964 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:45,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:45,965 INFO L85 PathProgramCache]: Analyzing trace with hash 523287229, now seen corresponding path program 1 times [2024-10-13 23:42:45,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:45,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216916144] [2024-10-13 23:42:45,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:45,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-10-13 23:42:46,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:46,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216916144] [2024-10-13 23:42:46,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216916144] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:46,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382562456] [2024-10-13 23:42:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:46,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:46,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:46,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:46,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:42:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:46,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:46,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:46,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:46,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382562456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:46,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:46,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-13 23:42:46,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505029859] [2024-10-13 23:42:46,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:46,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:46,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:46,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:46,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:46,663 INFO L87 Difference]: Start difference. First operand 2673 states and 2995 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:47,240 INFO L93 Difference]: Finished difference Result 6235 states and 7080 transitions. [2024-10-13 23:42:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:47,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 379 [2024-10-13 23:42:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:47,253 INFO L225 Difference]: With dead ends: 6235 [2024-10-13 23:42:47,254 INFO L226 Difference]: Without dead ends: 3741 [2024-10-13 23:42:47,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:42:47,258 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:47,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 56 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:42:47,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2024-10-13 23:42:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3741. [2024-10-13 23:42:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.124331550802139) internal successors, (4205), 3740 states have internal predecessors, (4205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4205 transitions. [2024-10-13 23:42:47,368 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4205 transitions. Word has length 379 [2024-10-13 23:42:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:47,368 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 4205 transitions. [2024-10-13 23:42:47,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4205 transitions. [2024-10-13 23:42:47,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-10-13 23:42:47,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:47,377 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:47,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:42:47,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-13 23:42:47,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:47,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:47,579 INFO L85 PathProgramCache]: Analyzing trace with hash -664849193, now seen corresponding path program 1 times [2024-10-13 23:42:47,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:47,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535581443] [2024-10-13 23:42:47,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-13 23:42:47,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:47,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535581443] [2024-10-13 23:42:47,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535581443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:47,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:47,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:47,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309827829] [2024-10-13 23:42:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:47,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:42:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:42:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:47,964 INFO L87 Difference]: Start difference. First operand 3741 states and 4205 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:48,582 INFO L93 Difference]: Finished difference Result 7539 states and 8484 transitions. [2024-10-13 23:42:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:42:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 454 [2024-10-13 23:42:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:48,595 INFO L225 Difference]: With dead ends: 7539 [2024-10-13 23:42:48,596 INFO L226 Difference]: Without dead ends: 3919 [2024-10-13 23:42:48,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:42:48,601 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:48,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:42:48,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-13 23:42:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3741. [2024-10-13 23:42:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0831550802139038) internal successors, (4051), 3740 states have internal predecessors, (4051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4051 transitions. [2024-10-13 23:42:48,672 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4051 transitions. Word has length 454 [2024-10-13 23:42:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:48,673 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 4051 transitions. [2024-10-13 23:42:48,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:48,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4051 transitions. [2024-10-13 23:42:48,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-10-13 23:42:48,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:48,676 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:48,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:42:48,677 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:48,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:48,677 INFO L85 PathProgramCache]: Analyzing trace with hash -309172618, now seen corresponding path program 1 times [2024-10-13 23:42:48,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:48,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025366190] [2024-10-13 23:42:48,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:48,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 520 proven. 11 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:49,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:49,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025366190] [2024-10-13 23:42:49,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025366190] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:49,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190378625] [2024-10-13 23:42:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:49,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:49,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:49,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:49,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:42:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:49,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:49,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 23:42:49,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:49,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190378625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:49,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:49,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:42:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696042745] [2024-10-13 23:42:49,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:49,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:49,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:49,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:49,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:49,629 INFO L87 Difference]: Start difference. First operand 3741 states and 4051 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:50,150 INFO L93 Difference]: Finished difference Result 7303 states and 7922 transitions. [2024-10-13 23:42:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:50,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 480 [2024-10-13 23:42:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:50,162 INFO L225 Difference]: With dead ends: 7303 [2024-10-13 23:42:50,162 INFO L226 Difference]: Without dead ends: 3741 [2024-10-13 23:42:50,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:50,167 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:50,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 211 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:42:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2024-10-13 23:42:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3741. [2024-10-13 23:42:50,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0737967914438502) internal successors, (4016), 3740 states have internal predecessors, (4016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4016 transitions. [2024-10-13 23:42:50,232 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4016 transitions. Word has length 480 [2024-10-13 23:42:50,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:50,233 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 4016 transitions. [2024-10-13 23:42:50,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4016 transitions. [2024-10-13 23:42:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2024-10-13 23:42:50,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:50,238 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:50,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 23:42:50,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:50,440 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:50,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:50,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1408184804, now seen corresponding path program 1 times [2024-10-13 23:42:50,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:50,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976282789] [2024-10-13 23:42:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-10-13 23:42:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976282789] [2024-10-13 23:42:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976282789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:42:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:42:50,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301576406] [2024-10-13 23:42:50,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:50,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:50,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:50,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:50,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:50,788 INFO L87 Difference]: Start difference. First operand 3741 states and 4016 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:51,294 INFO L93 Difference]: Finished difference Result 7659 states and 8276 transitions. [2024-10-13 23:42:51,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:51,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 534 [2024-10-13 23:42:51,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:51,307 INFO L225 Difference]: With dead ends: 7659 [2024-10-13 23:42:51,308 INFO L226 Difference]: Without dead ends: 4097 [2024-10-13 23:42:51,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:42:51,313 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 125 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:51,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 59 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:42:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2024-10-13 23:42:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 4097. [2024-10-13 23:42:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.07861328125) internal successors, (4418), 4096 states have internal predecessors, (4418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4418 transitions. [2024-10-13 23:42:51,381 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4418 transitions. Word has length 534 [2024-10-13 23:42:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:51,382 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4418 transitions. [2024-10-13 23:42:51,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4418 transitions. [2024-10-13 23:42:51,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-10-13 23:42:51,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:51,387 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:51,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:42:51,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:51,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:51,388 INFO L85 PathProgramCache]: Analyzing trace with hash 578962460, now seen corresponding path program 1 times [2024-10-13 23:42:51,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:51,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819742588] [2024-10-13 23:42:51,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:51,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 463 proven. 68 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-13 23:42:51,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:51,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819742588] [2024-10-13 23:42:51,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819742588] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:51,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990752126] [2024-10-13 23:42:51,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:51,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:51,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:51,985 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:51,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 23:42:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:52,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:52,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 845 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2024-10-13 23:42:52,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:52,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990752126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:52,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:52,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-13 23:42:52,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687451166] [2024-10-13 23:42:52,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:52,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:52,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:52,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:52,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:52,837 INFO L87 Difference]: Start difference. First operand 4097 states and 4418 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:53,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:53,206 INFO L93 Difference]: Finished difference Result 5167 states and 5589 transitions. [2024-10-13 23:42:53,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:53,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 545 [2024-10-13 23:42:53,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:53,232 INFO L225 Difference]: With dead ends: 5167 [2024-10-13 23:42:53,236 INFO L226 Difference]: Without dead ends: 5165 [2024-10-13 23:42:53,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 544 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:53,239 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:53,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 9 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 23:42:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2024-10-13 23:42:53,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 4275. [2024-10-13 23:42:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.0809546092653253) internal successors, (4620), 4274 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:53,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4620 transitions. [2024-10-13 23:42:53,304 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4620 transitions. Word has length 545 [2024-10-13 23:42:53,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:53,305 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4620 transitions. [2024-10-13 23:42:53,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4620 transitions. [2024-10-13 23:42:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2024-10-13 23:42:53,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:53,311 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:53,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 23:42:53,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:53,512 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:53,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:53,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2010348347, now seen corresponding path program 1 times [2024-10-13 23:42:53,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:53,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561015767] [2024-10-13 23:42:53,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:53,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 943 proven. 11 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-13 23:42:54,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561015767] [2024-10-13 23:42:54,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561015767] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721028322] [2024-10-13 23:42:54,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:54,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:54,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:54,102 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-10-13 23:42:54,104 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-10-13 23:42:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:54,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:54,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1322 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 1053 trivial. 0 not checked. [2024-10-13 23:42:54,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:54,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721028322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:54,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:54,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:42:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672086753] [2024-10-13 23:42:54,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:54,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:54,365 INFO L87 Difference]: Start difference. First operand 4275 states and 4620 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:54,818 INFO L93 Difference]: Finished difference Result 5701 states and 6164 transitions. [2024-10-13 23:42:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:54,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 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 587 [2024-10-13 23:42:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:54,828 INFO L225 Difference]: With dead ends: 5701 [2024-10-13 23:42:54,829 INFO L226 Difference]: Without dead ends: 5699 [2024-10-13 23:42:54,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:54,831 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 145 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:54,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 9 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2024-10-13 23:42:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 4275. [2024-10-13 23:42:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.0809546092653253) internal successors, (4620), 4274 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4620 transitions. [2024-10-13 23:42:54,895 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4620 transitions. Word has length 587 [2024-10-13 23:42:54,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:54,896 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4620 transitions. [2024-10-13 23:42:54,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:54,897 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4620 transitions. [2024-10-13 23:42:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2024-10-13 23:42:54,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:54,904 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:54,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 23:42:55,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 23:42:55,105 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:55,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash -221932975, now seen corresponding path program 1 times [2024-10-13 23:42:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:55,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503488180] [2024-10-13 23:42:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:55,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 944 proven. 11 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-13 23:42:55,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:55,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503488180] [2024-10-13 23:42:55,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503488180] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:55,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480706580] [2024-10-13 23:42:55,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:55,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:55,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:55,681 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-10-13 23:42:55,683 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-10-13 23:42:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:55,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:42:55,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2024-10-13 23:42:55,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:55,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480706580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:55,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:55,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:42:55,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377927544] [2024-10-13 23:42:55,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:55,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:55,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:55,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:55,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:55,947 INFO L87 Difference]: Start difference. First operand 4275 states and 4620 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:56,333 INFO L93 Difference]: Finished difference Result 5523 states and 5970 transitions. [2024-10-13 23:42:56,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:56,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 618 [2024-10-13 23:42:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:56,340 INFO L225 Difference]: With dead ends: 5523 [2024-10-13 23:42:56,341 INFO L226 Difference]: Without dead ends: 5521 [2024-10-13 23:42:56,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:56,342 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 145 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:56,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 9 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2024-10-13 23:42:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 4275. [2024-10-13 23:42:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.0809546092653253) internal successors, (4620), 4274 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4620 transitions. [2024-10-13 23:42:56,427 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4620 transitions. Word has length 618 [2024-10-13 23:42:56,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:56,428 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4620 transitions. [2024-10-13 23:42:56,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4620 transitions. [2024-10-13 23:42:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2024-10-13 23:42:56,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:56,440 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:56,459 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-10-13 23:42:56,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 23:42:56,641 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:56,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:56,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1168413911, now seen corresponding path program 1 times [2024-10-13 23:42:56,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:56,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615683515] [2024-10-13 23:42:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:56,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 944 proven. 11 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-13 23:42:57,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:57,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615683515] [2024-10-13 23:42:57,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615683515] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:57,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380705328] [2024-10-13 23:42:57,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:57,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:57,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:57,285 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-10-13 23:42:57,287 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-10-13 23:42:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:57,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:42:57,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:42:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 639 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 23:42:58,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:42:58,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380705328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:42:58,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:42:58,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-13 23:42:58,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990062732] [2024-10-13 23:42:58,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:42:58,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:42:58,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:42:58,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:42:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:58,534 INFO L87 Difference]: Start difference. First operand 4275 states and 4620 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:42:58,919 INFO L93 Difference]: Finished difference Result 8549 states and 9249 transitions. [2024-10-13 23:42:58,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:42:58,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 627 [2024-10-13 23:42:58,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:42:58,926 INFO L225 Difference]: With dead ends: 8549 [2024-10-13 23:42:58,926 INFO L226 Difference]: Without dead ends: 4453 [2024-10-13 23:42:58,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:42:58,932 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:42:58,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 46 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 23:42:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2024-10-13 23:42:58,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 4453. [2024-10-13 23:42:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0667115902964959) internal successors, (4749), 4452 states have internal predecessors, (4749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4749 transitions. [2024-10-13 23:42:58,985 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4749 transitions. Word has length 627 [2024-10-13 23:42:58,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:42:58,985 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4749 transitions. [2024-10-13 23:42:58,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 2 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:42:58,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4749 transitions. [2024-10-13 23:42:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2024-10-13 23:42:58,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:42:58,996 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:42:59,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 23:42:59,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:59,197 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:42:59,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:42:59,198 INFO L85 PathProgramCache]: Analyzing trace with hash -659767401, now seen corresponding path program 1 times [2024-10-13 23:42:59,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:42:59,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896511371] [2024-10-13 23:42:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:42:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:42:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 1906 proven. 155 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2024-10-13 23:42:59,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:42:59,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896511371] [2024-10-13 23:42:59,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896511371] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:42:59,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570792532] [2024-10-13 23:42:59,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:42:59,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:42:59,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:42:59,807 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:42:59,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 23:43:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:43:00,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:43:00,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:43:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 1906 proven. 155 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2024-10-13 23:43:00,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 23:43:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 1906 proven. 155 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2024-10-13 23:43:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570792532] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 23:43:00,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 23:43:00,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-13 23:43:00,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631165248] [2024-10-13 23:43:00,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 23:43:00,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 23:43:00,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:43:00,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 23:43:00,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:43:00,884 INFO L87 Difference]: Start difference. First operand 4453 states and 4749 transitions. Second operand has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:43:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:43:01,741 INFO L93 Difference]: Finished difference Result 10683 states and 11412 transitions. [2024-10-13 23:43:01,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 23:43:01,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 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 931 [2024-10-13 23:43:01,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:43:01,743 INFO L225 Difference]: With dead ends: 10683 [2024-10-13 23:43:01,743 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:43:01,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1864 GetRequests, 1860 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:43:01,752 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:43:01,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 63 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:43:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:43:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:43:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:43:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:43:01,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 931 [2024-10-13 23:43:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:43:01,754 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:43:01,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.5) internal successors, (927), 6 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:43:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:43:01,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:43:01,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:43:01,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 23:43:01,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 23:43:01,961 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:43:01,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:43:02,563 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:43:02,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:43:02 BoogieIcfgContainer [2024-10-13 23:43:02,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:43:02,590 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:43:02,590 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:43:02,590 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:43:02,590 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:42:37" (3/4) ... [2024-10-13 23:43:02,592 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:43:02,621 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-13 23:43:02,624 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:43:02,625 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:43:02,626 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:43:02,810 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:43:02,811 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:43:02,812 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:43:02,812 INFO L158 Benchmark]: Toolchain (without parser) took 28109.24ms. Allocated memory was 159.4MB in the beginning and 740.3MB in the end (delta: 580.9MB). Free memory was 88.3MB in the beginning and 603.0MB in the end (delta: -514.7MB). Peak memory consumption was 67.2MB. Max. memory is 16.1GB. [2024-10-13 23:43:02,813 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:43:02,813 INFO L158 Benchmark]: CACSL2BoogieTranslator took 667.30ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 114.2MB in the end (delta: -26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 23:43:02,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.23ms. Allocated memory is still 159.4MB. Free memory was 114.2MB in the beginning and 104.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 23:43:02,814 INFO L158 Benchmark]: Boogie Preprocessor took 149.18ms. Allocated memory is still 159.4MB. Free memory was 104.3MB in the beginning and 91.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 23:43:02,815 INFO L158 Benchmark]: RCFGBuilder took 1502.00ms. Allocated memory is still 159.4MB. Free memory was 91.0MB in the beginning and 100.3MB in the end (delta: -9.3MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2024-10-13 23:43:02,815 INFO L158 Benchmark]: TraceAbstraction took 25459.63ms. Allocated memory was 159.4MB in the beginning and 740.3MB in the end (delta: 580.9MB). Free memory was 99.3MB in the beginning and 617.7MB in the end (delta: -518.4MB). Peak memory consumption was 349.9MB. Max. memory is 16.1GB. [2024-10-13 23:43:02,815 INFO L158 Benchmark]: Witness Printer took 222.24ms. Allocated memory is still 740.3MB. Free memory was 617.7MB in the beginning and 603.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 23:43:02,821 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 667.30ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 114.2MB in the end (delta: -26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.23ms. Allocated memory is still 159.4MB. Free memory was 114.2MB in the beginning and 104.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 149.18ms. Allocated memory is still 159.4MB. Free memory was 104.3MB in the beginning and 91.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1502.00ms. Allocated memory is still 159.4MB. Free memory was 91.0MB in the beginning and 100.3MB in the end (delta: -9.3MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25459.63ms. Allocated memory was 159.4MB in the beginning and 740.3MB in the end (delta: 580.9MB). Free memory was 99.3MB in the beginning and 617.7MB in the end (delta: -518.4MB). Peak memory consumption was 349.9MB. Max. memory is 16.1GB. * Witness Printer took 222.24ms. Allocated memory is still 740.3MB. Free memory was 617.7MB in the beginning and 603.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 182]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.8s, OverallIterations: 17, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2071 SdHoareTripleChecker+Valid, 8.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2071 mSDsluCounter, 1526 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 1006 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8921 IncrementalHoareTripleChecker+Invalid, 9927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1006 mSolverCounterUnsat, 1439 mSDtfsCounter, 8921 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5486 GetRequests, 5443 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4453occurred in iteration=16, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 3916 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 11309 NumberOfCodeBlocks, 11309 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 12214 ConstructedInterpolants, 0 QuantifiedInterpolants, 42204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5658 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 26 InterpolantComputations, 16 PerfectInterpolantSequences, 22719/23576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((((a24 == 1) && (10 <= a21)) || ((a24 == 1) && (a21 <= 8))) || ((6 <= a15) && (a24 == 1))) || (((a15 <= 8) && (a21 <= 7)) && (((long long) 49 + a12) <= 0))) || ((a12 <= 80) && (a24 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:43:02,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE