./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/Problem12_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label31.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1ff9f2437b71e741f48db30c539bfb90441ca24112fe46e7e8bfb68c243b80ed --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:23:08,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:23:08,152 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:23:08,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:23:08,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:23:08,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:23:08,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:23:08,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:23:08,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:23:08,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:23:08,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:23:08,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:23:08,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:23:08,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:23:08,188 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:23:08,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:23:08,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:23:08,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:23:08,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:23:08,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:23:08,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:23:08,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:23:08,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:23:08,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:23:08,193 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:23:08,193 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:23:08,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:23:08,194 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:23:08,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:23:08,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:23:08,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:23:08,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:23:08,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:23:08,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:23:08,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:23:08,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:23:08,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:23:08,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:23:08,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:23:08,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:23:08,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:23:08,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:23:08,196 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-clean/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-clean/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 -> 1ff9f2437b71e741f48db30c539bfb90441ca24112fe46e7e8bfb68c243b80ed [2024-10-10 23:23:08,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:23:08,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:23:08,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:23:08,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:23:08,417 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:23:08,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label31.c [2024-10-10 23:23:09,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:23:09,923 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:23:09,924 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label31.c [2024-10-10 23:23:09,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/71722db1f/7b30a133645047afb9c7f654e097d911/FLAG3ec02190c [2024-10-10 23:23:09,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/71722db1f/7b30a133645047afb9c7f654e097d911 [2024-10-10 23:23:09,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:23:09,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:23:09,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:23:09,969 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:23:09,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:23:09,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:23:09" (1/1) ... [2024-10-10 23:23:09,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@530c8ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:09, skipping insertion in model container [2024-10-10 23:23:09,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:23:09" (1/1) ... [2024-10-10 23:23:10,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:23:10,308 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/Problem12_label31.c[7776,7789] [2024-10-10 23:23:10,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:23:10,852 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:23:10,875 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/Problem12_label31.c[7776,7789] [2024-10-10 23:23:11,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:23:11,173 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:23:11,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11 WrapperNode [2024-10-10 23:23:11,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:23:11,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:23:11,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:23:11,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:23:11,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,468 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-10 23:23:11,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:23:11,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:23:11,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:23:11,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:23:11,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,659 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-10 23:23:11,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,781 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,797 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:23:11,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:23:11,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:23:11,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:23:11,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (1/1) ... [2024-10-10 23:23:11,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:23:11,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:23:11,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:23:11,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:23:11,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:23:11,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:23:11,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:23:11,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:23:12,014 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:23:12,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:23:15,379 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-10 23:23:15,379 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:23:15,427 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:23:15,428 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:23:15,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:23:15 BoogieIcfgContainer [2024-10-10 23:23:15,428 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:23:15,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:23:15,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:23:15,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:23:15,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:23:09" (1/3) ... [2024-10-10 23:23:15,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d65627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:23:15, skipping insertion in model container [2024-10-10 23:23:15,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:23:11" (2/3) ... [2024-10-10 23:23:15,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d65627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:23:15, skipping insertion in model container [2024-10-10 23:23:15,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:23:15" (3/3) ... [2024-10-10 23:23:15,440 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label31.c [2024-10-10 23:23:15,455 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:23:15,455 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:23:15,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:23:15,528 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;@7dc4267f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:23:15,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:23:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 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-10 23:23:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-10 23:23:15,542 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:15,542 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:15,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:15,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:15,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2115484114, now seen corresponding path program 1 times [2024-10-10 23:23:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:15,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652541700] [2024-10-10 23:23:15,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:15,739 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-10 23:23:15,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:15,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652541700] [2024-10-10 23:23:15,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652541700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:15,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:15,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:15,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401409298] [2024-10-10 23:23:15,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:15,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:23:15,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:15,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:23:15,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:23:15,774 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 0 states have call successors, (0), 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 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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-10 23:23:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:15,870 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-10 23:23:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:23:15,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-10 23:23:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:15,894 INFO L225 Difference]: With dead ends: 1511 [2024-10-10 23:23:15,894 INFO L226 Difference]: Without dead ends: 754 [2024-10-10 23:23:15,899 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-10 23:23:15,904 INFO L432 NwaCegarLoop]: 1438 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, 1438 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-10 23:23:15,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:23:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-10 23:23:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-10 23:23:15,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 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-10 23:23:15,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-10 23:23:15,985 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 62 [2024-10-10 23:23:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:15,985 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-10 23:23:15,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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-10 23:23:15,986 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-10 23:23:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-10 23:23:15,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:15,988 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:15,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:23:15,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:15,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:15,989 INFO L85 PathProgramCache]: Analyzing trace with hash 534896978, now seen corresponding path program 1 times [2024-10-10 23:23:15,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:15,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622228490] [2024-10-10 23:23:15,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:15,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:16,246 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-10 23:23:16,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622228490] [2024-10-10 23:23:16,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622228490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:16,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:16,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:16,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367315613] [2024-10-10 23:23:16,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:16,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:23:16,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:16,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:23:16,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:23:16,252 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-10 23:23:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:21,078 INFO L93 Difference]: Finished difference Result 3009 states and 5747 transitions. [2024-10-10 23:23:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:23:21,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-10 23:23:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:21,088 INFO L225 Difference]: With dead ends: 3009 [2024-10-10 23:23:21,088 INFO L226 Difference]: Without dead ends: 2256 [2024-10-10 23:23:21,089 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-10 23:23:21,090 INFO L432 NwaCegarLoop]: 673 mSDtfsCounter, 2185 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5355 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 6508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:21,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 691 Invalid, 6508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5355 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-10 23:23:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2024-10-10 23:23:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2256. [2024-10-10 23:23:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.5751662971175167) internal successors, (3552), 2255 states have internal predecessors, (3552), 0 states have call successors, (0), 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-10 23:23:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3552 transitions. [2024-10-10 23:23:21,138 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3552 transitions. Word has length 62 [2024-10-10 23:23:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:21,139 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3552 transitions. [2024-10-10 23:23:21,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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-10 23:23:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3552 transitions. [2024-10-10 23:23:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-10 23:23:21,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:21,143 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:21,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:23:21,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:21,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash 815338690, now seen corresponding path program 1 times [2024-10-10 23:23:21,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:21,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618872292] [2024-10-10 23:23:21,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:21,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:23:21,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:21,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618872292] [2024-10-10 23:23:21,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618872292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:21,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:21,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:21,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637381562] [2024-10-10 23:23:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:21,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:23:21,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:21,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:23:21,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:23:21,419 INFO L87 Difference]: Start difference. First operand 2256 states and 3552 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-10 23:23:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:24,329 INFO L93 Difference]: Finished difference Result 6050 states and 9915 transitions. [2024-10-10 23:23:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:23:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-10-10 23:23:24,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:24,340 INFO L225 Difference]: With dead ends: 6050 [2024-10-10 23:23:24,340 INFO L226 Difference]: Without dead ends: 3758 [2024-10-10 23:23:24,343 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-10 23:23:24,344 INFO L432 NwaCegarLoop]: 672 mSDtfsCounter, 703 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3096 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 3825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:24,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 685 Invalid, 3825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3096 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-10 23:23:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2024-10-10 23:23:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3007. [2024-10-10 23:23:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.4321357285429142) internal successors, (4305), 3006 states have internal predecessors, (4305), 0 states have call successors, (0), 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-10 23:23:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4305 transitions. [2024-10-10 23:23:24,384 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4305 transitions. Word has length 133 [2024-10-10 23:23:24,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:24,385 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4305 transitions. [2024-10-10 23:23:24,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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-10 23:23:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4305 transitions. [2024-10-10 23:23:24,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-10-10 23:23:24,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:24,389 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:24,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:23:24,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:24,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:24,390 INFO L85 PathProgramCache]: Analyzing trace with hash 2061167486, now seen corresponding path program 1 times [2024-10-10 23:23:24,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:24,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798066301] [2024-10-10 23:23:24,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:24,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:24,659 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-10 23:23:24,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:24,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798066301] [2024-10-10 23:23:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798066301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:24,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:23:24,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55049290] [2024-10-10 23:23:24,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:24,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:24,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:24,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:24,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:24,668 INFO L87 Difference]: Start difference. First operand 3007 states and 4305 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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-10 23:23:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:26,860 INFO L93 Difference]: Finished difference Result 8266 states and 11518 transitions. [2024-10-10 23:23:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:26,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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 272 [2024-10-10 23:23:26,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:26,879 INFO L225 Difference]: With dead ends: 8266 [2024-10-10 23:23:26,879 INFO L226 Difference]: Without dead ends: 5260 [2024-10-10 23:23:26,884 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-10 23:23:26,885 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 697 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:26,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 425 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:23:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2024-10-10 23:23:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 5260. [2024-10-10 23:23:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 5259 states have (on average 1.1983266780756798) internal successors, (6302), 5259 states have internal predecessors, (6302), 0 states have call successors, (0), 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-10 23:23:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 6302 transitions. [2024-10-10 23:23:26,950 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 6302 transitions. Word has length 272 [2024-10-10 23:23:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:26,952 INFO L471 AbstractCegarLoop]: Abstraction has 5260 states and 6302 transitions. [2024-10-10 23:23:26,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 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-10 23:23:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 6302 transitions. [2024-10-10 23:23:26,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-10 23:23:26,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:26,956 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:26,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:23:26,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:26,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:26,957 INFO L85 PathProgramCache]: Analyzing trace with hash 194671971, now seen corresponding path program 1 times [2024-10-10 23:23:26,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:26,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848148258] [2024-10-10 23:23:26,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:26,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-10 23:23:27,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:27,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848148258] [2024-10-10 23:23:27,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848148258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:27,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:27,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:27,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185928256] [2024-10-10 23:23:27,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:27,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:23:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:27,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:23:27,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:23:27,337 INFO L87 Difference]: Start difference. First operand 5260 states and 6302 transitions. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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-10 23:23:29,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:29,847 INFO L93 Difference]: Finished difference Result 12060 states and 15067 transitions. [2024-10-10 23:23:29,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:23:29,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 274 [2024-10-10 23:23:29,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:29,867 INFO L225 Difference]: With dead ends: 12060 [2024-10-10 23:23:29,867 INFO L226 Difference]: Without dead ends: 7515 [2024-10-10 23:23:29,874 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-10 23:23:29,875 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 3962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:29,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 323 Invalid, 3962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-10 23:23:29,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7515 states. [2024-10-10 23:23:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7515 to 7513. [2024-10-10 23:23:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7513 states, 7512 states have (on average 1.1813099041533546) internal successors, (8874), 7512 states have internal predecessors, (8874), 0 states have call successors, (0), 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-10 23:23:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 8874 transitions. [2024-10-10 23:23:29,971 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 8874 transitions. Word has length 274 [2024-10-10 23:23:29,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:29,971 INFO L471 AbstractCegarLoop]: Abstraction has 7513 states and 8874 transitions. [2024-10-10 23:23:29,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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-10 23:23:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 8874 transitions. [2024-10-10 23:23:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-10-10 23:23:29,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:29,975 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:29,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:23:29,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:29,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash -640873960, now seen corresponding path program 1 times [2024-10-10 23:23:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876367630] [2024-10-10 23:23:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:30,380 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 23:23:30,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:30,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876367630] [2024-10-10 23:23:30,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876367630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:30,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:30,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:30,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306907814] [2024-10-10 23:23:30,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:30,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:30,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:30,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:30,383 INFO L87 Difference]: Start difference. First operand 7513 states and 8874 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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-10 23:23:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:32,545 INFO L93 Difference]: Finished difference Result 16527 states and 20145 transitions. [2024-10-10 23:23:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:32,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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 351 [2024-10-10 23:23:32,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:32,576 INFO L225 Difference]: With dead ends: 16527 [2024-10-10 23:23:32,577 INFO L226 Difference]: Without dead ends: 9766 [2024-10-10 23:23:32,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-10 23:23:32,586 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 825 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 989 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 989 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:32,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 137 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [989 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:23:32,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2024-10-10 23:23:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 9766. [2024-10-10 23:23:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.207373271889401) internal successors, (11790), 9765 states have internal predecessors, (11790), 0 states have call successors, (0), 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-10 23:23:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 11790 transitions. [2024-10-10 23:23:32,739 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 11790 transitions. Word has length 351 [2024-10-10 23:23:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:32,740 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 11790 transitions. [2024-10-10 23:23:32,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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-10 23:23:32,741 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 11790 transitions. [2024-10-10 23:23:32,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-10-10 23:23:32,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:32,748 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:23:32,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:23:32,748 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:32,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1142401748, now seen corresponding path program 1 times [2024-10-10 23:23:32,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:32,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965283107] [2024-10-10 23:23:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-10 23:23:32,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:32,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965283107] [2024-10-10 23:23:32,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965283107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:32,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:32,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313062853] [2024-10-10 23:23:32,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:32,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:32,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:32,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:32,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:32,954 INFO L87 Difference]: Start difference. First operand 9766 states and 11790 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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-10 23:23:34,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:34,843 INFO L93 Difference]: Finished difference Result 21033 states and 25743 transitions. [2024-10-10 23:23:34,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:34,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 375 [2024-10-10 23:23:34,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:34,863 INFO L225 Difference]: With dead ends: 21033 [2024-10-10 23:23:34,863 INFO L226 Difference]: Without dead ends: 12019 [2024-10-10 23:23:34,873 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-10 23:23:34,873 INFO L432 NwaCegarLoop]: 1194 mSDtfsCounter, 680 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:34,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1201 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-10 23:23:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12019 states. [2024-10-10 23:23:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12019 to 12019. [2024-10-10 23:23:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12019 states, 12018 states have (on average 1.1927109335996007) internal successors, (14334), 12018 states have internal predecessors, (14334), 0 states have call successors, (0), 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-10 23:23:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12019 states to 12019 states and 14334 transitions. [2024-10-10 23:23:35,065 INFO L78 Accepts]: Start accepts. Automaton has 12019 states and 14334 transitions. Word has length 375 [2024-10-10 23:23:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:35,066 INFO L471 AbstractCegarLoop]: Abstraction has 12019 states and 14334 transitions. [2024-10-10 23:23:35,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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-10 23:23:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 12019 states and 14334 transitions. [2024-10-10 23:23:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-10-10 23:23:35,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:35,072 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:23:35,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:23:35,073 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:35,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:35,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1897117049, now seen corresponding path program 1 times [2024-10-10 23:23:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:35,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996203548] [2024-10-10 23:23:35,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:35,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-10 23:23:35,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:35,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996203548] [2024-10-10 23:23:35,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996203548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:35,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:35,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:35,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796500494] [2024-10-10 23:23:35,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:35,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:35,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:35,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:35,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:35,340 INFO L87 Difference]: Start difference. First operand 12019 states and 14334 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-10 23:23:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:37,601 INFO L93 Difference]: Finished difference Result 33800 states and 40732 transitions. [2024-10-10 23:23:37,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:37,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 389 [2024-10-10 23:23:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:37,634 INFO L225 Difference]: With dead ends: 33800 [2024-10-10 23:23:37,635 INFO L226 Difference]: Without dead ends: 22533 [2024-10-10 23:23:37,649 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-10 23:23:37,650 INFO L432 NwaCegarLoop]: 1256 mSDtfsCounter, 636 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:37,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1262 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:23:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22533 states. [2024-10-10 23:23:37,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22533 to 21782. [2024-10-10 23:23:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21782 states, 21781 states have (on average 1.1792387860979754) internal successors, (25685), 21781 states have internal predecessors, (25685), 0 states have call successors, (0), 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-10 23:23:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21782 states to 21782 states and 25685 transitions. [2024-10-10 23:23:37,921 INFO L78 Accepts]: Start accepts. Automaton has 21782 states and 25685 transitions. Word has length 389 [2024-10-10 23:23:37,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:37,921 INFO L471 AbstractCegarLoop]: Abstraction has 21782 states and 25685 transitions. [2024-10-10 23:23:37,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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-10 23:23:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 21782 states and 25685 transitions. [2024-10-10 23:23:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2024-10-10 23:23:37,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:37,927 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:23:37,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:23:37,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:37,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1638091624, now seen corresponding path program 1 times [2024-10-10 23:23:37,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:37,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702865483] [2024-10-10 23:23:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:38,430 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 83 proven. 99 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-10 23:23:38,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702865483] [2024-10-10 23:23:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702865483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:23:38,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990084300] [2024-10-10 23:23:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:38,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:23:38,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:23:38,434 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:23:38,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:23:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:38,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:23:38,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:23:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-10 23:23:38,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:23:38,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990084300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:38,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:23:38,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-10 23:23:38,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7793223] [2024-10-10 23:23:38,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:38,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:38,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:38,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:38,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:23:38,672 INFO L87 Difference]: Start difference. First operand 21782 states and 25685 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-10 23:23:41,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:41,053 INFO L93 Difference]: Finished difference Result 51073 states and 61071 transitions. [2024-10-10 23:23:41,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:41,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 390 [2024-10-10 23:23:41,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:41,101 INFO L225 Difference]: With dead ends: 51073 [2024-10-10 23:23:41,101 INFO L226 Difference]: Without dead ends: 30043 [2024-10-10 23:23:41,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-10 23:23:41,126 INFO L432 NwaCegarLoop]: 1313 mSDtfsCounter, 700 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:41,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1320 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:23:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30043 states. [2024-10-10 23:23:41,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30043 to 29292. [2024-10-10 23:23:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29292 states, 29291 states have (on average 1.1817281758902052) internal successors, (34614), 29291 states have internal predecessors, (34614), 0 states have call successors, (0), 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-10 23:23:41,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29292 states to 29292 states and 34614 transitions. [2024-10-10 23:23:41,430 INFO L78 Accepts]: Start accepts. Automaton has 29292 states and 34614 transitions. Word has length 390 [2024-10-10 23:23:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:41,430 INFO L471 AbstractCegarLoop]: Abstraction has 29292 states and 34614 transitions. [2024-10-10 23:23:41,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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-10 23:23:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 29292 states and 34614 transitions. [2024-10-10 23:23:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-10-10 23:23:41,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:41,434 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:41,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:23:41,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:23:41,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:41,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1592853181, now seen corresponding path program 1 times [2024-10-10 23:23:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:41,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355252671] [2024-10-10 23:23:41,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-10 23:23:41,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:41,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355252671] [2024-10-10 23:23:41,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355252671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:41,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:41,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065873252] [2024-10-10 23:23:41,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:41,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:41,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:41,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:41,912 INFO L87 Difference]: Start difference. First operand 29292 states and 34614 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:44,096 INFO L93 Difference]: Finished difference Result 83366 states and 99186 transitions. [2024-10-10 23:23:44,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:44,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 393 [2024-10-10 23:23:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:44,149 INFO L225 Difference]: With dead ends: 83366 [2024-10-10 23:23:44,149 INFO L226 Difference]: Without dead ends: 50320 [2024-10-10 23:23:44,176 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-10 23:23:44,176 INFO L432 NwaCegarLoop]: 1306 mSDtfsCounter, 722 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 2835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:44,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1313 Invalid, 2835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 2224 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:23:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50320 states. [2024-10-10 23:23:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50320 to 49569. [2024-10-10 23:23:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49569 states, 49568 states have (on average 1.138234344738541) internal successors, (56420), 49568 states have internal predecessors, (56420), 0 states have call successors, (0), 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-10 23:23:44,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49569 states to 49569 states and 56420 transitions. [2024-10-10 23:23:44,809 INFO L78 Accepts]: Start accepts. Automaton has 49569 states and 56420 transitions. Word has length 393 [2024-10-10 23:23:44,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:44,810 INFO L471 AbstractCegarLoop]: Abstraction has 49569 states and 56420 transitions. [2024-10-10 23:23:44,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:23:44,810 INFO L276 IsEmpty]: Start isEmpty. Operand 49569 states and 56420 transitions. [2024-10-10 23:23:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2024-10-10 23:23:44,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:44,817 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:44,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:23:44,818 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:44,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:44,818 INFO L85 PathProgramCache]: Analyzing trace with hash -84651708, now seen corresponding path program 1 times [2024-10-10 23:23:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148492115] [2024-10-10 23:23:44,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-10 23:23:45,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:45,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148492115] [2024-10-10 23:23:45,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148492115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:45,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:45,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:45,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913392809] [2024-10-10 23:23:45,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:45,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:45,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:45,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:45,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:45,063 INFO L87 Difference]: Start difference. First operand 49569 states and 56420 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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-10 23:23:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:47,209 INFO L93 Difference]: Finished difference Result 98386 states and 112083 transitions. [2024-10-10 23:23:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:47,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 422 [2024-10-10 23:23:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:47,270 INFO L225 Difference]: With dead ends: 98386 [2024-10-10 23:23:47,270 INFO L226 Difference]: Without dead ends: 49569 [2024-10-10 23:23:47,304 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-10 23:23:47,305 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 669 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 2644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:47,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1259 Invalid, 2644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:23:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49569 states. [2024-10-10 23:23:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49569 to 48067. [2024-10-10 23:23:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48067 states, 48066 states have (on average 1.100486830607914) internal successors, (52896), 48066 states have internal predecessors, (52896), 0 states have call successors, (0), 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-10 23:23:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48067 states to 48067 states and 52896 transitions. [2024-10-10 23:23:48,126 INFO L78 Accepts]: Start accepts. Automaton has 48067 states and 52896 transitions. Word has length 422 [2024-10-10 23:23:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:48,127 INFO L471 AbstractCegarLoop]: Abstraction has 48067 states and 52896 transitions. [2024-10-10 23:23:48,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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-10 23:23:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 48067 states and 52896 transitions. [2024-10-10 23:23:48,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2024-10-10 23:23:48,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:48,138 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:48,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:23:48,138 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:48,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1549593847, now seen corresponding path program 1 times [2024-10-10 23:23:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:48,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138269049] [2024-10-10 23:23:48,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-10 23:23:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138269049] [2024-10-10 23:23:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138269049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:48,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:48,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:48,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207862813] [2024-10-10 23:23:48,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:48,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:48,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:48,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:48,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:48,318 INFO L87 Difference]: Start difference. First operand 48067 states and 52896 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-10 23:23:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:50,534 INFO L93 Difference]: Finished difference Result 95382 states and 105035 transitions. [2024-10-10 23:23:50,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:50,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 456 [2024-10-10 23:23:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:50,582 INFO L225 Difference]: With dead ends: 95382 [2024-10-10 23:23:50,582 INFO L226 Difference]: Without dead ends: 48067 [2024-10-10 23:23:50,611 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-10 23:23:50,611 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 683 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2434 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:50,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 297 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2434 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:23:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48067 states. [2024-10-10 23:23:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48067 to 48067. [2024-10-10 23:23:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48067 states, 48066 states have (on average 1.0971372695876502) internal successors, (52735), 48066 states have internal predecessors, (52735), 0 states have call successors, (0), 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-10 23:23:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48067 states to 48067 states and 52735 transitions. [2024-10-10 23:23:51,222 INFO L78 Accepts]: Start accepts. Automaton has 48067 states and 52735 transitions. Word has length 456 [2024-10-10 23:23:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:51,222 INFO L471 AbstractCegarLoop]: Abstraction has 48067 states and 52735 transitions. [2024-10-10 23:23:51,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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-10 23:23:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 48067 states and 52735 transitions. [2024-10-10 23:23:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2024-10-10 23:23:51,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:51,231 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:23:51,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:23:51,232 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:51,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:51,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2121547722, now seen corresponding path program 1 times [2024-10-10 23:23:51,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:51,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972827894] [2024-10-10 23:23:51,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:51,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-10-10 23:23:51,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:51,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972827894] [2024-10-10 23:23:51,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972827894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:51,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:51,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:51,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838134129] [2024-10-10 23:23:51,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:51,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:51,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:51,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:51,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:51,572 INFO L87 Difference]: Start difference. First operand 48067 states and 52735 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-10 23:23:53,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:53,850 INFO L93 Difference]: Finished difference Result 97635 states and 107043 transitions. [2024-10-10 23:23:53,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:53,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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 461 [2024-10-10 23:23:53,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:53,896 INFO L225 Difference]: With dead ends: 97635 [2024-10-10 23:23:53,897 INFO L226 Difference]: Without dead ends: 50320 [2024-10-10 23:23:53,921 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-10 23:23:53,921 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 704 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 2909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:53,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 215 Invalid, 2909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:23:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50320 states. [2024-10-10 23:23:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50320 to 46565. [2024-10-10 23:23:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46565 states, 46564 states have (on average 1.095009019843656) internal successors, (50988), 46564 states have internal predecessors, (50988), 0 states have call successors, (0), 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-10 23:23:54,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46565 states to 46565 states and 50988 transitions. [2024-10-10 23:23:54,441 INFO L78 Accepts]: Start accepts. Automaton has 46565 states and 50988 transitions. Word has length 461 [2024-10-10 23:23:54,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:54,442 INFO L471 AbstractCegarLoop]: Abstraction has 46565 states and 50988 transitions. [2024-10-10 23:23:54,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 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-10 23:23:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 46565 states and 50988 transitions. [2024-10-10 23:23:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-10-10 23:23:54,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:54,451 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, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:54,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:23:54,451 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:54,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1132486164, now seen corresponding path program 1 times [2024-10-10 23:23:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:54,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092273021] [2024-10-10 23:23:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-10-10 23:23:54,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092273021] [2024-10-10 23:23:54,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092273021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:54,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:54,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64013496] [2024-10-10 23:23:54,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:54,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:54,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:54,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:54,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:54,799 INFO L87 Difference]: Start difference. First operand 46565 states and 50988 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-10 23:23:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:23:57,123 INFO L93 Difference]: Finished difference Result 114908 states and 127019 transitions. [2024-10-10 23:23:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:23:57,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 472 [2024-10-10 23:23:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:23:57,199 INFO L225 Difference]: With dead ends: 114908 [2024-10-10 23:23:57,199 INFO L226 Difference]: Without dead ends: 69095 [2024-10-10 23:23:57,232 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-10 23:23:57,233 INFO L432 NwaCegarLoop]: 1249 mSDtfsCounter, 710 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 676 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:23:57,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1256 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [676 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:23:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69095 states. [2024-10-10 23:23:57,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69095 to 66091. [2024-10-10 23:23:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66091 states, 66090 states have (on average 1.0850355575730064) internal successors, (71710), 66090 states have internal predecessors, (71710), 0 states have call successors, (0), 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-10 23:23:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66091 states to 66091 states and 71710 transitions. [2024-10-10 23:23:58,071 INFO L78 Accepts]: Start accepts. Automaton has 66091 states and 71710 transitions. Word has length 472 [2024-10-10 23:23:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:23:58,071 INFO L471 AbstractCegarLoop]: Abstraction has 66091 states and 71710 transitions. [2024-10-10 23:23:58,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-10 23:23:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 66091 states and 71710 transitions. [2024-10-10 23:23:58,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2024-10-10 23:23:58,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:23:58,082 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, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:23:58,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:23:58,082 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:23:58,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:23:58,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1773092031, now seen corresponding path program 1 times [2024-10-10 23:23:58,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:23:58,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665446105] [2024-10-10 23:23:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:23:58,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:23:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:23:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2024-10-10 23:23:58,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:23:58,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665446105] [2024-10-10 23:23:58,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665446105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:23:58,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:23:58,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:23:58,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432401921] [2024-10-10 23:23:58,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:23:58,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:23:58,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:23:58,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:23:58,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:23:58,407 INFO L87 Difference]: Start difference. First operand 66091 states and 71710 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-10 23:24:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:00,850 INFO L93 Difference]: Finished difference Result 177241 states and 192751 transitions. [2024-10-10 23:24:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:00,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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 499 [2024-10-10 23:24:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:00,968 INFO L225 Difference]: With dead ends: 177241 [2024-10-10 23:24:00,968 INFO L226 Difference]: Without dead ends: 111902 [2024-10-10 23:24:01,007 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-10 23:24:01,007 INFO L432 NwaCegarLoop]: 1242 mSDtfsCounter, 663 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 2791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:01,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1249 Invalid, 2791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-10 23:24:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111902 states. [2024-10-10 23:24:02,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111902 to 101388. [2024-10-10 23:24:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101388 states, 101387 states have (on average 1.072326826910748) internal successors, (108720), 101387 states have internal predecessors, (108720), 0 states have call successors, (0), 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-10 23:24:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101388 states to 101388 states and 108720 transitions. [2024-10-10 23:24:02,582 INFO L78 Accepts]: Start accepts. Automaton has 101388 states and 108720 transitions. Word has length 499 [2024-10-10 23:24:02,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:02,582 INFO L471 AbstractCegarLoop]: Abstraction has 101388 states and 108720 transitions. [2024-10-10 23:24:02,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 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-10 23:24:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand 101388 states and 108720 transitions. [2024-10-10 23:24:02,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2024-10-10 23:24:02,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:02,594 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:24:02,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:24:02,594 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:02,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash 429411364, now seen corresponding path program 1 times [2024-10-10 23:24:02,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:02,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923963178] [2024-10-10 23:24:02,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:02,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-10-10 23:24:02,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:02,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923963178] [2024-10-10 23:24:02,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923963178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:02,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:02,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:02,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988785697] [2024-10-10 23:24:02,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:02,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:02,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:02,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:02,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:02,772 INFO L87 Difference]: Start difference. First operand 101388 states and 108720 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 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-10 23:24:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:05,259 INFO L93 Difference]: Finished difference Result 218546 states and 234635 transitions. [2024-10-10 23:24:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:05,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 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 553 [2024-10-10 23:24:05,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:05,398 INFO L225 Difference]: With dead ends: 218546 [2024-10-10 23:24:05,398 INFO L226 Difference]: Without dead ends: 117910 [2024-10-10 23:24:05,436 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-10 23:24:05,436 INFO L432 NwaCegarLoop]: 1107 mSDtfsCounter, 811 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:05,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1114 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2161 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-10 23:24:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117910 states. [2024-10-10 23:24:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117910 to 117159. [2024-10-10 23:24:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117159 states, 117158 states have (on average 1.068300926953345) internal successors, (125160), 117158 states have internal predecessors, (125160), 0 states have call successors, (0), 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-10 23:24:06,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117159 states to 117159 states and 125160 transitions. [2024-10-10 23:24:06,989 INFO L78 Accepts]: Start accepts. Automaton has 117159 states and 125160 transitions. Word has length 553 [2024-10-10 23:24:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:06,990 INFO L471 AbstractCegarLoop]: Abstraction has 117159 states and 125160 transitions. [2024-10-10 23:24:06,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 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-10 23:24:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 117159 states and 125160 transitions. [2024-10-10 23:24:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2024-10-10 23:24:07,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:07,025 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:24:07,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:24:07,025 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:07,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:07,025 INFO L85 PathProgramCache]: Analyzing trace with hash 547904453, now seen corresponding path program 1 times [2024-10-10 23:24:07,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:07,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659348269] [2024-10-10 23:24:07,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:07,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 610 proven. 108 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-10 23:24:08,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:08,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659348269] [2024-10-10 23:24:08,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659348269] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:24:08,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764861085] [2024-10-10 23:24:08,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:08,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:08,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:24:08,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:24:08,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:24:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:08,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 23:24:08,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:24:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 720 proven. 108 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-10 23:24:08,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:24:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 720 proven. 108 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-10 23:24:09,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764861085] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:24:09,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:24:09,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 5 [2024-10-10 23:24:09,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700951060] [2024-10-10 23:24:09,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:24:09,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 23:24:09,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:09,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 23:24:09,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:24:09,708 INFO L87 Difference]: Start difference. First operand 117159 states and 125160 transitions. Second operand has 6 states, 6 states have (on average 137.33333333333334) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 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-10 23:24:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:15,675 INFO L93 Difference]: Finished difference Result 247084 states and 263703 transitions. [2024-10-10 23:24:15,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:24:15,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 137.33333333333334) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 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 906 [2024-10-10 23:24:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:15,834 INFO L225 Difference]: With dead ends: 247084 [2024-10-10 23:24:15,834 INFO L226 Difference]: Without dead ends: 129926 [2024-10-10 23:24:15,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1816 GetRequests, 1809 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:24:15,884 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 5201 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 7677 mSolverCounterSat, 1137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5201 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 8814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1137 IncrementalHoareTripleChecker+Valid, 7677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:15,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5201 Valid, 90 Invalid, 8814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1137 Valid, 7677 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-10 23:24:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129926 states. [2024-10-10 23:24:17,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129926 to 119412. [2024-10-10 23:24:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119412 states, 119411 states have (on average 1.056359966837226) internal successors, (126141), 119411 states have internal predecessors, (126141), 0 states have call successors, (0), 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-10 23:24:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119412 states to 119412 states and 126141 transitions. [2024-10-10 23:24:17,472 INFO L78 Accepts]: Start accepts. Automaton has 119412 states and 126141 transitions. Word has length 906 [2024-10-10 23:24:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:17,472 INFO L471 AbstractCegarLoop]: Abstraction has 119412 states and 126141 transitions. [2024-10-10 23:24:17,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.33333333333334) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 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-10 23:24:17,473 INFO L276 IsEmpty]: Start isEmpty. Operand 119412 states and 126141 transitions. [2024-10-10 23:24:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1018 [2024-10-10 23:24:17,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:17,507 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:24:17,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:24:17,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 23:24:17,708 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:17,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2082740414, now seen corresponding path program 1 times [2024-10-10 23:24:17,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:17,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446281541] [2024-10-10 23:24:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:17,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 940 proven. 14 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-10-10 23:24:18,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:18,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446281541] [2024-10-10 23:24:18,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446281541] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:24:18,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462265942] [2024-10-10 23:24:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:18,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:18,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:24:18,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:24:18,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:24:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:18,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 1206 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:24:18,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:24:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 940 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-10-10 23:24:19,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:24:19,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462265942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:19,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:24:19,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:24:19,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791948370] [2024-10-10 23:24:19,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:19,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:19,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:24:19,292 INFO L87 Difference]: Start difference. First operand 119412 states and 126141 transitions. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 2 states have internal predecessors, (599), 0 states have call successors, (0), 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-10 23:24:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:21,898 INFO L93 Difference]: Finished difference Result 238823 states and 252279 transitions. [2024-10-10 23:24:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:21,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 2 states have internal predecessors, (599), 0 states have call successors, (0), 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 1017 [2024-10-10 23:24:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:22,029 INFO L225 Difference]: With dead ends: 238823 [2024-10-10 23:24:22,029 INFO L226 Difference]: Without dead ends: 120163 [2024-10-10 23:24:22,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 1016 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-10 23:24:22,056 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 637 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2203 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:22,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 404 Invalid, 2495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 2203 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-10 23:24:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120163 states. [2024-10-10 23:24:23,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120163 to 118661. [2024-10-10 23:24:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118661 states, 118660 states have (on average 1.0441597842575425) internal successors, (123900), 118660 states have internal predecessors, (123900), 0 states have call successors, (0), 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-10 23:24:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118661 states to 118661 states and 123900 transitions. [2024-10-10 23:24:23,236 INFO L78 Accepts]: Start accepts. Automaton has 118661 states and 123900 transitions. Word has length 1017 [2024-10-10 23:24:23,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:23,236 INFO L471 AbstractCegarLoop]: Abstraction has 118661 states and 123900 transitions. [2024-10-10 23:24:23,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 2 states have internal predecessors, (599), 0 states have call successors, (0), 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-10 23:24:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 118661 states and 123900 transitions. [2024-10-10 23:24:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1038 [2024-10-10 23:24:23,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:23,276 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:24:23,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:24:23,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:24:23,477 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:23,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:23,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2056483724, now seen corresponding path program 1 times [2024-10-10 23:24:23,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:23,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078474672] [2024-10-10 23:24:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:23,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1581 backedges. 1219 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-10-10 23:24:24,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:24,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078474672] [2024-10-10 23:24:24,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078474672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:24,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:24,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:24,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525511714] [2024-10-10 23:24:24,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:24,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:24,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:24,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:24,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:24,638 INFO L87 Difference]: Start difference. First operand 118661 states and 123900 transitions. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 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-10 23:24:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:24:27,557 INFO L93 Difference]: Finished difference Result 279377 states and 292274 transitions. [2024-10-10 23:24:27,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:24:27,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 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 1037 [2024-10-10 23:24:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:24:27,765 INFO L225 Difference]: With dead ends: 279377 [2024-10-10 23:24:27,766 INFO L226 Difference]: Without dead ends: 161468 [2024-10-10 23:24:27,819 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-10 23:24:27,820 INFO L432 NwaCegarLoop]: 1360 mSDtfsCounter, 606 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2323 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 2323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-10 23:24:27,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 1367 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 2323 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-10 23:24:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161468 states. [2024-10-10 23:24:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161468 to 156211. [2024-10-10 23:24:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156211 states, 156210 states have (on average 1.0391076115485565) internal successors, (162319), 156210 states have internal predecessors, (162319), 0 states have call successors, (0), 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-10 23:24:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156211 states to 156211 states and 162319 transitions. [2024-10-10 23:24:29,889 INFO L78 Accepts]: Start accepts. Automaton has 156211 states and 162319 transitions. Word has length 1037 [2024-10-10 23:24:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:24:29,889 INFO L471 AbstractCegarLoop]: Abstraction has 156211 states and 162319 transitions. [2024-10-10 23:24:29,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 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-10 23:24:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 156211 states and 162319 transitions. [2024-10-10 23:24:29,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1063 [2024-10-10 23:24:29,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:24:29,937 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 23:24:29,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:24:29,938 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:24:29,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:24:29,938 INFO L85 PathProgramCache]: Analyzing trace with hash 45966080, now seen corresponding path program 1 times [2024-10-10 23:24:29,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:24:29,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151371071] [2024-10-10 23:24:29,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:24:29,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:24:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:24:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1627 backedges. 1225 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-10-10 23:24:30,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:24:30,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151371071] [2024-10-10 23:24:30,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151371071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:24:30,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:24:30,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:24:30,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731106703] [2024-10-10 23:24:30,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:24:30,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:24:30,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:24:30,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:24:30,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:24:30,903 INFO L87 Difference]: Start difference. First operand 156211 states and 162319 transitions. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)