./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_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label41.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdbc0fdc55527506c6212fedb75f15bc177498c1e0d7baa5a0c1614f273a6557 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:33:29,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:33:29,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:33:29,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:33:29,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:33:29,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:33:29,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:33:29,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:33:29,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:33:29,728 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:33:29,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:33:29,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:33:29,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:33:29,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:33:29,730 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:33:29,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:33:29,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:33:29,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:33:29,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:33:29,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:33:29,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:33:29,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:33:29,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:33:29,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:33:29,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:33:29,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:33:29,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:33:29,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:33:29,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:33:29,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:33:29,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:33:29,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:33:29,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:33:29,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:33:29,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:33:29,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:33:29,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:33:29,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:33:29,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:33:29,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:33:29,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:33:29,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:33:29,738 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fdbc0fdc55527506c6212fedb75f15bc177498c1e0d7baa5a0c1614f273a6557 [2024-10-13 23:33:29,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:33:30,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:33:30,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:33:30,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:33:30,022 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:33:30,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label41.c [2024-10-13 23:33:31,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:33:31,905 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:33:31,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label41.c [2024-10-13 23:33:31,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014dac6b7/714278e7ca5f4e2da2308e4a211527a2/FLAG5676fc8ee [2024-10-13 23:33:31,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/014dac6b7/714278e7ca5f4e2da2308e4a211527a2 [2024-10-13 23:33:31,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:33:31,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:33:31,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:33:31,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:33:31,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:33:31,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:33:31" (1/1) ... [2024-10-13 23:33:31,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dfef1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:31, skipping insertion in model container [2024-10-13 23:33:31,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:33:31" (1/1) ... [2024-10-13 23:33:32,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:33:32,292 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_label41.c[6479,6492] [2024-10-13 23:33:32,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:33:32,985 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:33:33,010 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_label41.c[6479,6492] [2024-10-13 23:33:33,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:33:33,438 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:33:33,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33 WrapperNode [2024-10-13 23:33:33,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:33:33,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:33:33,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:33:33,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:33:33,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:33,501 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:33,802 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-13 23:33:33,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:33:33,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:33:33,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:33:33,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:33:33,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:33,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:33,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:34,041 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:33:34,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:34,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:34,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:34,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:34,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:34,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:34,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:33:34,341 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:33:34,341 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:33:34,341 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:33:34,342 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (1/1) ... [2024-10-13 23:33:34,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:33:34,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:33:34,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:33:34,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:33:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:33:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:33:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:33:34,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:33:34,500 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:33:34,502 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:33:38,578 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-13 23:33:38,578 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:33:38,651 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:33:38,651 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:33:38,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:33:38 BoogieIcfgContainer [2024-10-13 23:33:38,652 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:33:38,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:33:38,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:33:38,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:33:38,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:33:31" (1/3) ... [2024-10-13 23:33:38,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5ab564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:33:38, skipping insertion in model container [2024-10-13 23:33:38,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:33:33" (2/3) ... [2024-10-13 23:33:38,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5ab564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:33:38, skipping insertion in model container [2024-10-13 23:33:38,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:33:38" (3/3) ... [2024-10-13 23:33:38,661 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label41.c [2024-10-13 23:33:38,679 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:33:38,680 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:33:38,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:33:38,777 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;@43460b94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:33:38,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:33:38,785 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-13 23:33:38,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 23:33:38,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:38,793 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] [2024-10-13 23:33:38,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:38,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1322606206, now seen corresponding path program 1 times [2024-10-13 23:33:38,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:38,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404848340] [2024-10-13 23:33:38,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:38,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:33:39,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:39,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404848340] [2024-10-13 23:33:39,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404848340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:39,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:39,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:33:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175938884] [2024-10-13 23:33:39,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:39,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:33:39,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:39,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:33:39,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:33:39,047 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:39,147 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-13 23:33:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:33:39,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-13 23:33:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:39,168 INFO L225 Difference]: With dead ends: 1511 [2024-10-13 23:33:39,168 INFO L226 Difference]: Without dead ends: 754 [2024-10-13 23:33:39,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:33:39,177 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-13 23:33:39,180 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-13 23:33:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-13 23:33:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-13 23:33:39,255 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-13 23:33:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-13 23:33:39,258 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 51 [2024-10-13 23:33:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:39,259 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-13 23:33:39,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:39,259 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-13 23:33:39,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-13 23:33:39,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:39,261 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] [2024-10-13 23:33:39,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:33:39,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:39,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1317432415, now seen corresponding path program 1 times [2024-10-13 23:33:39,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:39,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146329893] [2024-10-13 23:33:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:39,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:33:39,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:39,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146329893] [2024-10-13 23:33:39,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146329893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:39,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:39,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:33:39,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204507399] [2024-10-13 23:33:39,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:39,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:39,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:39,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:39,479 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:42,627 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-13 23:33:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:42,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-10-13 23:33:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:42,642 INFO L225 Difference]: With dead ends: 2258 [2024-10-13 23:33:42,642 INFO L226 Difference]: Without dead ends: 1505 [2024-10-13 23:33:42,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:42,647 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 766 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:42,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 426 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:33:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-13 23:33:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-13 23:33:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions. [2024-10-13 23:33:42,698 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 51 [2024-10-13 23:33:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:42,699 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions. [2024-10-13 23:33:42,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions. [2024-10-13 23:33:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-13 23:33:42,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:42,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:33:42,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:33:42,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:42,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1174627794, now seen corresponding path program 1 times [2024-10-13 23:33:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:42,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502265094] [2024-10-13 23:33:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:42,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:33:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:43,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502265094] [2024-10-13 23:33:43,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502265094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:43,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:43,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:43,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083025155] [2024-10-13 23:33:43,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:43,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:33:43,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:43,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:33:43,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:33:43,094 INFO L87 Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:46,846 INFO L93 Difference]: Finished difference Result 4548 states and 7429 transitions. [2024-10-13 23:33:46,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:33:46,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-10-13 23:33:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:46,858 INFO L225 Difference]: With dead ends: 4548 [2024-10-13 23:33:46,858 INFO L226 Difference]: Without dead ends: 3007 [2024-10-13 23:33:46,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:33:46,862 INFO L432 NwaCegarLoop]: 636 mSDtfsCounter, 703 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 3804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:46,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 649 Invalid, 3804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 23:33:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-13 23:33:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2024-10-13 23:33:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.3416500332667998) internal successors, (4033), 3006 states have internal predecessors, (4033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4033 transitions. [2024-10-13 23:33:46,919 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4033 transitions. Word has length 122 [2024-10-13 23:33:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:46,919 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4033 transitions. [2024-10-13 23:33:46,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4033 transitions. [2024-10-13 23:33:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-13 23:33:46,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:46,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:33:46,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:33:46,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:46,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:46,924 INFO L85 PathProgramCache]: Analyzing trace with hash 678642099, now seen corresponding path program 1 times [2024-10-13 23:33:46,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:46,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64557890] [2024-10-13 23:33:46,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:33:47,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:47,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64557890] [2024-10-13 23:33:47,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64557890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:47,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:47,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:47,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670941247] [2024-10-13 23:33:47,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:47,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:33:47,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:47,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:33:47,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:33:47,282 INFO L87 Difference]: Start difference. First operand 3007 states and 4033 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:51,070 INFO L93 Difference]: Finished difference Result 9768 states and 12891 transitions. [2024-10-13 23:33:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:33:51,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2024-10-13 23:33:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:51,097 INFO L225 Difference]: With dead ends: 9768 [2024-10-13 23:33:51,098 INFO L226 Difference]: Without dead ends: 6762 [2024-10-13 23:33:51,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:33:51,107 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 2092 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 4274 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 4841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 4274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:51,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2092 Valid, 450 Invalid, 4841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 4274 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-13 23:33:51,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2024-10-13 23:33:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6762. [2024-10-13 23:33:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 6761 states have (on average 1.2873835231474633) internal successors, (8704), 6761 states have internal predecessors, (8704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:51,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 8704 transitions. [2024-10-13 23:33:51,240 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 8704 transitions. Word has length 160 [2024-10-13 23:33:51,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:51,241 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 8704 transitions. [2024-10-13 23:33:51,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 8704 transitions. [2024-10-13 23:33:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-10-13 23:33:51,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:51,247 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, 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] [2024-10-13 23:33:51,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:33:51,248 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:51,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:51,248 INFO L85 PathProgramCache]: Analyzing trace with hash -779084336, now seen corresponding path program 1 times [2024-10-13 23:33:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304639276] [2024-10-13 23:33:51,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:51,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-13 23:33:51,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:51,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304639276] [2024-10-13 23:33:51,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304639276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:51,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:51,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:51,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414040551] [2024-10-13 23:33:51,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:51,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:33:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:51,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:33:51,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:33:51,681 INFO L87 Difference]: Start difference. First operand 6762 states and 8704 transitions. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:54,764 INFO L93 Difference]: Finished difference Result 15815 states and 21392 transitions. [2024-10-13 23:33:54,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:33:54,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 263 [2024-10-13 23:33:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:54,789 INFO L225 Difference]: With dead ends: 15815 [2024-10-13 23:33:54,789 INFO L226 Difference]: Without dead ends: 9768 [2024-10-13 23:33:54,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:33:54,799 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 4019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:54,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 489 Invalid, 4019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3466 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 23:33:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9768 states. [2024-10-13 23:33:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9768 to 9766. [2024-10-13 23:33:54,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.273015873015873) internal successors, (12431), 9765 states have internal predecessors, (12431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 12431 transitions. [2024-10-13 23:33:54,971 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 12431 transitions. Word has length 263 [2024-10-13 23:33:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:54,972 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 12431 transitions. [2024-10-13 23:33:54,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 12431 transitions. [2024-10-13 23:33:54,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-10-13 23:33:54,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:54,976 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:33:54,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:33:54,976 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:54,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:54,977 INFO L85 PathProgramCache]: Analyzing trace with hash 458422455, now seen corresponding path program 1 times [2024-10-13 23:33:54,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:54,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87347600] [2024-10-13 23:33:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:54,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 41 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:33:55,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:55,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87347600] [2024-10-13 23:33:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87347600] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:33:55,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929397672] [2024-10-13 23:33:55,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:55,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:33:55,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:33:55,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:33:55,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:33:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:55,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:33:55,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:33:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 23:33:55,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:33:55,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929397672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:55,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:33:55,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-10-13 23:33:55,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159476567] [2024-10-13 23:33:55,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:55,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:55,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:55,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:55,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:33:55,991 INFO L87 Difference]: Start difference. First operand 9766 states and 12431 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:58,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:58,783 INFO L93 Difference]: Finished difference Result 24788 states and 32537 transitions. [2024-10-13 23:33:58,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:58,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2024-10-13 23:33:58,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:58,824 INFO L225 Difference]: With dead ends: 24788 [2024-10-13 23:33:58,825 INFO L226 Difference]: Without dead ends: 15774 [2024-10-13 23:33:58,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:33:58,834 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 715 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:58,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 572 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:33:58,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15774 states. [2024-10-13 23:33:59,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15774 to 15774. [2024-10-13 23:33:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.2572116908641349) internal successors, (19830), 15773 states have internal predecessors, (19830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:59,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 19830 transitions. [2024-10-13 23:33:59,081 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 19830 transitions. Word has length 281 [2024-10-13 23:33:59,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:59,083 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 19830 transitions. [2024-10-13 23:33:59,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:59,084 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 19830 transitions. [2024-10-13 23:33:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-10-13 23:33:59,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:59,088 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:33:59,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:33:59,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 23:33:59,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:59,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2052273059, now seen corresponding path program 1 times [2024-10-13 23:33:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:59,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102024526] [2024-10-13 23:33:59,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:59,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-13 23:33:59,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:59,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102024526] [2024-10-13 23:33:59,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102024526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:59,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:59,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:33:59,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691893949] [2024-10-13 23:33:59,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:59,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:59,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:59,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:59,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:59,503 INFO L87 Difference]: Start difference. First operand 15774 states and 19830 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:34:02,231 INFO L93 Difference]: Finished difference Result 44314 states and 56347 transitions. [2024-10-13 23:34:02,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:34:02,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 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 289 [2024-10-13 23:34:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:34:02,281 INFO L225 Difference]: With dead ends: 44314 [2024-10-13 23:34:02,282 INFO L226 Difference]: Without dead ends: 29292 [2024-10-13 23:34:02,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:02,297 INFO L432 NwaCegarLoop]: 414 mSDtfsCounter, 690 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 841 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:34:02,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 420 Invalid, 2809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:34:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29292 states. [2024-10-13 23:34:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29292 to 26288. [2024-10-13 23:34:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26288 states, 26287 states have (on average 1.1972457868908586) internal successors, (31472), 26287 states have internal predecessors, (31472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26288 states to 26288 states and 31472 transitions. [2024-10-13 23:34:02,625 INFO L78 Accepts]: Start accepts. Automaton has 26288 states and 31472 transitions. Word has length 289 [2024-10-13 23:34:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:34:02,626 INFO L471 AbstractCegarLoop]: Abstraction has 26288 states and 31472 transitions. [2024-10-13 23:34:02,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 26288 states and 31472 transitions. [2024-10-13 23:34:02,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-10-13 23:34:02,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:34:02,634 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:34:02,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:34:02,635 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:34:02,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:34:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash -52096373, now seen corresponding path program 1 times [2024-10-13 23:34:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:34:02,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703418054] [2024-10-13 23:34:02,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:34:02,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:34:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:34:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 23:34:02,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:34:02,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703418054] [2024-10-13 23:34:02,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703418054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:34:02,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:34:02,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:34:02,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160927923] [2024-10-13 23:34:02,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:34:02,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:34:02,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:34:02,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:34:02,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:02,894 INFO L87 Difference]: Start difference. First operand 26288 states and 31472 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:34:05,726 INFO L93 Difference]: Finished difference Result 65342 states and 79631 transitions. [2024-10-13 23:34:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:34:05,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 402 [2024-10-13 23:34:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:34:05,787 INFO L225 Difference]: With dead ends: 65342 [2024-10-13 23:34:05,787 INFO L226 Difference]: Without dead ends: 39806 [2024-10-13 23:34:05,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:05,819 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 763 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 873 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 2957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 873 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:34:05,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 267 Invalid, 2957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [873 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:34:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39806 states. [2024-10-13 23:34:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39806 to 39806. [2024-10-13 23:34:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39806 states, 39805 states have (on average 1.1869614370054014) internal successors, (47247), 39805 states have internal predecessors, (47247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39806 states to 39806 states and 47247 transitions. [2024-10-13 23:34:06,493 INFO L78 Accepts]: Start accepts. Automaton has 39806 states and 47247 transitions. Word has length 402 [2024-10-13 23:34:06,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:34:06,494 INFO L471 AbstractCegarLoop]: Abstraction has 39806 states and 47247 transitions. [2024-10-13 23:34:06,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:06,494 INFO L276 IsEmpty]: Start isEmpty. Operand 39806 states and 47247 transitions. [2024-10-13 23:34:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2024-10-13 23:34:06,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:34:06,506 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:34:06,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:34:06,506 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:34:06,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:34:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash 752130261, now seen corresponding path program 1 times [2024-10-13 23:34:06,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:34:06,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303909509] [2024-10-13 23:34:06,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:34:06,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:34:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:34:07,008 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 23:34:07,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:34:07,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303909509] [2024-10-13 23:34:07,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303909509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:34:07,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:34:07,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:34:07,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642510822] [2024-10-13 23:34:07,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:34:07,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:34:07,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:34:07,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:34:07,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:07,011 INFO L87 Difference]: Start difference. First operand 39806 states and 47247 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:09,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:34:09,802 INFO L93 Difference]: Finished difference Result 93129 states and 111976 transitions. [2024-10-13 23:34:09,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:34:09,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 406 [2024-10-13 23:34:09,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:34:09,882 INFO L225 Difference]: With dead ends: 93129 [2024-10-13 23:34:09,883 INFO L226 Difference]: Without dead ends: 54075 [2024-10-13 23:34:09,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:09,915 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 778 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 898 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 898 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:34:09,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 121 Invalid, 3068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [898 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:34:09,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54075 states. [2024-10-13 23:34:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54075 to 54075. [2024-10-13 23:34:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54075 states, 54074 states have (on average 1.1974146539926767) internal successors, (64749), 54074 states have internal predecessors, (64749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54075 states to 54075 states and 64749 transitions. [2024-10-13 23:34:10,724 INFO L78 Accepts]: Start accepts. Automaton has 54075 states and 64749 transitions. Word has length 406 [2024-10-13 23:34:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:34:10,725 INFO L471 AbstractCegarLoop]: Abstraction has 54075 states and 64749 transitions. [2024-10-13 23:34:10,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 54075 states and 64749 transitions. [2024-10-13 23:34:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2024-10-13 23:34:10,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:34:10,733 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:34:10,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:34:10,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:34:10,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:34:10,735 INFO L85 PathProgramCache]: Analyzing trace with hash 360383819, now seen corresponding path program 1 times [2024-10-13 23:34:10,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:34:10,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137416428] [2024-10-13 23:34:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:34:10,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:34:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:34:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-13 23:34:11,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:34:11,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137416428] [2024-10-13 23:34:11,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137416428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:34:11,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:34:11,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:34:11,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157871288] [2024-10-13 23:34:11,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:34:11,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:34:11,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:34:11,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:34:11,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:11,346 INFO L87 Difference]: Start difference. First operand 54075 states and 64749 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:34:13,775 INFO L93 Difference]: Finished difference Result 117161 states and 139600 transitions. [2024-10-13 23:34:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:34:13,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 410 [2024-10-13 23:34:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:34:13,844 INFO L225 Difference]: With dead ends: 117161 [2024-10-13 23:34:13,844 INFO L226 Difference]: Without dead ends: 60083 [2024-10-13 23:34:13,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:13,877 INFO L432 NwaCegarLoop]: 1306 mSDtfsCounter, 743 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 2347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:34:13,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1313 Invalid, 2347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1963 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 23:34:13,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60083 states. [2024-10-13 23:34:14,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60083 to 58581. [2024-10-13 23:34:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58581 states, 58580 states have (on average 1.1779617616934108) internal successors, (69005), 58580 states have internal predecessors, (69005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58581 states to 58581 states and 69005 transitions. [2024-10-13 23:34:14,767 INFO L78 Accepts]: Start accepts. Automaton has 58581 states and 69005 transitions. Word has length 410 [2024-10-13 23:34:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:34:14,767 INFO L471 AbstractCegarLoop]: Abstraction has 58581 states and 69005 transitions. [2024-10-13 23:34:14,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 58581 states and 69005 transitions. [2024-10-13 23:34:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-10-13 23:34:14,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:34:14,775 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 23:34:14,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:34:14,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:34:14,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:34:14,777 INFO L85 PathProgramCache]: Analyzing trace with hash -673744247, now seen corresponding path program 1 times [2024-10-13 23:34:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:34:14,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417619969] [2024-10-13 23:34:14,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:34:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:34:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:34:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2024-10-13 23:34:15,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:34:15,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417619969] [2024-10-13 23:34:15,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417619969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:34:15,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:34:15,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:34:15,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440052329] [2024-10-13 23:34:15,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:34:15,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:34:15,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:34:15,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:34:15,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:15,613 INFO L87 Difference]: Start difference. First operand 58581 states and 69005 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:18,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:34:18,387 INFO L93 Difference]: Finished difference Result 138189 states and 164768 transitions. [2024-10-13 23:34:18,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:34:18,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 450 [2024-10-13 23:34:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:34:18,479 INFO L225 Difference]: With dead ends: 138189 [2024-10-13 23:34:18,480 INFO L226 Difference]: Without dead ends: 80360 [2024-10-13 23:34:18,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:18,527 INFO L432 NwaCegarLoop]: 1226 mSDtfsCounter, 693 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:34:18,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1233 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:34:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80360 states. [2024-10-13 23:34:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80360 to 74352. [2024-10-13 23:34:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74352 states, 74351 states have (on average 1.1593926107248054) internal successors, (86202), 74351 states have internal predecessors, (86202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74352 states to 74352 states and 86202 transitions. [2024-10-13 23:34:19,419 INFO L78 Accepts]: Start accepts. Automaton has 74352 states and 86202 transitions. Word has length 450 [2024-10-13 23:34:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:34:19,419 INFO L471 AbstractCegarLoop]: Abstraction has 74352 states and 86202 transitions. [2024-10-13 23:34:19,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 74352 states and 86202 transitions. [2024-10-13 23:34:19,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2024-10-13 23:34:19,601 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:34:19,601 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:34:19,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:34:19,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:34:19,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:34:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1683906623, now seen corresponding path program 1 times [2024-10-13 23:34:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:34:19,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919345684] [2024-10-13 23:34:19,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:34:19,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:34:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:34:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-13 23:34:20,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:34:20,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919345684] [2024-10-13 23:34:20,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919345684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:34:20,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:34:20,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:34:20,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964696169] [2024-10-13 23:34:20,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:34:20,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:34:20,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:34:20,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:34:20,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:20,245 INFO L87 Difference]: Start difference. First operand 74352 states and 86202 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:23,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:34:23,321 INFO L93 Difference]: Finished difference Result 184000 states and 212831 transitions. [2024-10-13 23:34:23,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:34:23,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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 485 [2024-10-13 23:34:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:34:23,447 INFO L225 Difference]: With dead ends: 184000 [2024-10-13 23:34:23,447 INFO L226 Difference]: Without dead ends: 110400 [2024-10-13 23:34:23,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:23,489 INFO L432 NwaCegarLoop]: 1149 mSDtfsCounter, 569 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:34:23,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1156 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2510 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:34:23,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110400 states. [2024-10-13 23:34:24,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110400 to 108147. [2024-10-13 23:34:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108147 states, 108146 states have (on average 1.1442771808481127) internal successors, (123749), 108146 states have internal predecessors, (123749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108147 states to 108147 states and 123749 transitions. [2024-10-13 23:34:24,747 INFO L78 Accepts]: Start accepts. Automaton has 108147 states and 123749 transitions. Word has length 485 [2024-10-13 23:34:24,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:34:24,747 INFO L471 AbstractCegarLoop]: Abstraction has 108147 states and 123749 transitions. [2024-10-13 23:34:24,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:24,748 INFO L276 IsEmpty]: Start isEmpty. Operand 108147 states and 123749 transitions. [2024-10-13 23:34:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2024-10-13 23:34:24,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:34:24,761 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:34:24,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 23:34:24,761 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:34:24,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:34:24,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1682850686, now seen corresponding path program 1 times [2024-10-13 23:34:24,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:34:24,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359514020] [2024-10-13 23:34:24,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:34:24,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:34:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:34:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 425 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-13 23:34:25,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:34:25,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359514020] [2024-10-13 23:34:25,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359514020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:34:25,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:34:25,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:34:25,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996215570] [2024-10-13 23:34:25,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:34:25,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:34:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:34:25,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:34:25,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:25,543 INFO L87 Difference]: Start difference. First operand 108147 states and 123749 transitions. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:28,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:34:28,790 INFO L93 Difference]: Finished difference Result 261353 states and 302119 transitions. [2024-10-13 23:34:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:34:28,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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 522 [2024-10-13 23:34:28,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:34:28,942 INFO L225 Difference]: With dead ends: 261353 [2024-10-13 23:34:28,942 INFO L226 Difference]: Without dead ends: 153958 [2024-10-13 23:34:29,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:29,002 INFO L432 NwaCegarLoop]: 1231 mSDtfsCounter, 614 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:34:29,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1237 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:34:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153958 states. [2024-10-13 23:34:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153958 to 147950. [2024-10-13 23:34:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147950 states, 147949 states have (on average 1.1227855544816119) internal successors, (166115), 147949 states have internal predecessors, (166115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147950 states to 147950 states and 166115 transitions. [2024-10-13 23:34:31,197 INFO L78 Accepts]: Start accepts. Automaton has 147950 states and 166115 transitions. Word has length 522 [2024-10-13 23:34:31,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:34:31,197 INFO L471 AbstractCegarLoop]: Abstraction has 147950 states and 166115 transitions. [2024-10-13 23:34:31,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 147950 states and 166115 transitions. [2024-10-13 23:34:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-10-13 23:34:31,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:34:31,240 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-13 23:34:31,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:34:31,240 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:34:31,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:34:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1673293544, now seen corresponding path program 1 times [2024-10-13 23:34:31,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:34:31,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445425975] [2024-10-13 23:34:31,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:34:31,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:34:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:34:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-10-13 23:34:31,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:34:31,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445425975] [2024-10-13 23:34:31,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445425975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:34:31,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:34:31,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:34:31,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686180573] [2024-10-13 23:34:31,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:34:31,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:34:31,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:34:31,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:34:31,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:31,655 INFO L87 Difference]: Start difference. First operand 147950 states and 166115 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:34:34,775 INFO L93 Difference]: Finished difference Result 295148 states and 331473 transitions. [2024-10-13 23:34:34,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:34:34,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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 572 [2024-10-13 23:34:34,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:34:34,953 INFO L225 Difference]: With dead ends: 295148 [2024-10-13 23:34:34,953 INFO L226 Difference]: Without dead ends: 147950 [2024-10-13 23:34:35,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:35,033 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 788 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:34:35,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 216 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:34:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147950 states. [2024-10-13 23:34:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147950 to 146448. [2024-10-13 23:34:36,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146448 states, 146447 states have (on average 1.1056218290576112) internal successors, (161915), 146447 states have internal predecessors, (161915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146448 states to 146448 states and 161915 transitions. [2024-10-13 23:34:36,997 INFO L78 Accepts]: Start accepts. Automaton has 146448 states and 161915 transitions. Word has length 572 [2024-10-13 23:34:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:34:36,997 INFO L471 AbstractCegarLoop]: Abstraction has 146448 states and 161915 transitions. [2024-10-13 23:34:36,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 146448 states and 161915 transitions. [2024-10-13 23:34:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2024-10-13 23:34:37,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:34:37,009 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 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] [2024-10-13 23:34:37,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 23:34:37,010 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:34:37,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:34:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2013400667, now seen corresponding path program 1 times [2024-10-13 23:34:37,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:34:37,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422266607] [2024-10-13 23:34:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:34:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:34:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:34:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2024-10-13 23:34:37,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:34:37,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422266607] [2024-10-13 23:34:37,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422266607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:34:37,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:34:37,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:34:37,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170408013] [2024-10-13 23:34:37,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:34:37,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:34:37,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:34:37,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:34:37,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:37,855 INFO L87 Difference]: Start difference. First operand 146448 states and 161915 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:34:41,260 INFO L93 Difference]: Finished difference Result 292144 states and 323073 transitions. [2024-10-13 23:34:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:34:41,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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 594 [2024-10-13 23:34:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:34:41,425 INFO L225 Difference]: With dead ends: 292144 [2024-10-13 23:34:41,425 INFO L226 Difference]: Without dead ends: 146448 [2024-10-13 23:34:41,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:34:41,474 INFO L432 NwaCegarLoop]: 1143 mSDtfsCounter, 717 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 2640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:34:41,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1150 Invalid, 2640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 2144 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:34:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146448 states. [2024-10-13 23:34:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146448 to 145697. [2024-10-13 23:34:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145697 states, 145696 states have (on average 1.0639825389852844) internal successors, (155018), 145696 states have internal predecessors, (155018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:43,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145697 states to 145697 states and 155018 transitions. [2024-10-13 23:34:43,678 INFO L78 Accepts]: Start accepts. Automaton has 145697 states and 155018 transitions. Word has length 594 [2024-10-13 23:34:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:34:43,679 INFO L471 AbstractCegarLoop]: Abstraction has 145697 states and 155018 transitions. [2024-10-13 23:34:43,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:34:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 145697 states and 155018 transitions. [2024-10-13 23:34:43,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2024-10-13 23:34:43,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:34:43,699 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, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:34:43,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:34:43,699 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:34:43,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:34:43,700 INFO L85 PathProgramCache]: Analyzing trace with hash 111707070, now seen corresponding path program 1 times [2024-10-13 23:34:43,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:34:43,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320408099] [2024-10-13 23:34:43,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:34:43,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:34:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:34:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 499 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-13 23:34:45,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:34:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320408099] [2024-10-13 23:34:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320408099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:34:45,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:34:45,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:34:45,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600879758] [2024-10-13 23:34:45,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:34:45,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:34:45,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:34:45,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:34:45,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:34:45,105 INFO L87 Difference]: Start difference. First operand 145697 states and 155018 transitions. Second operand has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)