./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_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_label09.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 3266bb9a560f42e93e7f83a070eaa64f467717133c7f2cf6394974f84eb01d92 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:02:25,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:02:26,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:02:26,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:02:26,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:02:26,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:02:26,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:02:26,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:02:26,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:02:26,051 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:02:26,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:02:26,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:02:26,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:02:26,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:02:26,055 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:02:26,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:02:26,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:02:26,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:02:26,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:02:26,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:02:26,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:02:26,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:02:26,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:02:26,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:02:26,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:02:26,058 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:02:26,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:02:26,059 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:02:26,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:02:26,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:02:26,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:02:26,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:02:26,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:02:26,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:02:26,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:02:26,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:02:26,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:02:26,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:02:26,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:02:26,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:02:26,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:02:26,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:02:26,065 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 -> 3266bb9a560f42e93e7f83a070eaa64f467717133c7f2cf6394974f84eb01d92 [2024-10-12 16:02:26,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:02:26,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:02:26,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:02:26,346 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:02:26,346 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:02:26,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label09.c [2024-10-12 16:02:27,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:02:28,228 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:02:28,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label09.c [2024-10-12 16:02:28,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b67a5a0/0f0a16c2cd1c441284d4dbeef5e918e1/FLAG2b0af4574 [2024-10-12 16:02:28,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50b67a5a0/0f0a16c2cd1c441284d4dbeef5e918e1 [2024-10-12 16:02:28,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:02:28,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:02:28,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:02:28,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:02:28,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:02:28,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:02:28" (1/1) ... [2024-10-12 16:02:28,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14bae580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:28, skipping insertion in model container [2024-10-12 16:02:28,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:02:28" (1/1) ... [2024-10-12 16:02:28,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:02:28,676 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_label09.c[8109,8122] [2024-10-12 16:02:29,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:02:29,376 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:02:29,408 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_label09.c[8109,8122] [2024-10-12 16:02:29,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:02:29,823 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:02:29,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29 WrapperNode [2024-10-12 16:02:29,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:02:29,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:02:29,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:02:29,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:02:29,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:29,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:30,165 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-12 16:02:30,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:02:30,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:02:30,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:02:30,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:02:30,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:30,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:30,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:30,454 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-12 16:02:30,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:30,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:30,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:30,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:30,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:30,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:30,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:02:30,770 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:02:30,770 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:02:30,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:02:30,771 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (1/1) ... [2024-10-12 16:02:30,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:02:30,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:02:30,822 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-12 16:02:30,825 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-12 16:02:30,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:02:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:02:30,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:02:30,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:02:31,007 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:02:31,010 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:02:35,100 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-12 16:02:35,101 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:02:35,166 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:02:35,166 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:02:35,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:02:35 BoogieIcfgContainer [2024-10-12 16:02:35,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:02:35,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:02:35,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:02:35,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:02:35,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:02:28" (1/3) ... [2024-10-12 16:02:35,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a91eac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:02:35, skipping insertion in model container [2024-10-12 16:02:35,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:02:29" (2/3) ... [2024-10-12 16:02:35,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a91eac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:02:35, skipping insertion in model container [2024-10-12 16:02:35,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:02:35" (3/3) ... [2024-10-12 16:02:35,175 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label09.c [2024-10-12 16:02:35,191 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:02:35,191 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:02:35,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:02:35,283 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;@34e322ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:02:35,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:02:35,291 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-12 16:02:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 16:02:35,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:02:35,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:02:35,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:02:35,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:02:35,305 INFO L85 PathProgramCache]: Analyzing trace with hash 925616397, now seen corresponding path program 1 times [2024-10-12 16:02:35,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:02:35,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080719754] [2024-10-12 16:02:35,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:02:35,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:02:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:02:35,530 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-12 16:02:35,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:02:35,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080719754] [2024-10-12 16:02:35,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080719754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:02:35,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:02:35,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:02:35,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563877453] [2024-10-12 16:02:35,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:02:35,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:02:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:02:35,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:02:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:02:35,571 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 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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-12 16:02:35,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:02:35,674 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-12 16:02:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:02:35,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-12 16:02:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:02:35,704 INFO L225 Difference]: With dead ends: 1511 [2024-10-12 16:02:35,705 INFO L226 Difference]: Without dead ends: 754 [2024-10-12 16:02:35,711 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-12 16:02:35,717 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-12 16:02:35,719 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-12 16:02:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-12 16:02:35,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-12 16:02:35,803 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-12 16:02:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-12 16:02:35,807 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 65 [2024-10-12 16:02:35,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:02:35,807 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-12 16:02:35,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 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-12 16:02:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-12 16:02:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 16:02:35,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:02:35,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:02:35,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:02:35,812 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:02:35,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:02:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash 791687097, now seen corresponding path program 1 times [2024-10-12 16:02:35,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:02:35,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098027916] [2024-10-12 16:02:35,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:02:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:02:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:02:36,165 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-12 16:02:36,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:02:36,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098027916] [2024-10-12 16:02:36,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098027916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:02:36,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:02:36,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:02:36,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876287067] [2024-10-12 16:02:36,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:02:36,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:02:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:02:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:02:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:02:36,172 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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-12 16:02:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:02:41,775 INFO L93 Difference]: Finished difference Result 3009 states and 5747 transitions. [2024-10-12 16:02:41,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:02:41,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2024-10-12 16:02:41,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:02:41,788 INFO L225 Difference]: With dead ends: 3009 [2024-10-12 16:02:41,788 INFO L226 Difference]: Without dead ends: 2256 [2024-10-12 16:02:41,789 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-12 16:02:41,790 INFO L432 NwaCegarLoop]: 691 mSDtfsCounter, 2185 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5155 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2185 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 6400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 5155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:02:41,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2185 Valid, 709 Invalid, 6400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 5155 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-12 16:02:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2024-10-12 16:02:41,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2256. [2024-10-12 16:02:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.5139689578713968) internal successors, (3414), 2255 states have internal predecessors, (3414), 0 states have call successors, (0), 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-12 16:02:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3414 transitions. [2024-10-12 16:02:41,852 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3414 transitions. Word has length 65 [2024-10-12 16:02:41,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:02:41,853 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3414 transitions. [2024-10-12 16:02:41,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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-12 16:02:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3414 transitions. [2024-10-12 16:02:41,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 16:02:41,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:02:41,855 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:02:41,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:02:41,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:02:41,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:02:41,857 INFO L85 PathProgramCache]: Analyzing trace with hash -700140278, now seen corresponding path program 1 times [2024-10-12 16:02:41,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:02:41,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625267237] [2024-10-12 16:02:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:02:41,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:02:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:02:42,237 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:02:42,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:02:42,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625267237] [2024-10-12 16:02:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625267237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:02:42,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:02:42,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:02:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987233361] [2024-10-12 16:02:42,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:02:42,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:02:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:02:42,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:02:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:02:42,243 INFO L87 Difference]: Start difference. First operand 2256 states and 3414 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-12 16:02:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:02:45,893 INFO L93 Difference]: Finished difference Result 6050 states and 9519 transitions. [2024-10-12 16:02:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:02:45,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-10-12 16:02:45,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:02:45,907 INFO L225 Difference]: With dead ends: 6050 [2024-10-12 16:02:45,908 INFO L226 Difference]: Without dead ends: 3758 [2024-10-12 16:02:45,911 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-12 16:02:45,912 INFO L432 NwaCegarLoop]: 691 mSDtfsCounter, 703 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 3837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:02:45,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 704 Invalid, 3837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 16:02:45,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2024-10-12 16:02:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3758. [2024-10-12 16:02:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3758 states, 3757 states have (on average 1.3305829118977908) internal successors, (4999), 3757 states have internal predecessors, (4999), 0 states have call successors, (0), 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-12 16:02:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3758 states to 3758 states and 4999 transitions. [2024-10-12 16:02:45,989 INFO L78 Accepts]: Start accepts. Automaton has 3758 states and 4999 transitions. Word has length 136 [2024-10-12 16:02:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:02:45,990 INFO L471 AbstractCegarLoop]: Abstraction has 3758 states and 4999 transitions. [2024-10-12 16:02:45,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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-12 16:02:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3758 states and 4999 transitions. [2024-10-12 16:02:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2024-10-12 16:02:45,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:02:45,996 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:02:45,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:02:45,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:02:45,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:02:45,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1910089640, now seen corresponding path program 1 times [2024-10-12 16:02:45,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:02:45,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667218353] [2024-10-12 16:02:45,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:02:45,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:02:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:02:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 16:02:46,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:02:46,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667218353] [2024-10-12 16:02:46,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667218353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:02:46,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:02:46,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:02:46,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525423438] [2024-10-12 16:02:46,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:02:46,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:02:46,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:02:46,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:02:46,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:02:46,496 INFO L87 Difference]: Start difference. First operand 3758 states and 4999 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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-12 16:02:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:02:49,517 INFO L93 Difference]: Finished difference Result 9056 states and 12623 transitions. [2024-10-12 16:02:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:02:49,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 277 [2024-10-12 16:02:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:02:49,534 INFO L225 Difference]: With dead ends: 9056 [2024-10-12 16:02:49,534 INFO L226 Difference]: Without dead ends: 5262 [2024-10-12 16:02:49,539 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-12 16:02:49,540 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 775 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3718 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 4260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 3718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:02:49,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 321 Invalid, 4260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 3718 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 16:02:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5262 states. [2024-10-12 16:02:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5262 to 5260. [2024-10-12 16:02:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5260 states, 5259 states have (on average 1.3242061228370412) internal successors, (6964), 5259 states have internal predecessors, (6964), 0 states have call successors, (0), 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-12 16:02:49,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5260 states to 5260 states and 6964 transitions. [2024-10-12 16:02:49,624 INFO L78 Accepts]: Start accepts. Automaton has 5260 states and 6964 transitions. Word has length 277 [2024-10-12 16:02:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:02:49,626 INFO L471 AbstractCegarLoop]: Abstraction has 5260 states and 6964 transitions. [2024-10-12 16:02:49,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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-12 16:02:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 5260 states and 6964 transitions. [2024-10-12 16:02:49,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-12 16:02:49,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:02:49,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:02:49,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:02:49,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:02:49,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:02:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1025249157, now seen corresponding path program 1 times [2024-10-12 16:02:49,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:02:49,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124185587] [2024-10-12 16:02:49,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:02:49,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:02:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:02:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:02:49,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:02:49,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124185587] [2024-10-12 16:02:49,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124185587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:02:49,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:02:49,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:02:49,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666457538] [2024-10-12 16:02:49,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:02:49,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:02:49,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:02:49,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:02:49,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:02:49,893 INFO L87 Difference]: Start difference. First operand 5260 states and 6964 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-12 16:02:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:02:52,581 INFO L93 Difference]: Finished difference Result 15025 states and 20133 transitions. [2024-10-12 16:02:52,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:02:52,581 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 291 [2024-10-12 16:02:52,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:02:52,613 INFO L225 Difference]: With dead ends: 15025 [2024-10-12 16:02:52,613 INFO L226 Difference]: Without dead ends: 9766 [2024-10-12 16:02:52,621 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-12 16:02:52,623 INFO L432 NwaCegarLoop]: 1251 mSDtfsCounter, 675 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:02:52,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1258 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 16:02:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2024-10-12 16:02:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 9766. [2024-10-12 16:02:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.2974910394265233) internal successors, (12670), 9765 states have internal predecessors, (12670), 0 states have call successors, (0), 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-12 16:02:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 12670 transitions. [2024-10-12 16:02:52,780 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 12670 transitions. Word has length 291 [2024-10-12 16:02:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:02:52,781 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 12670 transitions. [2024-10-12 16:02:52,782 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-12 16:02:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 12670 transitions. [2024-10-12 16:02:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-10-12 16:02:52,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:02:52,787 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:02:52,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:02:52,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:02:52,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:02:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash -198815153, now seen corresponding path program 1 times [2024-10-12 16:02:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:02:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522548595] [2024-10-12 16:02:52,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:02:52,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:02:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:02:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-12 16:02:53,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:02:53,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522548595] [2024-10-12 16:02:53,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522548595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:02:53,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:02:53,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:02:53,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356623283] [2024-10-12 16:02:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:02:53,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:02:53,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:02:53,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:02:53,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:02:53,015 INFO L87 Difference]: Start difference. First operand 9766 states and 12670 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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-12 16:02:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:02:55,868 INFO L93 Difference]: Finished difference Result 25539 states and 33978 transitions. [2024-10-12 16:02:55,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:02:55,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 295 [2024-10-12 16:02:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:02:55,908 INFO L225 Difference]: With dead ends: 25539 [2024-10-12 16:02:55,908 INFO L226 Difference]: Without dead ends: 15774 [2024-10-12 16:02:55,923 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-12 16:02:55,923 INFO L432 NwaCegarLoop]: 520 mSDtfsCounter, 702 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2276 mSolverCounterSat, 637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 637 IncrementalHoareTripleChecker+Valid, 2276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:02:55,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 527 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [637 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 16:02:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15774 states. [2024-10-12 16:02:56,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15774 to 15774. [2024-10-12 16:02:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.2829518797945856) internal successors, (20236), 15773 states have internal predecessors, (20236), 0 states have call successors, (0), 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-12 16:02:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 20236 transitions. [2024-10-12 16:02:56,148 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 20236 transitions. Word has length 295 [2024-10-12 16:02:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:02:56,149 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 20236 transitions. [2024-10-12 16:02:56,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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-12 16:02:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 20236 transitions. [2024-10-12 16:02:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-10-12 16:02:56,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:02:56,154 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:02:56,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:02:56,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:02:56,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:02:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1050476485, now seen corresponding path program 1 times [2024-10-12 16:02:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:02:56,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431099246] [2024-10-12 16:02:56,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:02:56,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:02:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:02:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-12 16:02:56,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:02:56,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431099246] [2024-10-12 16:02:56,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431099246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:02:56,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:02:56,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:02:56,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480416619] [2024-10-12 16:02:56,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:02:56,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:02:56,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:02:56,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:02:56,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:02:56,486 INFO L87 Difference]: Start difference. First operand 15774 states and 20236 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 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-12 16:02:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:02:59,202 INFO L93 Difference]: Finished difference Result 44314 states and 57481 transitions. [2024-10-12 16:02:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:02:59,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 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 303 [2024-10-12 16:02:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:02:59,253 INFO L225 Difference]: With dead ends: 44314 [2024-10-12 16:02:59,253 INFO L226 Difference]: Without dead ends: 28541 [2024-10-12 16:02:59,278 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-12 16:02:59,279 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 689 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 421 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-12 16:02:59,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 421 Invalid, 2809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 16:02:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28541 states. [2024-10-12 16:02:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28541 to 25537. [2024-10-12 16:02:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25537 states, 25536 states have (on average 1.2187108395989974) internal successors, (31121), 25536 states have internal predecessors, (31121), 0 states have call successors, (0), 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-12 16:02:59,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25537 states to 25537 states and 31121 transitions. [2024-10-12 16:02:59,723 INFO L78 Accepts]: Start accepts. Automaton has 25537 states and 31121 transitions. Word has length 303 [2024-10-12 16:02:59,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:02:59,724 INFO L471 AbstractCegarLoop]: Abstraction has 25537 states and 31121 transitions. [2024-10-12 16:02:59,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 2 states have internal predecessors, (212), 0 states have call successors, (0), 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-12 16:02:59,724 INFO L276 IsEmpty]: Start isEmpty. Operand 25537 states and 31121 transitions. [2024-10-12 16:02:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-10-12 16:02:59,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:02:59,730 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:02:59,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:02:59,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:02:59,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:02:59,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1087671971, now seen corresponding path program 1 times [2024-10-12 16:02:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:02:59,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77669240] [2024-10-12 16:02:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:02:59,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:02:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:03:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-10-12 16:03:00,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:03:00,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77669240] [2024-10-12 16:03:00,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77669240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:03:00,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:03:00,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:03:00,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983999197] [2024-10-12 16:03:00,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:03:00,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:03:00,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:03:00,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:03:00,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:03:00,455 INFO L87 Difference]: Start difference. First operand 25537 states and 31121 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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-12 16:03:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:03:02,917 INFO L93 Difference]: Finished difference Result 61587 states and 73942 transitions. [2024-10-12 16:03:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:03:02,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 342 [2024-10-12 16:03:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:03:02,977 INFO L225 Difference]: With dead ends: 61587 [2024-10-12 16:03:02,977 INFO L226 Difference]: Without dead ends: 36051 [2024-10-12 16:03:03,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:03:03,008 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 767 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:03:03,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 207 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 16:03:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36051 states. [2024-10-12 16:03:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36051 to 31545. [2024-10-12 16:03:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31545 states, 31544 states have (on average 1.184250570631499) internal successors, (37356), 31544 states have internal predecessors, (37356), 0 states have call successors, (0), 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-12 16:03:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31545 states to 31545 states and 37356 transitions. [2024-10-12 16:03:03,677 INFO L78 Accepts]: Start accepts. Automaton has 31545 states and 37356 transitions. Word has length 342 [2024-10-12 16:03:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:03:03,678 INFO L471 AbstractCegarLoop]: Abstraction has 31545 states and 37356 transitions. [2024-10-12 16:03:03,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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-12 16:03:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 31545 states and 37356 transitions. [2024-10-12 16:03:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-10-12 16:03:03,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:03:03,698 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:03:03,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:03:03,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:03:03,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:03:03,699 INFO L85 PathProgramCache]: Analyzing trace with hash -745314010, now seen corresponding path program 1 times [2024-10-12 16:03:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:03:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004404343] [2024-10-12 16:03:03,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:03:03,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:03:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:03:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 16:03:04,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:03:04,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004404343] [2024-10-12 16:03:04,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004404343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:03:04,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:03:04,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:03:04,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444551765] [2024-10-12 16:03:04,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:03:04,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:03:04,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:03:04,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:03:04,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:03:04,127 INFO L87 Difference]: Start difference. First operand 31545 states and 37356 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-12 16:03:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:03:06,565 INFO L93 Difference]: Finished difference Result 78860 states and 93955 transitions. [2024-10-12 16:03:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:03:06,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 398 [2024-10-12 16:03:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:03:06,626 INFO L225 Difference]: With dead ends: 78860 [2024-10-12 16:03:06,626 INFO L226 Difference]: Without dead ends: 47316 [2024-10-12 16:03:06,653 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-12 16:03:06,654 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 668 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:03:06,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 294 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:03:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47316 states. [2024-10-12 16:03:07,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47316 to 46565. [2024-10-12 16:03:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46565 states, 46564 states have (on average 1.1781633880250837) internal successors, (54860), 46564 states have internal predecessors, (54860), 0 states have call successors, (0), 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-12 16:03:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46565 states to 46565 states and 54860 transitions. [2024-10-12 16:03:07,416 INFO L78 Accepts]: Start accepts. Automaton has 46565 states and 54860 transitions. Word has length 398 [2024-10-12 16:03:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:03:07,417 INFO L471 AbstractCegarLoop]: Abstraction has 46565 states and 54860 transitions. [2024-10-12 16:03:07,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-12 16:03:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 46565 states and 54860 transitions. [2024-10-12 16:03:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2024-10-12 16:03:07,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:03:07,426 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:03:07,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:03:07,426 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:03:07,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:03:07,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1479748523, now seen corresponding path program 1 times [2024-10-12 16:03:07,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:03:07,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933976354] [2024-10-12 16:03:07,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:03:07,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:03:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:03:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-12 16:03:07,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:03:07,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933976354] [2024-10-12 16:03:07,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933976354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:03:07,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:03:07,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:03:07,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403748836] [2024-10-12 16:03:07,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:03:07,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:03:07,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:03:07,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:03:07,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:03:07,949 INFO L87 Difference]: Start difference. First operand 46565 states and 54860 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-12 16:03:10,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:03:10,619 INFO L93 Difference]: Finished difference Result 112655 states and 134695 transitions. [2024-10-12 16:03:10,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:03:10,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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 404 [2024-10-12 16:03:10,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:03:10,689 INFO L225 Difference]: With dead ends: 112655 [2024-10-12 16:03:10,689 INFO L226 Difference]: Without dead ends: 66091 [2024-10-12 16:03:10,712 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-12 16:03:10,713 INFO L432 NwaCegarLoop]: 1237 mSDtfsCounter, 661 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 2712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:03:10,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1244 Invalid, 2712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 16:03:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66091 states. [2024-10-12 16:03:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66091 to 66091. [2024-10-12 16:03:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66091 states, 66090 states have (on average 1.1514752610077168) internal successors, (76101), 66090 states have internal predecessors, (76101), 0 states have call successors, (0), 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-12 16:03:11,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66091 states to 66091 states and 76101 transitions. [2024-10-12 16:03:11,713 INFO L78 Accepts]: Start accepts. Automaton has 66091 states and 76101 transitions. Word has length 404 [2024-10-12 16:03:11,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:03:11,713 INFO L471 AbstractCegarLoop]: Abstraction has 66091 states and 76101 transitions. [2024-10-12 16:03:11,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 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-12 16:03:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 66091 states and 76101 transitions. [2024-10-12 16:03:11,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2024-10-12 16:03:11,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:03:11,720 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:03:11,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:03:11,721 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:03:11,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:03:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1079190221, now seen corresponding path program 1 times [2024-10-12 16:03:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:03:11,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30375684] [2024-10-12 16:03:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:03:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:03:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:03:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-12 16:03:12,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:03:12,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30375684] [2024-10-12 16:03:12,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30375684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:03:12,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:03:12,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:03:12,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200918005] [2024-10-12 16:03:12,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:03:12,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:03:12,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:03:12,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:03:12,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:03:12,196 INFO L87 Difference]: Start difference. First operand 66091 states and 76101 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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-12 16:03:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:03:14,781 INFO L93 Difference]: Finished difference Result 150956 states and 176238 transitions. [2024-10-12 16:03:14,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:03:14,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 420 [2024-10-12 16:03:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:03:15,029 INFO L225 Difference]: With dead ends: 150956 [2024-10-12 16:03:15,029 INFO L226 Difference]: Without dead ends: 84866 [2024-10-12 16:03:15,062 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-12 16:03:15,064 INFO L432 NwaCegarLoop]: 1272 mSDtfsCounter, 673 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2234 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:03:15,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1279 Invalid, 2680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2234 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 16:03:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84866 states. [2024-10-12 16:03:15,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84866 to 84866. [2024-10-12 16:03:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84866 states, 84865 states have (on average 1.134825899958758) internal successors, (96307), 84865 states have internal predecessors, (96307), 0 states have call successors, (0), 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-12 16:03:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84866 states to 84866 states and 96307 transitions. [2024-10-12 16:03:16,037 INFO L78 Accepts]: Start accepts. Automaton has 84866 states and 96307 transitions. Word has length 420 [2024-10-12 16:03:16,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:03:16,037 INFO L471 AbstractCegarLoop]: Abstraction has 84866 states and 96307 transitions. [2024-10-12 16:03:16,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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-12 16:03:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 84866 states and 96307 transitions. [2024-10-12 16:03:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-10-12 16:03:16,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:03:16,046 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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-12 16:03:16,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:03:16,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:03:16,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:03:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash -8906557, now seen corresponding path program 1 times [2024-10-12 16:03:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:03:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342198746] [2024-10-12 16:03:16,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:03:16,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:03:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:03:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 285 proven. 99 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-12 16:03:17,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:03:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342198746] [2024-10-12 16:03:17,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342198746] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:03:17,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109861113] [2024-10-12 16:03:17,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:03:17,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:03:17,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:03:17,064 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-12 16:03:17,065 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-12 16:03:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:03:17,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:03:17,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:03:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-10-12 16:03:17,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:03:17,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109861113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:03:17,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:03:17,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-12 16:03:17,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549713783] [2024-10-12 16:03:17,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:03:17,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:03:17,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:03:17,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:03:17,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:03:17,368 INFO L87 Difference]: Start difference. First operand 84866 states and 96307 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-12 16:03:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:03:20,309 INFO L93 Difference]: Finished difference Result 169731 states and 192613 transitions. [2024-10-12 16:03:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:03:20,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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 424 [2024-10-12 16:03:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:03:20,414 INFO L225 Difference]: With dead ends: 169731 [2024-10-12 16:03:20,415 INFO L226 Difference]: Without dead ends: 84866 [2024-10-12 16:03:20,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:03:20,468 INFO L432 NwaCegarLoop]: 1181 mSDtfsCounter, 718 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2404 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 2404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:03:20,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1188 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 2404 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:03:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84866 states. [2024-10-12 16:03:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84866 to 81862. [2024-10-12 16:03:21,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81862 states, 81861 states have (on average 1.1201304650566204) internal successors, (91695), 81861 states have internal predecessors, (91695), 0 states have call successors, (0), 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-12 16:03:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81862 states to 81862 states and 91695 transitions. [2024-10-12 16:03:21,752 INFO L78 Accepts]: Start accepts. Automaton has 81862 states and 91695 transitions. Word has length 424 [2024-10-12 16:03:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:03:21,752 INFO L471 AbstractCegarLoop]: Abstraction has 81862 states and 91695 transitions. [2024-10-12 16:03:21,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 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-12 16:03:21,755 INFO L276 IsEmpty]: Start isEmpty. Operand 81862 states and 91695 transitions. [2024-10-12 16:03:21,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2024-10-12 16:03:21,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:03:21,787 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:03:21,805 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-12 16:03:21,988 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,SelfDestructingSolverStorable11 [2024-10-12 16:03:21,988 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:03:21,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:03:21,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2025521414, now seen corresponding path program 1 times [2024-10-12 16:03:21,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:03:21,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882280002] [2024-10-12 16:03:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:03:21,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:03:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:03:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-12 16:03:22,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:03:22,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882280002] [2024-10-12 16:03:22,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882280002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:03:22,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:03:22,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:03:22,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139792436] [2024-10-12 16:03:22,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:03:22,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:03:22,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:03:22,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:03:22,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:03:22,372 INFO L87 Difference]: Start difference. First operand 81862 states and 91695 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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-12 16:03:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:03:25,352 INFO L93 Difference]: Finished difference Result 204277 states and 228095 transitions. [2024-10-12 16:03:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:03:25,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 539 [2024-10-12 16:03:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:03:25,487 INFO L225 Difference]: With dead ends: 204277 [2024-10-12 16:03:25,488 INFO L226 Difference]: Without dead ends: 117159 [2024-10-12 16:03:25,737 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-12 16:03:25,737 INFO L432 NwaCegarLoop]: 1300 mSDtfsCounter, 648 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:03:25,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1307 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 16:03:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117159 states. [2024-10-12 16:03:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117159 to 115657. [2024-10-12 16:03:26,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115657 states, 115656 states have (on average 1.0992685204399253) internal successors, (127137), 115656 states have internal predecessors, (127137), 0 states have call successors, (0), 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-12 16:03:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115657 states to 115657 states and 127137 transitions. [2024-10-12 16:03:27,113 INFO L78 Accepts]: Start accepts. Automaton has 115657 states and 127137 transitions. Word has length 539 [2024-10-12 16:03:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:03:27,114 INFO L471 AbstractCegarLoop]: Abstraction has 115657 states and 127137 transitions. [2024-10-12 16:03:27,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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-12 16:03:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 115657 states and 127137 transitions. [2024-10-12 16:03:27,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2024-10-12 16:03:27,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:03:27,132 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-10-12 16:03:27,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:03:27,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:03:27,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:03:27,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1342252490, now seen corresponding path program 1 times [2024-10-12 16:03:27,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:03:27,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310878875] [2024-10-12 16:03:27,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:03:27,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:03:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:03:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 577 proven. 229 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 16:03:28,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:03:28,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310878875] [2024-10-12 16:03:28,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310878875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:03:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924684463] [2024-10-12 16:03:28,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:03:28,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:03:28,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:03:28,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:03:28,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 16:03:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:03:28,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:03:28,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:03:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-10-12 16:03:28,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:03:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924684463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:03:28,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:03:28,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:03:28,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263924380] [2024-10-12 16:03:28,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:03:28,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:03:28,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:03:28,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:03:28,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:03:28,999 INFO L87 Difference]: Start difference. First operand 115657 states and 127137 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-12 16:03:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:03:31,918 INFO L93 Difference]: Finished difference Result 230562 states and 253517 transitions. [2024-10-12 16:03:31,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:03:31,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 567 [2024-10-12 16:03:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:03:32,056 INFO L225 Difference]: With dead ends: 230562 [2024-10-12 16:03:32,057 INFO L226 Difference]: Without dead ends: 115657 [2024-10-12 16:03:32,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:03:32,088 INFO L432 NwaCegarLoop]: 1292 mSDtfsCounter, 680 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:03:32,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1299 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 16:03:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115657 states. [2024-10-12 16:03:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115657 to 111151. [2024-10-12 16:03:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111151 states, 111150 states have (on average 1.0641565452091768) internal successors, (118281), 111150 states have internal predecessors, (118281), 0 states have call successors, (0), 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-12 16:03:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111151 states to 111151 states and 118281 transitions. [2024-10-12 16:03:33,539 INFO L78 Accepts]: Start accepts. Automaton has 111151 states and 118281 transitions. Word has length 567 [2024-10-12 16:03:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:03:33,539 INFO L471 AbstractCegarLoop]: Abstraction has 111151 states and 118281 transitions. [2024-10-12 16:03:33,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-12 16:03:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 111151 states and 118281 transitions. [2024-10-12 16:03:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2024-10-12 16:03:33,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:03:33,561 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-10-12 16:03:33,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 16:03:33,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-12 16:03:33,762 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:03:33,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:03:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash 100165660, now seen corresponding path program 1 times [2024-10-12 16:03:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:03:33,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298846168] [2024-10-12 16:03:33,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:03:33,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:03:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:03:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-10-12 16:03:34,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:03:34,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298846168] [2024-10-12 16:03:34,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298846168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:03:34,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:03:34,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:03:34,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610554638] [2024-10-12 16:03:34,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:03:34,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:03:34,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:03:34,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:03:34,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:03:34,821 INFO L87 Difference]: Start difference. First operand 111151 states and 118281 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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-12 16:03:37,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:03:37,705 INFO L93 Difference]: Finished difference Result 226056 states and 240398 transitions. [2024-10-12 16:03:37,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:03:37,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 595 [2024-10-12 16:03:37,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:03:37,834 INFO L225 Difference]: With dead ends: 226056 [2024-10-12 16:03:37,834 INFO L226 Difference]: Without dead ends: 115657 [2024-10-12 16:03:37,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-12 16:03:37,878 INFO L432 NwaCegarLoop]: 1173 mSDtfsCounter, 680 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:03:37,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1179 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 16:03:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115657 states. [2024-10-12 16:03:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115657 to 108147. [2024-10-12 16:03:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108147 states, 108146 states have (on average 1.0461228339467017) internal successors, (113134), 108146 states have internal predecessors, (113134), 0 states have call successors, (0), 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-12 16:03:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108147 states to 108147 states and 113134 transitions. [2024-10-12 16:03:39,118 INFO L78 Accepts]: Start accepts. Automaton has 108147 states and 113134 transitions. Word has length 595 [2024-10-12 16:03:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:03:39,119 INFO L471 AbstractCegarLoop]: Abstraction has 108147 states and 113134 transitions. [2024-10-12 16:03:39,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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-12 16:03:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 108147 states and 113134 transitions. [2024-10-12 16:03:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2024-10-12 16:03:39,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:03:39,140 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 16:03:39,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:03:39,140 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:03:39,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:03:39,141 INFO L85 PathProgramCache]: Analyzing trace with hash 94838410, now seen corresponding path program 1 times [2024-10-12 16:03:39,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:03:39,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692504693] [2024-10-12 16:03:39,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:03:39,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:03:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:03:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2024-10-12 16:03:39,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:03:39,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692504693] [2024-10-12 16:03:39,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692504693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:03:39,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:03:39,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:03:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017536252] [2024-10-12 16:03:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:03:39,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:03:39,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:03:39,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:03:39,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:03:39,864 INFO L87 Difference]: Start difference. First operand 108147 states and 113134 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)