./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:41:42,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:41:42,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 23:41:42,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:41:42,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:41:42,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:41:42,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:41:42,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:41:42,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:41:42,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:41:42,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:41:42,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:41:42,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:41:42,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:41:42,089 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:41:42,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:41:42,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:41:42,089 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:41:42,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:41:42,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:41:42,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:41:42,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:41:42,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:41:42,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:41:42,091 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:41:42,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:41:42,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:41:42,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:41:42,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:41:42,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:41:42,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:41:42,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:41:42,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:41:42,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:41:42,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:41:42,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:41:42,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:41:42,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:41:42,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:41:42,096 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c [2024-10-12 23:41:42,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:41:42,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:41:42,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:41:42,384 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:41:42,384 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:41:42,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-12 23:41:43,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:41:43,846 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:41:43,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-12 23:41:43,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c7daa2f/a6e6a75c0fba4f22acf5db44c0b2456b/FLAG2924b6a35 [2024-10-12 23:41:43,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c7daa2f/a6e6a75c0fba4f22acf5db44c0b2456b [2024-10-12 23:41:43,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:41:43,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:41:43,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:41:43,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:41:43,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:41:43,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:41:43" (1/1) ... [2024-10-12 23:41:43,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20560331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:43, skipping insertion in model container [2024-10-12 23:41:43,876 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:41:43" (1/1) ... [2024-10-12 23:41:43,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:41:44,055 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-10-12 23:41:44,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:41:44,139 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:41:44,148 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-10-12 23:41:44,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:41:44,219 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:41:44,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44 WrapperNode [2024-10-12 23:41:44,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:41:44,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:41:44,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:41:44,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:41:44,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,294 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 484 [2024-10-12 23:41:44,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:41:44,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:41:44,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:41:44,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:41:44,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,345 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 23:41:44,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:41:44,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:41:44,398 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:41:44,398 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:41:44,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (1/1) ... [2024-10-12 23:41:44,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:41:44,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:41:44,432 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 23:41:44,438 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 23:41:44,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:41:44,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:41:44,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:41:44,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:41:44,626 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:41:44,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:41:45,183 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2024-10-12 23:41:45,183 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:41:45,217 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:41:45,217 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:41:45,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:41:45 BoogieIcfgContainer [2024-10-12 23:41:45,218 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:41:45,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:41:45,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:41:45,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:41:45,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:41:43" (1/3) ... [2024-10-12 23:41:45,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0f10ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:41:45, skipping insertion in model container [2024-10-12 23:41:45,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:41:44" (2/3) ... [2024-10-12 23:41:45,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f0f10ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:41:45, skipping insertion in model container [2024-10-12 23:41:45,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:41:45" (3/3) ... [2024-10-12 23:41:45,225 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-12 23:41:45,239 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:41:45,239 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:41:45,292 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:41:45,301 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;@4f7edb92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:41:45,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:41:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 121 states have (on average 1.5041322314049588) internal successors, (182), 122 states have internal predecessors, (182), 0 states have call successors, (0), 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 23:41:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 23:41:45,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:45,313 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] [2024-10-12 23:41:45,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:45,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:45,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1026487147, now seen corresponding path program 1 times [2024-10-12 23:41:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:45,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044228418] [2024-10-12 23:41:45,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:45,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:45,859 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 23:41:45,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:45,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044228418] [2024-10-12 23:41:45,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044228418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:45,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:45,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:41:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485601664] [2024-10-12 23:41:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:45,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:41:45,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:45,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:41:45,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:41:45,890 INFO L87 Difference]: Start difference. First operand has 123 states, 121 states have (on average 1.5041322314049588) internal successors, (182), 122 states have internal predecessors, (182), 0 states have call successors, (0), 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 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:41:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:45,945 INFO L93 Difference]: Finished difference Result 230 states and 342 transitions. [2024-10-12 23:41:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:41:45,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-12 23:41:45,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:45,957 INFO L225 Difference]: With dead ends: 230 [2024-10-12 23:41:45,957 INFO L226 Difference]: Without dead ends: 124 [2024-10-12 23:41:45,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:41:45,964 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:45,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 526 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:41:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-12 23:41:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-12 23:41:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 123 states have internal predecessors, (182), 0 states have call successors, (0), 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 23:41:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 182 transitions. [2024-10-12 23:41:46,001 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 182 transitions. Word has length 22 [2024-10-12 23:41:46,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:46,002 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 182 transitions. [2024-10-12 23:41:46,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:41:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 182 transitions. [2024-10-12 23:41:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 23:41:46,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:46,003 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] [2024-10-12 23:41:46,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:41:46,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:46,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:46,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1754635215, now seen corresponding path program 1 times [2024-10-12 23:41:46,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:46,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270247090] [2024-10-12 23:41:46,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:46,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:46,149 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 23:41:46,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:46,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270247090] [2024-10-12 23:41:46,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270247090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:46,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:46,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:41:46,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025498874] [2024-10-12 23:41:46,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:46,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:41:46,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:46,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:41:46,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:41:46,154 INFO L87 Difference]: Start difference. First operand 124 states and 182 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:41:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:46,189 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2024-10-12 23:41:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:41:46,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-12 23:41:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:46,190 INFO L225 Difference]: With dead ends: 233 [2024-10-12 23:41:46,190 INFO L226 Difference]: Without dead ends: 126 [2024-10-12 23:41:46,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:41:46,195 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:46,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:41:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-12 23:41:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-10-12 23:41:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.472) internal successors, (184), 125 states have internal predecessors, (184), 0 states have call successors, (0), 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 23:41:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2024-10-12 23:41:46,213 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 23 [2024-10-12 23:41:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:46,213 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2024-10-12 23:41:46,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:41:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2024-10-12 23:41:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 23:41:46,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:46,214 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] [2024-10-12 23:41:46,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:41:46,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:46,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:46,215 INFO L85 PathProgramCache]: Analyzing trace with hash 342917358, now seen corresponding path program 1 times [2024-10-12 23:41:46,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:46,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877660455] [2024-10-12 23:41:46,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:46,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:46,497 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 23:41:46,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:46,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877660455] [2024-10-12 23:41:46,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877660455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:46,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:46,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:41:46,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157419738] [2024-10-12 23:41:46,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:46,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:41:46,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:46,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:41:46,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:41:46,503 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 23:41:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:46,576 INFO L93 Difference]: Finished difference Result 249 states and 364 transitions. [2024-10-12 23:41:46,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:41:46,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-10-12 23:41:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:46,579 INFO L225 Difference]: With dead ends: 249 [2024-10-12 23:41:46,579 INFO L226 Difference]: Without dead ends: 140 [2024-10-12 23:41:46,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:41:46,581 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 26 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:46,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 994 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:41:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-12 23:41:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-10-12 23:41:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.463768115942029) internal successors, (202), 138 states have internal predecessors, (202), 0 states have call successors, (0), 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 23:41:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2024-10-12 23:41:46,592 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 24 [2024-10-12 23:41:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:46,592 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2024-10-12 23:41:46,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 23:41:46,593 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2024-10-12 23:41:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-12 23:41:46,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:46,594 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] [2024-10-12 23:41:46,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:41:46,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:46,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1556136331, now seen corresponding path program 1 times [2024-10-12 23:41:46,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:46,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573321242] [2024-10-12 23:41:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:47,227 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 23:41:47,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:47,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573321242] [2024-10-12 23:41:47,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573321242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:47,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:47,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 23:41:47,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132839143] [2024-10-12 23:41:47,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:47,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 23:41:47,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:47,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 23:41:47,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:41:47,233 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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 23:41:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:47,523 INFO L93 Difference]: Finished difference Result 341 states and 492 transitions. [2024-10-12 23:41:47,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 23:41:47,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2024-10-12 23:41:47,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:47,525 INFO L225 Difference]: With dead ends: 341 [2024-10-12 23:41:47,526 INFO L226 Difference]: Without dead ends: 226 [2024-10-12 23:41:47,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-10-12 23:41:47,528 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 148 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:47,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1409 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:41:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-12 23:41:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 145. [2024-10-12 23:41:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.4513888888888888) internal successors, (209), 144 states have internal predecessors, (209), 0 states have call successors, (0), 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 23:41:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 209 transitions. [2024-10-12 23:41:47,536 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 209 transitions. Word has length 26 [2024-10-12 23:41:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:47,537 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 209 transitions. [2024-10-12 23:41:47,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 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 23:41:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 209 transitions. [2024-10-12 23:41:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 23:41:47,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:47,538 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] [2024-10-12 23:41:47,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:41:47,538 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:47,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:47,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1734836073, now seen corresponding path program 1 times [2024-10-12 23:41:47,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:47,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610985785] [2024-10-12 23:41:47,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:47,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:47,883 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 23:41:47,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:47,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610985785] [2024-10-12 23:41:47,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610985785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:47,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:47,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:41:47,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790297884] [2024-10-12 23:41:47,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:47,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:41:47,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:47,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:41:47,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:41:47,885 INFO L87 Difference]: Start difference. First operand 145 states and 209 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 23:41:47,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:47,956 INFO L93 Difference]: Finished difference Result 254 states and 368 transitions. [2024-10-12 23:41:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:41:47,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-12 23:41:47,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:47,957 INFO L225 Difference]: With dead ends: 254 [2024-10-12 23:41:47,958 INFO L226 Difference]: Without dead ends: 140 [2024-10-12 23:41:47,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:41:47,959 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 25 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:47,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 996 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:41:47,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-12 23:41:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-10-12 23:41:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4532374100719425) internal successors, (202), 139 states have internal predecessors, (202), 0 states have call successors, (0), 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 23:41:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 202 transitions. [2024-10-12 23:41:47,968 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 202 transitions. Word has length 27 [2024-10-12 23:41:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:47,968 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 202 transitions. [2024-10-12 23:41:47,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 23:41:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 202 transitions. [2024-10-12 23:41:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 23:41:47,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:47,969 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] [2024-10-12 23:41:47,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 23:41:47,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:47,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash 185382780, now seen corresponding path program 1 times [2024-10-12 23:41:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:47,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324056165] [2024-10-12 23:41:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:47,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:48,100 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 23:41:48,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:48,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324056165] [2024-10-12 23:41:48,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324056165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:48,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:48,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:41:48,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758827100] [2024-10-12 23:41:48,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:48,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:41:48,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:48,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:41:48,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:41:48,102 INFO L87 Difference]: Start difference. First operand 140 states and 202 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 23:41:48,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:48,191 INFO L93 Difference]: Finished difference Result 319 states and 458 transitions. [2024-10-12 23:41:48,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:41:48,191 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-12 23:41:48,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:48,192 INFO L225 Difference]: With dead ends: 319 [2024-10-12 23:41:48,193 INFO L226 Difference]: Without dead ends: 199 [2024-10-12 23:41:48,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:41:48,194 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 108 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:48,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 975 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:41:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-12 23:41:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 141. [2024-10-12 23:41:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 140 states have internal predecessors, (202), 0 states have call successors, (0), 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 23:41:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2024-10-12 23:41:48,201 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 27 [2024-10-12 23:41:48,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:48,202 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2024-10-12 23:41:48,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 23:41:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2024-10-12 23:41:48,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 23:41:48,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:48,203 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] [2024-10-12 23:41:48,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 23:41:48,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -219183804, now seen corresponding path program 1 times [2024-10-12 23:41:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:48,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068474834] [2024-10-12 23:41:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:48,296 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 23:41:48,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:48,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068474834] [2024-10-12 23:41:48,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068474834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:48,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:48,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:41:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653564734] [2024-10-12 23:41:48,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:48,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:41:48,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:48,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:41:48,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:41:48,298 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 23:41:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:48,337 INFO L93 Difference]: Finished difference Result 311 states and 448 transitions. [2024-10-12 23:41:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:41:48,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-10-12 23:41:48,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:48,340 INFO L225 Difference]: With dead ends: 311 [2024-10-12 23:41:48,340 INFO L226 Difference]: Without dead ends: 191 [2024-10-12 23:41:48,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:41:48,347 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 106 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:48,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 665 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:41:48,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-12 23:41:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 134. [2024-10-12 23:41:48,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.443609022556391) internal successors, (192), 133 states have internal predecessors, (192), 0 states have call successors, (0), 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 23:41:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 192 transitions. [2024-10-12 23:41:48,358 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 192 transitions. Word has length 28 [2024-10-12 23:41:48,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:48,358 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 192 transitions. [2024-10-12 23:41:48,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 23:41:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 192 transitions. [2024-10-12 23:41:48,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 23:41:48,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:48,362 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:41:48,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 23:41:48,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:48,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:48,363 INFO L85 PathProgramCache]: Analyzing trace with hash 511610826, now seen corresponding path program 1 times [2024-10-12 23:41:48,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:48,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393596363] [2024-10-12 23:41:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:48,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:48,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:48,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393596363] [2024-10-12 23:41:48,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393596363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:48,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:48,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 23:41:48,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221209042] [2024-10-12 23:41:48,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:48,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 23:41:48,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:48,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 23:41:48,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:41:48,884 INFO L87 Difference]: Start difference. First operand 134 states and 192 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 23:41:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:49,003 INFO L93 Difference]: Finished difference Result 316 states and 458 transitions. [2024-10-12 23:41:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 23:41:49,004 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-12 23:41:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:49,005 INFO L225 Difference]: With dead ends: 316 [2024-10-12 23:41:49,005 INFO L226 Difference]: Without dead ends: 207 [2024-10-12 23:41:49,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-12 23:41:49,007 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 112 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:49,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1125 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:41:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-12 23:41:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 166. [2024-10-12 23:41:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.4303030303030304) internal successors, (236), 165 states have internal predecessors, (236), 0 states have call successors, (0), 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 23:41:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 236 transitions. [2024-10-12 23:41:49,012 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 236 transitions. Word has length 77 [2024-10-12 23:41:49,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:49,013 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 236 transitions. [2024-10-12 23:41:49,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 23:41:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 236 transitions. [2024-10-12 23:41:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 23:41:49,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:49,022 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:41:49,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 23:41:49,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:49,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:49,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1941714400, now seen corresponding path program 1 times [2024-10-12 23:41:49,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:49,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112579080] [2024-10-12 23:41:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:49,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:49,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112579080] [2024-10-12 23:41:49,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112579080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:49,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:49,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:41:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030563105] [2024-10-12 23:41:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:49,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:41:49,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:49,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:41:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:41:49,411 INFO L87 Difference]: Start difference. First operand 166 states and 236 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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 23:41:49,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:49,470 INFO L93 Difference]: Finished difference Result 321 states and 461 transitions. [2024-10-12 23:41:49,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:41:49,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-10-12 23:41:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:49,472 INFO L225 Difference]: With dead ends: 321 [2024-10-12 23:41:49,472 INFO L226 Difference]: Without dead ends: 199 [2024-10-12 23:41:49,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:41:49,473 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 109 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:49,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 996 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:41:49,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-12 23:41:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 169. [2024-10-12 23:41:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.4226190476190477) internal successors, (239), 168 states have internal predecessors, (239), 0 states have call successors, (0), 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 23:41:49,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 239 transitions. [2024-10-12 23:41:49,477 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 239 transitions. Word has length 78 [2024-10-12 23:41:49,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:49,477 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 239 transitions. [2024-10-12 23:41:49,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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 23:41:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 239 transitions. [2024-10-12 23:41:49,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 23:41:49,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:49,480 INFO L215 NwaCegarLoop]: trace histogram [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 23:41:49,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 23:41:49,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:49,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:49,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1175772378, now seen corresponding path program 1 times [2024-10-12 23:41:49,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:49,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003776145] [2024-10-12 23:41:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:49,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:49,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:49,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003776145] [2024-10-12 23:41:49,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003776145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:49,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:49,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:41:49,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189791859] [2024-10-12 23:41:49,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:49,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:41:49,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:49,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:41:49,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:41:49,887 INFO L87 Difference]: Start difference. First operand 169 states and 239 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 23:41:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:49,900 INFO L93 Difference]: Finished difference Result 278 states and 398 transitions. [2024-10-12 23:41:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:41:49,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-10-12 23:41:49,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:49,901 INFO L225 Difference]: With dead ends: 278 [2024-10-12 23:41:49,901 INFO L226 Difference]: Without dead ends: 169 [2024-10-12 23:41:49,901 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 23:41:49,902 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 2 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:49,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 346 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:41:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-12 23:41:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-10-12 23:41:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.4166666666666667) internal successors, (238), 168 states have internal predecessors, (238), 0 states have call successors, (0), 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 23:41:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 238 transitions. [2024-10-12 23:41:49,907 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 238 transitions. Word has length 79 [2024-10-12 23:41:49,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:49,907 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 238 transitions. [2024-10-12 23:41:49,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 23:41:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 238 transitions. [2024-10-12 23:41:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 23:41:49,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:49,908 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:41:49,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 23:41:49,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:49,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:49,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1353017429, now seen corresponding path program 1 times [2024-10-12 23:41:49,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:49,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189772795] [2024-10-12 23:41:49,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:50,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:50,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189772795] [2024-10-12 23:41:50,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189772795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:50,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:50,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-12 23:41:50,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125252282] [2024-10-12 23:41:50,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:50,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 23:41:50,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:50,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 23:41:50,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:41:50,941 INFO L87 Difference]: Start difference. First operand 169 states and 238 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 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 23:41:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:51,165 INFO L93 Difference]: Finished difference Result 333 states and 477 transitions. [2024-10-12 23:41:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 23:41:51,165 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-10-12 23:41:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:51,166 INFO L225 Difference]: With dead ends: 333 [2024-10-12 23:41:51,166 INFO L226 Difference]: Without dead ends: 224 [2024-10-12 23:41:51,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:41:51,167 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 86 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1833 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:51,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1833 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:41:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-12 23:41:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2024-10-12 23:41:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.413953488372093) internal successors, (304), 215 states have internal predecessors, (304), 0 states have call successors, (0), 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 23:41:51,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 304 transitions. [2024-10-12 23:41:51,174 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 304 transitions. Word has length 80 [2024-10-12 23:41:51,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:51,174 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 304 transitions. [2024-10-12 23:41:51,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 0 states have call successors, (0), 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 23:41:51,174 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 304 transitions. [2024-10-12 23:41:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 23:41:51,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:51,175 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:41:51,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 23:41:51,175 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:51,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1342262796, now seen corresponding path program 1 times [2024-10-12 23:41:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:51,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677064651] [2024-10-12 23:41:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:52,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:52,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:52,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677064651] [2024-10-12 23:41:52,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677064651] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:41:52,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399005892] [2024-10-12 23:41:52,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:52,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:41:52,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:41:52,181 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 23:41:52,186 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 23:41:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:52,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 125 conjuncts are in the unsatisfiable core [2024-10-12 23:41:52,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:41:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:54,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:41:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:56,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399005892] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 23:41:56,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:41:56,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [19, 30] total 75 [2024-10-12 23:41:56,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608252375] [2024-10-12 23:41:56,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:56,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 23:41:56,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:56,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 23:41:56,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=5102, Unknown=0, NotChecked=0, Total=5550 [2024-10-12 23:41:56,145 INFO L87 Difference]: Start difference. First operand 216 states and 304 transitions. Second operand has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 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 23:41:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:57,674 INFO L93 Difference]: Finished difference Result 423 states and 603 transitions. [2024-10-12 23:41:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-12 23:41:57,675 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-12 23:41:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:57,676 INFO L225 Difference]: With dead ends: 423 [2024-10-12 23:41:57,676 INFO L226 Difference]: Without dead ends: 314 [2024-10-12 23:41:57,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1841 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=495, Invalid=5825, Unknown=0, NotChecked=0, Total=6320 [2024-10-12 23:41:57,678 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 127 mSDsluCounter, 3141 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 3265 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:57,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 3265 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 23:41:57,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-12 23:41:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 300. [2024-10-12 23:41:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.4214046822742474) internal successors, (425), 299 states have internal predecessors, (425), 0 states have call successors, (0), 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 23:41:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 425 transitions. [2024-10-12 23:41:57,684 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 425 transitions. Word has length 81 [2024-10-12 23:41:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:57,684 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 425 transitions. [2024-10-12 23:41:57,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 29 states have internal predecessors, (81), 0 states have call successors, (0), 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 23:41:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 425 transitions. [2024-10-12 23:41:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 23:41:57,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:57,687 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:41:57,702 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 23:41:57,887 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 23:41:57,888 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:57,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1220930199, now seen corresponding path program 1 times [2024-10-12 23:41:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:57,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702426551] [2024-10-12 23:41:57,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:58,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:58,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702426551] [2024-10-12 23:41:58,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702426551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:58,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:58,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:41:58,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616093013] [2024-10-12 23:41:58,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:58,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:41:58,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:58,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:41:58,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:41:58,075 INFO L87 Difference]: Start difference. First operand 300 states and 425 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 23:41:58,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:58,104 INFO L93 Difference]: Finished difference Result 508 states and 729 transitions. [2024-10-12 23:41:58,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:41:58,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-12 23:41:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:58,105 INFO L225 Difference]: With dead ends: 508 [2024-10-12 23:41:58,106 INFO L226 Difference]: Without dead ends: 347 [2024-10-12 23:41:58,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:41:58,107 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 71 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:58,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 652 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:41:58,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-12 23:41:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-10-12 23:41:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 1.4190751445086704) internal successors, (491), 346 states have internal predecessors, (491), 0 states have call successors, (0), 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 23:41:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 491 transitions. [2024-10-12 23:41:58,115 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 491 transitions. Word has length 81 [2024-10-12 23:41:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:58,115 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 491 transitions. [2024-10-12 23:41:58,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 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 23:41:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 491 transitions. [2024-10-12 23:41:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 23:41:58,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:58,117 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:41:58,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 23:41:58,118 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:58,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:58,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1025730167, now seen corresponding path program 1 times [2024-10-12 23:41:58,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:58,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68597395] [2024-10-12 23:41:58,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:58,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:58,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:58,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:58,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68597395] [2024-10-12 23:41:58,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68597395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:58,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:58,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-12 23:41:58,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513726800] [2024-10-12 23:41:58,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:58,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 23:41:58,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:58,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 23:41:58,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:41:58,782 INFO L87 Difference]: Start difference. First operand 347 states and 491 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 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 23:41:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:59,027 INFO L93 Difference]: Finished difference Result 641 states and 917 transitions. [2024-10-12 23:41:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 23:41:59,028 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-12 23:41:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:59,030 INFO L225 Difference]: With dead ends: 641 [2024-10-12 23:41:59,030 INFO L226 Difference]: Without dead ends: 462 [2024-10-12 23:41:59,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:41:59,031 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 78 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:59,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1690 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:41:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-12 23:41:59,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 412. [2024-10-12 23:41:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.413625304136253) internal successors, (581), 411 states have internal predecessors, (581), 0 states have call successors, (0), 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 23:41:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 581 transitions. [2024-10-12 23:41:59,039 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 581 transitions. Word has length 81 [2024-10-12 23:41:59,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:59,040 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 581 transitions. [2024-10-12 23:41:59,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 14 states have internal predecessors, (81), 0 states have call successors, (0), 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 23:41:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 581 transitions. [2024-10-12 23:41:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 23:41:59,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:59,041 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:41:59,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 23:41:59,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:59,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1961321509, now seen corresponding path program 1 times [2024-10-12 23:41:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894047637] [2024-10-12 23:41:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:59,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:59,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894047637] [2024-10-12 23:41:59,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894047637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:59,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:59,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:41:59,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386708495] [2024-10-12 23:41:59,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:59,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:41:59,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:59,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:41:59,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:41:59,221 INFO L87 Difference]: Start difference. First operand 412 states and 581 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 23:41:59,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:59,269 INFO L93 Difference]: Finished difference Result 674 states and 957 transitions. [2024-10-12 23:41:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:41:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-10-12 23:41:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:59,271 INFO L225 Difference]: With dead ends: 674 [2024-10-12 23:41:59,271 INFO L226 Difference]: Without dead ends: 410 [2024-10-12 23:41:59,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:41:59,272 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 57 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:59,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 817 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:41:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-12 23:41:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2024-10-12 23:41:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4083129584352079) internal successors, (576), 409 states have internal predecessors, (576), 0 states have call successors, (0), 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 23:41:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 576 transitions. [2024-10-12 23:41:59,280 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 576 transitions. Word has length 81 [2024-10-12 23:41:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:59,280 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 576 transitions. [2024-10-12 23:41:59,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 23:41:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 576 transitions. [2024-10-12 23:41:59,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 23:41:59,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:59,281 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:41:59,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 23:41:59,282 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:59,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1668046962, now seen corresponding path program 1 times [2024-10-12 23:41:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:59,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138928494] [2024-10-12 23:41:59,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:59,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:59,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:59,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138928494] [2024-10-12 23:41:59,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138928494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:41:59,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:41:59,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:41:59,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089169780] [2024-10-12 23:41:59,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:41:59,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:41:59,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:41:59,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:41:59,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:41:59,440 INFO L87 Difference]: Start difference. First operand 410 states and 576 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 23:41:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:41:59,467 INFO L93 Difference]: Finished difference Result 574 states and 815 transitions. [2024-10-12 23:41:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:41:59,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-10-12 23:41:59,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:41:59,469 INFO L225 Difference]: With dead ends: 574 [2024-10-12 23:41:59,469 INFO L226 Difference]: Without dead ends: 414 [2024-10-12 23:41:59,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:41:59,470 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 2 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:41:59,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 673 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:41:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-12 23:41:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 413. [2024-10-12 23:41:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.4077669902912622) internal successors, (580), 412 states have internal predecessors, (580), 0 states have call successors, (0), 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 23:41:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 580 transitions. [2024-10-12 23:41:59,477 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 580 transitions. Word has length 82 [2024-10-12 23:41:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:41:59,478 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 580 transitions. [2024-10-12 23:41:59,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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 23:41:59,478 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 580 transitions. [2024-10-12 23:41:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 23:41:59,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:41:59,479 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:41:59,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 23:41:59,479 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:41:59,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:41:59,479 INFO L85 PathProgramCache]: Analyzing trace with hash -430639366, now seen corresponding path program 1 times [2024-10-12 23:41:59,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:41:59,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357876048] [2024-10-12 23:41:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:41:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:41:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:41:59,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:41:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357876048] [2024-10-12 23:41:59,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357876048] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:41:59,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133451357] [2024-10-12 23:41:59,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:41:59,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:41:59,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:41:59,902 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 23:41:59,904 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 23:42:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:00,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-12 23:42:00,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:42:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:00,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:42:01,413 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:01,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133451357] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:42:01,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:42:01,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 27, 20] total 52 [2024-10-12 23:42:01,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631050171] [2024-10-12 23:42:01,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:42:01,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-12 23:42:01,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:01,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-12 23:42:01,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=2247, Unknown=0, NotChecked=0, Total=2756 [2024-10-12 23:42:01,416 INFO L87 Difference]: Start difference. First operand 413 states and 580 transitions. Second operand has 53 states, 53 states have (on average 4.264150943396227) internal successors, (226), 52 states have internal predecessors, (226), 0 states have call successors, (0), 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 23:42:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:02,580 INFO L93 Difference]: Finished difference Result 869 states and 1241 transitions. [2024-10-12 23:42:02,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-12 23:42:02,581 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 4.264150943396227) internal successors, (226), 52 states have internal predecessors, (226), 0 states have call successors, (0), 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 82 [2024-10-12 23:42:02,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:02,583 INFO L225 Difference]: With dead ends: 869 [2024-10-12 23:42:02,583 INFO L226 Difference]: Without dead ends: 706 [2024-10-12 23:42:02,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2224 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1269, Invalid=6563, Unknown=0, NotChecked=0, Total=7832 [2024-10-12 23:42:02,586 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1354 mSDsluCounter, 3363 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 3494 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:02,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 3494 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 23:42:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2024-10-12 23:42:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 613. [2024-10-12 23:42:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 1.4199346405228759) internal successors, (869), 612 states have internal predecessors, (869), 0 states have call successors, (0), 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 23:42:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 869 transitions. [2024-10-12 23:42:02,595 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 869 transitions. Word has length 82 [2024-10-12 23:42:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:02,595 INFO L471 AbstractCegarLoop]: Abstraction has 613 states and 869 transitions. [2024-10-12 23:42:02,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.264150943396227) internal successors, (226), 52 states have internal predecessors, (226), 0 states have call successors, (0), 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 23:42:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 869 transitions. [2024-10-12 23:42:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 23:42:02,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:02,596 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:02,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:42:02,800 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,SelfDestructingSolverStorable16 [2024-10-12 23:42:02,801 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:02,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:02,801 INFO L85 PathProgramCache]: Analyzing trace with hash -285469247, now seen corresponding path program 1 times [2024-10-12 23:42:02,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:02,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350508065] [2024-10-12 23:42:02,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:02,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:03,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350508065] [2024-10-12 23:42:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350508065] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:42:03,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216358566] [2024-10-12 23:42:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:03,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:42:03,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:42:03,516 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:42:03,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 23:42:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:03,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 141 conjuncts are in the unsatisfiable core [2024-10-12 23:42:03,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:42:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:04,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:42:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:06,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216358566] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:42:06,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:42:06,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 31, 31] total 76 [2024-10-12 23:42:06,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13820971] [2024-10-12 23:42:06,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:42:06,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2024-10-12 23:42:06,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:06,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2024-10-12 23:42:06,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=5270, Unknown=0, NotChecked=0, Total=5852 [2024-10-12 23:42:06,998 INFO L87 Difference]: Start difference. First operand 613 states and 869 transitions. Second operand has 77 states, 77 states have (on average 2.935064935064935) internal successors, (226), 76 states have internal predecessors, (226), 0 states have call successors, (0), 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 23:42:11,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:11,070 INFO L93 Difference]: Finished difference Result 1496 states and 2145 transitions. [2024-10-12 23:42:11,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-10-12 23:42:11,070 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 2.935064935064935) internal successors, (226), 76 states have internal predecessors, (226), 0 states have call successors, (0), 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 82 [2024-10-12 23:42:11,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:11,073 INFO L225 Difference]: With dead ends: 1496 [2024-10-12 23:42:11,073 INFO L226 Difference]: Without dead ends: 1021 [2024-10-12 23:42:11,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4566 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1484, Invalid=13768, Unknown=0, NotChecked=0, Total=15252 [2024-10-12 23:42:11,077 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 1244 mSDsluCounter, 4803 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1244 SdHoareTripleChecker+Valid, 4921 SdHoareTripleChecker+Invalid, 2959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:11,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1244 Valid, 4921 Invalid, 2959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2927 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 23:42:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2024-10-12 23:42:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 890. [2024-10-12 23:42:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.4308211473565804) internal successors, (1272), 889 states have internal predecessors, (1272), 0 states have call successors, (0), 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 23:42:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1272 transitions. [2024-10-12 23:42:11,091 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1272 transitions. Word has length 82 [2024-10-12 23:42:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:11,091 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1272 transitions. [2024-10-12 23:42:11,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 2.935064935064935) internal successors, (226), 76 states have internal predecessors, (226), 0 states have call successors, (0), 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 23:42:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1272 transitions. [2024-10-12 23:42:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 23:42:11,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:11,093 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:11,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 23:42:11,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-12 23:42:11,294 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:11,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:11,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1304933153, now seen corresponding path program 1 times [2024-10-12 23:42:11,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:11,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154356555] [2024-10-12 23:42:11,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:11,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:11,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:11,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154356555] [2024-10-12 23:42:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154356555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:42:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130521762] [2024-10-12 23:42:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:11,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:42:11,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:42:11,723 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:42:11,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 23:42:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:11,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-10-12 23:42:11,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:42:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:12,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:42:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:12,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130521762] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 23:42:12,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:42:12,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 24] total 39 [2024-10-12 23:42:12,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198744715] [2024-10-12 23:42:12,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:12,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 23:42:12,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:12,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 23:42:12,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1366, Unknown=0, NotChecked=0, Total=1482 [2024-10-12 23:42:12,773 INFO L87 Difference]: Start difference. First operand 890 states and 1272 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 23:42:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:13,027 INFO L93 Difference]: Finished difference Result 1881 states and 2710 transitions. [2024-10-12 23:42:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 23:42:13,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 23:42:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:13,034 INFO L225 Difference]: With dead ends: 1881 [2024-10-12 23:42:13,034 INFO L226 Difference]: Without dead ends: 1290 [2024-10-12 23:42:13,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 131 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=2012, Unknown=0, NotChecked=0, Total=2162 [2024-10-12 23:42:13,036 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 146 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:13,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 2220 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2024-10-12 23:42:13,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1027. [2024-10-12 23:42:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 1.4249512670565303) internal successors, (1462), 1026 states have internal predecessors, (1462), 0 states have call successors, (0), 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 23:42:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1462 transitions. [2024-10-12 23:42:13,058 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1462 transitions. Word has length 83 [2024-10-12 23:42:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:13,058 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1462 transitions. [2024-10-12 23:42:13,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 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 23:42:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1462 transitions. [2024-10-12 23:42:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 23:42:13,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:13,061 INFO L215 NwaCegarLoop]: trace histogram [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 23:42:13,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 23:42:13,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:42:13,261 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:13,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1607812553, now seen corresponding path program 1 times [2024-10-12 23:42:13,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:13,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153417790] [2024-10-12 23:42:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:13,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:13,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153417790] [2024-10-12 23:42:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153417790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:13,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:13,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:42:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609334003] [2024-10-12 23:42:13,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:13,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:42:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:13,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:42:13,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:42:13,447 INFO L87 Difference]: Start difference. First operand 1027 states and 1462 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 23:42:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:13,483 INFO L93 Difference]: Finished difference Result 1466 states and 2100 transitions. [2024-10-12 23:42:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:42:13,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-12 23:42:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:13,487 INFO L225 Difference]: With dead ends: 1466 [2024-10-12 23:42:13,487 INFO L226 Difference]: Without dead ends: 998 [2024-10-12 23:42:13,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:42:13,488 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 54 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:13,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 661 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:42:13,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-10-12 23:42:13,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2024-10-12 23:42:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 1.423269809428285) internal successors, (1419), 997 states have internal predecessors, (1419), 0 states have call successors, (0), 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 23:42:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1419 transitions. [2024-10-12 23:42:13,508 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1419 transitions. Word has length 83 [2024-10-12 23:42:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:13,508 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1419 transitions. [2024-10-12 23:42:13,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 23:42:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1419 transitions. [2024-10-12 23:42:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 23:42:13,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:13,510 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:13,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 23:42:13,510 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:13,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash 671859933, now seen corresponding path program 1 times [2024-10-12 23:42:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:13,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041569550] [2024-10-12 23:42:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:13,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041569550] [2024-10-12 23:42:13,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041569550] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:42:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230511360] [2024-10-12 23:42:13,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:13,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:42:13,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:42:13,942 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:42:13,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 23:42:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:14,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-12 23:42:14,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:42:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 23:42:14,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:42:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:14,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230511360] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:42:14,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:42:14,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 21 [2024-10-12 23:42:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317957593] [2024-10-12 23:42:14,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:42:14,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 23:42:14,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:14,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 23:42:14,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-10-12 23:42:14,537 INFO L87 Difference]: Start difference. First operand 998 states and 1419 transitions. Second operand has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 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 23:42:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:14,750 INFO L93 Difference]: Finished difference Result 3103 states and 4433 transitions. [2024-10-12 23:42:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 23:42:14,751 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 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 84 [2024-10-12 23:42:14,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:14,757 INFO L225 Difference]: With dead ends: 3103 [2024-10-12 23:42:14,757 INFO L226 Difference]: Without dead ends: 2156 [2024-10-12 23:42:14,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 152 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2024-10-12 23:42:14,760 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 453 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 2130 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:14,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 2130 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2024-10-12 23:42:14,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1902. [2024-10-12 23:42:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1901 states have (on average 1.4213571804313518) internal successors, (2702), 1901 states have internal predecessors, (2702), 0 states have call successors, (0), 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 23:42:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2702 transitions. [2024-10-12 23:42:14,804 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2702 transitions. Word has length 84 [2024-10-12 23:42:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:14,804 INFO L471 AbstractCegarLoop]: Abstraction has 1902 states and 2702 transitions. [2024-10-12 23:42:14,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.954545454545454) internal successors, (153), 21 states have internal predecessors, (153), 0 states have call successors, (0), 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 23:42:14,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2702 transitions. [2024-10-12 23:42:14,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 23:42:14,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:14,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:14,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 23:42:15,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:42:15,008 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:15,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:15,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1778887901, now seen corresponding path program 1 times [2024-10-12 23:42:15,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:15,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652015908] [2024-10-12 23:42:15,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:15,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:15,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:15,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652015908] [2024-10-12 23:42:15,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652015908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:15,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:15,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-12 23:42:15,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578035007] [2024-10-12 23:42:15,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:15,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 23:42:15,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:15,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 23:42:15,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-10-12 23:42:15,659 INFO L87 Difference]: Start difference. First operand 1902 states and 2702 transitions. Second operand has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:15,908 INFO L93 Difference]: Finished difference Result 3399 states and 4858 transitions. [2024-10-12 23:42:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 23:42:15,909 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 23:42:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:15,914 INFO L225 Difference]: With dead ends: 3399 [2024-10-12 23:42:15,914 INFO L226 Difference]: Without dead ends: 1994 [2024-10-12 23:42:15,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2024-10-12 23:42:15,916 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 72 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:15,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 2807 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:42:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-10-12 23:42:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2024-10-12 23:42:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1993 states have (on average 1.4199698946312092) internal successors, (2830), 1993 states have internal predecessors, (2830), 0 states have call successors, (0), 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 23:42:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2830 transitions. [2024-10-12 23:42:15,944 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2830 transitions. Word has length 84 [2024-10-12 23:42:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:15,944 INFO L471 AbstractCegarLoop]: Abstraction has 1994 states and 2830 transitions. [2024-10-12 23:42:15,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.666666666666667) internal successors, (84), 17 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2830 transitions. [2024-10-12 23:42:15,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 23:42:15,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:15,946 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:15,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 23:42:15,946 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:15,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:15,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1982942795, now seen corresponding path program 1 times [2024-10-12 23:42:15,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:15,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455867796] [2024-10-12 23:42:15,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:15,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:16,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:16,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:16,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455867796] [2024-10-12 23:42:16,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455867796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:16,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:16,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 23:42:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75935770] [2024-10-12 23:42:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:16,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 23:42:16,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:16,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 23:42:16,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-10-12 23:42:16,545 INFO L87 Difference]: Start difference. First operand 1994 states and 2830 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:16,842 INFO L93 Difference]: Finished difference Result 2899 states and 4140 transitions. [2024-10-12 23:42:16,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 23:42:16,843 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 23:42:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:16,848 INFO L225 Difference]: With dead ends: 2899 [2024-10-12 23:42:16,848 INFO L226 Difference]: Without dead ends: 1994 [2024-10-12 23:42:16,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-10-12 23:42:16,850 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 128 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:16,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1978 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:42:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-10-12 23:42:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2024-10-12 23:42:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1993 states have (on average 1.4189663823381837) internal successors, (2828), 1993 states have internal predecessors, (2828), 0 states have call successors, (0), 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 23:42:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2828 transitions. [2024-10-12 23:42:16,880 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2828 transitions. Word has length 84 [2024-10-12 23:42:16,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:16,880 INFO L471 AbstractCegarLoop]: Abstraction has 1994 states and 2828 transitions. [2024-10-12 23:42:16,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2828 transitions. [2024-10-12 23:42:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 23:42:16,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:16,882 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:16,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 23:42:16,882 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:16,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1223948047, now seen corresponding path program 1 times [2024-10-12 23:42:16,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:16,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023744049] [2024-10-12 23:42:16,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:16,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:17,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:17,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023744049] [2024-10-12 23:42:17,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023744049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:17,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:17,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 23:42:17,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079515027] [2024-10-12 23:42:17,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:17,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 23:42:17,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:17,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 23:42:17,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:42:17,310 INFO L87 Difference]: Start difference. First operand 1994 states and 2828 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:17,404 INFO L93 Difference]: Finished difference Result 3683 states and 5254 transitions. [2024-10-12 23:42:17,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 23:42:17,407 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 23:42:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:17,412 INFO L225 Difference]: With dead ends: 3683 [2024-10-12 23:42:17,412 INFO L226 Difference]: Without dead ends: 2006 [2024-10-12 23:42:17,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:42:17,417 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 43 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:17,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1433 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:17,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2024-10-12 23:42:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2002. [2024-10-12 23:42:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2002 states, 2001 states have (on average 1.4162918540729634) internal successors, (2834), 2001 states have internal predecessors, (2834), 0 states have call successors, (0), 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 23:42:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2002 states to 2002 states and 2834 transitions. [2024-10-12 23:42:17,444 INFO L78 Accepts]: Start accepts. Automaton has 2002 states and 2834 transitions. Word has length 84 [2024-10-12 23:42:17,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:17,445 INFO L471 AbstractCegarLoop]: Abstraction has 2002 states and 2834 transitions. [2024-10-12 23:42:17,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:17,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2002 states and 2834 transitions. [2024-10-12 23:42:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 23:42:17,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:17,446 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:17,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 23:42:17,447 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:17,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1618460986, now seen corresponding path program 1 times [2024-10-12 23:42:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:17,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672268151] [2024-10-12 23:42:17,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:17,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:17,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:17,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672268151] [2024-10-12 23:42:17,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672268151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:17,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:17,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 23:42:17,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920204873] [2024-10-12 23:42:17,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:17,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:42:17,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:17,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:42:17,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:42:17,721 INFO L87 Difference]: Start difference. First operand 2002 states and 2834 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:17,825 INFO L93 Difference]: Finished difference Result 3289 states and 4685 transitions. [2024-10-12 23:42:17,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:42:17,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 23:42:17,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:17,834 INFO L225 Difference]: With dead ends: 3289 [2024-10-12 23:42:17,836 INFO L226 Difference]: Without dead ends: 1964 [2024-10-12 23:42:17,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-12 23:42:17,838 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 88 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:17,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 980 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-10-12 23:42:17,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1960. [2024-10-12 23:42:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1959 states have (on average 1.4139867279224094) internal successors, (2770), 1959 states have internal predecessors, (2770), 0 states have call successors, (0), 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 23:42:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2770 transitions. [2024-10-12 23:42:17,870 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2770 transitions. Word has length 84 [2024-10-12 23:42:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:17,870 INFO L471 AbstractCegarLoop]: Abstraction has 1960 states and 2770 transitions. [2024-10-12 23:42:17,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2770 transitions. [2024-10-12 23:42:17,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 23:42:17,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:17,872 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:17,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 23:42:17,872 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:17,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:17,872 INFO L85 PathProgramCache]: Analyzing trace with hash -7718258, now seen corresponding path program 1 times [2024-10-12 23:42:17,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:17,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228955541] [2024-10-12 23:42:17,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:17,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:18,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228955541] [2024-10-12 23:42:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228955541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:18,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:18,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 23:42:18,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516501285] [2024-10-12 23:42:18,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:18,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:42:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:18,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:42:18,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:42:18,086 INFO L87 Difference]: Start difference. First operand 1960 states and 2770 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:18,130 INFO L93 Difference]: Finished difference Result 3695 states and 5268 transitions. [2024-10-12 23:42:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:42:18,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 23:42:18,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:18,136 INFO L225 Difference]: With dead ends: 3695 [2024-10-12 23:42:18,136 INFO L226 Difference]: Without dead ends: 2192 [2024-10-12 23:42:18,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:42:18,138 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 5 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:18,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1014 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:42:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2024-10-12 23:42:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2136. [2024-10-12 23:42:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 2135 states have (on average 1.4042154566744731) internal successors, (2998), 2135 states have internal predecessors, (2998), 0 states have call successors, (0), 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 23:42:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 2998 transitions. [2024-10-12 23:42:18,168 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 2998 transitions. Word has length 84 [2024-10-12 23:42:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:18,168 INFO L471 AbstractCegarLoop]: Abstraction has 2136 states and 2998 transitions. [2024-10-12 23:42:18,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:18,168 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 2998 transitions. [2024-10-12 23:42:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 23:42:18,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:18,170 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:18,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 23:42:18,170 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:18,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:18,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1450746286, now seen corresponding path program 1 times [2024-10-12 23:42:18,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:18,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984642766] [2024-10-12 23:42:18,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:18,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:18,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:18,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984642766] [2024-10-12 23:42:18,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984642766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:18,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:18,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 23:42:18,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717954918] [2024-10-12 23:42:18,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:18,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 23:42:18,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:18,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 23:42:18,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:42:18,468 INFO L87 Difference]: Start difference. First operand 2136 states and 2998 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:18,546 INFO L93 Difference]: Finished difference Result 3740 states and 5303 transitions. [2024-10-12 23:42:18,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 23:42:18,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 23:42:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:18,551 INFO L225 Difference]: With dead ends: 3740 [2024-10-12 23:42:18,551 INFO L226 Difference]: Without dead ends: 2274 [2024-10-12 23:42:18,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:42:18,553 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 11 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:18,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1425 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2024-10-12 23:42:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2190. [2024-10-12 23:42:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2190 states, 2189 states have (on average 1.3988122430333485) internal successors, (3062), 2189 states have internal predecessors, (3062), 0 states have call successors, (0), 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 23:42:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2190 states to 2190 states and 3062 transitions. [2024-10-12 23:42:18,581 INFO L78 Accepts]: Start accepts. Automaton has 2190 states and 3062 transitions. Word has length 84 [2024-10-12 23:42:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:18,582 INFO L471 AbstractCegarLoop]: Abstraction has 2190 states and 3062 transitions. [2024-10-12 23:42:18,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2190 states and 3062 transitions. [2024-10-12 23:42:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 23:42:18,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:18,584 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:18,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 23:42:18,584 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:18,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:18,585 INFO L85 PathProgramCache]: Analyzing trace with hash -240067284, now seen corresponding path program 1 times [2024-10-12 23:42:18,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:18,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276737690] [2024-10-12 23:42:18,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:18,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:19,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276737690] [2024-10-12 23:42:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276737690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:19,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 23:42:19,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280355396] [2024-10-12 23:42:19,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:19,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 23:42:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:19,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 23:42:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-10-12 23:42:19,103 INFO L87 Difference]: Start difference. First operand 2190 states and 3062 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:19,277 INFO L93 Difference]: Finished difference Result 3901 states and 5486 transitions. [2024-10-12 23:42:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 23:42:19,277 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-12 23:42:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:19,282 INFO L225 Difference]: With dead ends: 3901 [2024-10-12 23:42:19,282 INFO L226 Difference]: Without dead ends: 2196 [2024-10-12 23:42:19,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:42:19,285 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 62 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:19,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1741 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:19,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2196 states. [2024-10-12 23:42:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2196 to 2192. [2024-10-12 23:42:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2192 states, 2191 states have (on average 1.3957097215883159) internal successors, (3058), 2191 states have internal predecessors, (3058), 0 states have call successors, (0), 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 23:42:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2192 states to 2192 states and 3058 transitions. [2024-10-12 23:42:19,323 INFO L78 Accepts]: Start accepts. Automaton has 2192 states and 3058 transitions. Word has length 84 [2024-10-12 23:42:19,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:19,323 INFO L471 AbstractCegarLoop]: Abstraction has 2192 states and 3058 transitions. [2024-10-12 23:42:19,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 13 states have internal predecessors, (84), 0 states have call successors, (0), 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 23:42:19,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2192 states and 3058 transitions. [2024-10-12 23:42:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 23:42:19,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:19,325 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:19,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 23:42:19,325 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:19,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:19,325 INFO L85 PathProgramCache]: Analyzing trace with hash -212741439, now seen corresponding path program 1 times [2024-10-12 23:42:19,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:19,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673406695] [2024-10-12 23:42:19,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:19,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:19,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:19,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673406695] [2024-10-12 23:42:19,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673406695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:19,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:19,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 23:42:19,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766863399] [2024-10-12 23:42:19,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:19,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:42:19,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:19,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:42:19,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:42:19,836 INFO L87 Difference]: Start difference. First operand 2192 states and 3058 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:19,904 INFO L93 Difference]: Finished difference Result 3812 states and 5384 transitions. [2024-10-12 23:42:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:42:19,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 23:42:19,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:19,910 INFO L225 Difference]: With dead ends: 3812 [2024-10-12 23:42:19,911 INFO L226 Difference]: Without dead ends: 2300 [2024-10-12 23:42:19,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:42:19,916 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 7 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:19,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1152 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2300 states. [2024-10-12 23:42:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2300 to 2280. [2024-10-12 23:42:19,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 2279 states have (on average 1.3927161035541904) internal successors, (3174), 2279 states have internal predecessors, (3174), 0 states have call successors, (0), 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 23:42:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3174 transitions. [2024-10-12 23:42:19,947 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3174 transitions. Word has length 85 [2024-10-12 23:42:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:19,948 INFO L471 AbstractCegarLoop]: Abstraction has 2280 states and 3174 transitions. [2024-10-12 23:42:19,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3174 transitions. [2024-10-12 23:42:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 23:42:19,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:19,952 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:19,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-12 23:42:19,952 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:19,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:19,953 INFO L85 PathProgramCache]: Analyzing trace with hash -769144329, now seen corresponding path program 1 times [2024-10-12 23:42:19,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:19,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377343795] [2024-10-12 23:42:19,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:19,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:20,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:20,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377343795] [2024-10-12 23:42:20,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377343795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:20,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:20,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 23:42:20,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143054211] [2024-10-12 23:42:20,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:20,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 23:42:20,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:20,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 23:42:20,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:42:20,168 INFO L87 Difference]: Start difference. First operand 2280 states and 3174 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:20,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:20,249 INFO L93 Difference]: Finished difference Result 4125 states and 5779 transitions. [2024-10-12 23:42:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 23:42:20,250 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 23:42:20,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:20,256 INFO L225 Difference]: With dead ends: 4125 [2024-10-12 23:42:20,256 INFO L226 Difference]: Without dead ends: 2218 [2024-10-12 23:42:20,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:42:20,259 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 41 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:20,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1272 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:20,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2024-10-12 23:42:20,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2214. [2024-10-12 23:42:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2213 states have (on average 1.3935833709896068) internal successors, (3084), 2213 states have internal predecessors, (3084), 0 states have call successors, (0), 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 23:42:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 3084 transitions. [2024-10-12 23:42:20,285 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 3084 transitions. Word has length 85 [2024-10-12 23:42:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:20,286 INFO L471 AbstractCegarLoop]: Abstraction has 2214 states and 3084 transitions. [2024-10-12 23:42:20,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 3084 transitions. [2024-10-12 23:42:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 23:42:20,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:20,287 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:20,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-12 23:42:20,288 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:20,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash -554686323, now seen corresponding path program 1 times [2024-10-12 23:42:20,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:20,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242476807] [2024-10-12 23:42:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:20,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:20,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242476807] [2024-10-12 23:42:20,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242476807] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:42:20,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113582323] [2024-10-12 23:42:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:20,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:42:20,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:42:20,612 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:42:20,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 23:42:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:20,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-10-12 23:42:20,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:42:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:21,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:42:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113582323] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 23:42:22,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:42:22,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [11, 26] total 54 [2024-10-12 23:42:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93398670] [2024-10-12 23:42:22,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:22,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 23:42:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:22,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 23:42:22,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2687, Unknown=0, NotChecked=0, Total=2862 [2024-10-12 23:42:22,823 INFO L87 Difference]: Start difference. First operand 2214 states and 3084 transitions. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:25,774 INFO L93 Difference]: Finished difference Result 5472 states and 7669 transitions. [2024-10-12 23:42:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-10-12 23:42:25,774 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 23:42:25,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:25,779 INFO L225 Difference]: With dead ends: 5472 [2024-10-12 23:42:25,779 INFO L226 Difference]: Without dead ends: 3746 [2024-10-12 23:42:25,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=396, Invalid=7436, Unknown=0, NotChecked=0, Total=7832 [2024-10-12 23:42:25,783 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 356 mSDsluCounter, 5525 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 5851 SdHoareTripleChecker+Invalid, 2033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:25,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 5851 Invalid, 2033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 23:42:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2024-10-12 23:42:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 2753. [2024-10-12 23:42:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2753 states, 2752 states have (on average 1.3942587209302326) internal successors, (3837), 2752 states have internal predecessors, (3837), 0 states have call successors, (0), 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 23:42:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 3837 transitions. [2024-10-12 23:42:25,834 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 3837 transitions. Word has length 85 [2024-10-12 23:42:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:25,834 INFO L471 AbstractCegarLoop]: Abstraction has 2753 states and 3837 transitions. [2024-10-12 23:42:25,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 3837 transitions. [2024-10-12 23:42:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 23:42:25,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:25,837 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:25,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 23:42:26,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:42:26,039 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:26,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:26,039 INFO L85 PathProgramCache]: Analyzing trace with hash 114921403, now seen corresponding path program 1 times [2024-10-12 23:42:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:26,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543919300] [2024-10-12 23:42:26,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:26,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:26,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:26,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543919300] [2024-10-12 23:42:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543919300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:26,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:26,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 23:42:26,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119436895] [2024-10-12 23:42:26,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:26,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:42:26,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:26,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:42:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:42:26,494 INFO L87 Difference]: Start difference. First operand 2753 states and 3837 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:26,575 INFO L93 Difference]: Finished difference Result 5759 states and 8114 transitions. [2024-10-12 23:42:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 23:42:26,575 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 23:42:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:26,581 INFO L225 Difference]: With dead ends: 5759 [2024-10-12 23:42:26,581 INFO L226 Difference]: Without dead ends: 3519 [2024-10-12 23:42:26,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:42:26,584 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 72 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:26,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1369 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3519 states. [2024-10-12 23:42:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3519 to 3409. [2024-10-12 23:42:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3409 states, 3408 states have (on average 1.4022887323943662) internal successors, (4779), 3408 states have internal predecessors, (4779), 0 states have call successors, (0), 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 23:42:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3409 states to 3409 states and 4779 transitions. [2024-10-12 23:42:26,625 INFO L78 Accepts]: Start accepts. Automaton has 3409 states and 4779 transitions. Word has length 85 [2024-10-12 23:42:26,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:26,626 INFO L471 AbstractCegarLoop]: Abstraction has 3409 states and 4779 transitions. [2024-10-12 23:42:26,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3409 states and 4779 transitions. [2024-10-12 23:42:26,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 23:42:26,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:26,628 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:26,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-12 23:42:26,629 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:26,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:26,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1954742786, now seen corresponding path program 1 times [2024-10-12 23:42:26,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:26,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325182478] [2024-10-12 23:42:26,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:26,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:26,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:26,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325182478] [2024-10-12 23:42:26,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325182478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:26,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:26,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 23:42:26,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109758865] [2024-10-12 23:42:26,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:26,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:42:26,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:26,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:42:26,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:42:26,914 INFO L87 Difference]: Start difference. First operand 3409 states and 4779 transitions. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:26,989 INFO L93 Difference]: Finished difference Result 7303 states and 10294 transitions. [2024-10-12 23:42:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:42:26,989 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 23:42:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:26,995 INFO L225 Difference]: With dead ends: 7303 [2024-10-12 23:42:26,995 INFO L226 Difference]: Without dead ends: 4225 [2024-10-12 23:42:26,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:42:26,999 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 10 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:26,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1507 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4225 states. [2024-10-12 23:42:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4225 to 4149. [2024-10-12 23:42:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4149 states, 4148 states have (on average 1.3859691417550626) internal successors, (5749), 4148 states have internal predecessors, (5749), 0 states have call successors, (0), 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 23:42:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4149 states to 4149 states and 5749 transitions. [2024-10-12 23:42:27,047 INFO L78 Accepts]: Start accepts. Automaton has 4149 states and 5749 transitions. Word has length 85 [2024-10-12 23:42:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:27,047 INFO L471 AbstractCegarLoop]: Abstraction has 4149 states and 5749 transitions. [2024-10-12 23:42:27,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4149 states and 5749 transitions. [2024-10-12 23:42:27,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 23:42:27,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:27,050 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:27,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-12 23:42:27,050 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:27,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:27,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1807668667, now seen corresponding path program 1 times [2024-10-12 23:42:27,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:27,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481227405] [2024-10-12 23:42:27,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:27,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:27,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:27,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481227405] [2024-10-12 23:42:27,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481227405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:27,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:27,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 23:42:27,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667541294] [2024-10-12 23:42:27,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:27,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 23:42:27,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:27,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 23:42:27,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:42:27,837 INFO L87 Difference]: Start difference. First operand 4149 states and 5749 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:27,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:27,981 INFO L93 Difference]: Finished difference Result 8128 states and 11437 transitions. [2024-10-12 23:42:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 23:42:27,981 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 23:42:27,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:27,989 INFO L225 Difference]: With dead ends: 8128 [2024-10-12 23:42:27,990 INFO L226 Difference]: Without dead ends: 5721 [2024-10-12 23:42:27,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:42:27,993 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 34 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:27,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1304 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:27,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2024-10-12 23:42:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 5593. [2024-10-12 23:42:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5593 states, 5592 states have (on average 1.4079041487839772) internal successors, (7873), 5592 states have internal predecessors, (7873), 0 states have call successors, (0), 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 23:42:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5593 states to 5593 states and 7873 transitions. [2024-10-12 23:42:28,055 INFO L78 Accepts]: Start accepts. Automaton has 5593 states and 7873 transitions. Word has length 85 [2024-10-12 23:42:28,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:28,055 INFO L471 AbstractCegarLoop]: Abstraction has 5593 states and 7873 transitions. [2024-10-12 23:42:28,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 5593 states and 7873 transitions. [2024-10-12 23:42:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 23:42:28,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:28,058 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:28,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-12 23:42:28,058 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:28,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:28,058 INFO L85 PathProgramCache]: Analyzing trace with hash 644681463, now seen corresponding path program 1 times [2024-10-12 23:42:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863405567] [2024-10-12 23:42:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:28,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:28,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:28,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:28,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863405567] [2024-10-12 23:42:28,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863405567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:28,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:28,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-12 23:42:28,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766986147] [2024-10-12 23:42:28,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:28,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-12 23:42:28,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:28,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 23:42:28,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-10-12 23:42:28,780 INFO L87 Difference]: Start difference. First operand 5593 states and 7873 transitions. Second operand has 20 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:29,160 INFO L93 Difference]: Finished difference Result 9959 states and 14076 transitions. [2024-10-12 23:42:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 23:42:29,161 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 23:42:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:29,170 INFO L225 Difference]: With dead ends: 9959 [2024-10-12 23:42:29,170 INFO L226 Difference]: Without dead ends: 5691 [2024-10-12 23:42:29,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2024-10-12 23:42:29,175 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 107 mSDsluCounter, 2781 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 2962 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:29,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 2962 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 23:42:29,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5691 states. [2024-10-12 23:42:29,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5691 to 5665. [2024-10-12 23:42:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5665 states, 5664 states have (on average 1.40625) internal successors, (7965), 5664 states have internal predecessors, (7965), 0 states have call successors, (0), 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 23:42:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 7965 transitions. [2024-10-12 23:42:29,237 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 7965 transitions. Word has length 85 [2024-10-12 23:42:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:29,237 INFO L471 AbstractCegarLoop]: Abstraction has 5665 states and 7965 transitions. [2024-10-12 23:42:29,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.25) internal successors, (85), 19 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 7965 transitions. [2024-10-12 23:42:29,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 23:42:29,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:29,240 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:29,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-12 23:42:29,241 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:29,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:29,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1789282678, now seen corresponding path program 1 times [2024-10-12 23:42:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:29,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80680319] [2024-10-12 23:42:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:29,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:29,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80680319] [2024-10-12 23:42:29,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80680319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:29,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:29,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 23:42:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388951526] [2024-10-12 23:42:29,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:29,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 23:42:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 23:42:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:42:29,476 INFO L87 Difference]: Start difference. First operand 5665 states and 7965 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:29,599 INFO L93 Difference]: Finished difference Result 8514 states and 11979 transitions. [2024-10-12 23:42:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 23:42:29,600 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-12 23:42:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:29,607 INFO L225 Difference]: With dead ends: 8514 [2024-10-12 23:42:29,607 INFO L226 Difference]: Without dead ends: 5680 [2024-10-12 23:42:29,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-12 23:42:29,612 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 165 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:29,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 1290 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5680 states. [2024-10-12 23:42:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5680 to 5680. [2024-10-12 23:42:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5680 states, 5679 states have (on average 1.4058813171332982) internal successors, (7984), 5679 states have internal predecessors, (7984), 0 states have call successors, (0), 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 23:42:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 7984 transitions. [2024-10-12 23:42:29,673 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 7984 transitions. Word has length 85 [2024-10-12 23:42:29,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:29,673 INFO L471 AbstractCegarLoop]: Abstraction has 5680 states and 7984 transitions. [2024-10-12 23:42:29,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 23:42:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 7984 transitions. [2024-10-12 23:42:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 23:42:29,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:29,675 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:29,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 23:42:29,676 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:29,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1813382841, now seen corresponding path program 1 times [2024-10-12 23:42:29,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:29,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65732911] [2024-10-12 23:42:29,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:29,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:30,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:30,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65732911] [2024-10-12 23:42:30,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65732911] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:42:30,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850884925] [2024-10-12 23:42:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:30,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:42:30,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:42:30,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:42:30,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 23:42:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:30,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 127 conjuncts are in the unsatisfiable core [2024-10-12 23:42:30,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:42:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:31,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:42:31,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850884925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:31,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 23:42:31,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [12] total 40 [2024-10-12 23:42:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872054164] [2024-10-12 23:42:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:31,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-12 23:42:31,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:31,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-12 23:42:31,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1535, Unknown=0, NotChecked=0, Total=1640 [2024-10-12 23:42:31,646 INFO L87 Difference]: Start difference. First operand 5680 states and 7984 transitions. Second operand has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:32,182 INFO L93 Difference]: Finished difference Result 9978 states and 14097 transitions. [2024-10-12 23:42:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 23:42:32,182 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-12 23:42:32,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:32,190 INFO L225 Difference]: With dead ends: 9978 [2024-10-12 23:42:32,190 INFO L226 Difference]: Without dead ends: 5710 [2024-10-12 23:42:32,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=1612, Unknown=0, NotChecked=0, Total=1722 [2024-10-12 23:42:32,195 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 60 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3411 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:32,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3411 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 23:42:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2024-10-12 23:42:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 5690. [2024-10-12 23:42:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5690 states, 5689 states have (on average 1.4062225347161188) internal successors, (8000), 5689 states have internal predecessors, (8000), 0 states have call successors, (0), 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 23:42:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 8000 transitions. [2024-10-12 23:42:32,255 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 8000 transitions. Word has length 86 [2024-10-12 23:42:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:32,255 INFO L471 AbstractCegarLoop]: Abstraction has 5690 states and 8000 transitions. [2024-10-12 23:42:32,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 29 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 8000 transitions. [2024-10-12 23:42:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 23:42:32,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:32,257 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:32,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-12 23:42:32,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:42:32,459 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:32,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:32,459 INFO L85 PathProgramCache]: Analyzing trace with hash 151033572, now seen corresponding path program 1 times [2024-10-12 23:42:32,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:32,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490384108] [2024-10-12 23:42:32,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:32,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:32,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:32,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490384108] [2024-10-12 23:42:32,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490384108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:32,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:32,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 23:42:32,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707662666] [2024-10-12 23:42:32,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:32,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 23:42:32,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:32,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 23:42:32,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-10-12 23:42:32,989 INFO L87 Difference]: Start difference. First operand 5690 states and 8000 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:33,220 INFO L93 Difference]: Finished difference Result 10561 states and 14938 transitions. [2024-10-12 23:42:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 23:42:33,224 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-12 23:42:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:33,231 INFO L225 Difference]: With dead ends: 10561 [2024-10-12 23:42:33,232 INFO L226 Difference]: Without dead ends: 5694 [2024-10-12 23:42:33,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-12 23:42:33,237 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 156 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:33,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1745 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5694 states. [2024-10-12 23:42:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5694 to 5694. [2024-10-12 23:42:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5694 states, 5693 states have (on average 1.4045318812576848) internal successors, (7996), 5693 states have internal predecessors, (7996), 0 states have call successors, (0), 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 23:42:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 7996 transitions. [2024-10-12 23:42:33,294 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 7996 transitions. Word has length 86 [2024-10-12 23:42:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:33,294 INFO L471 AbstractCegarLoop]: Abstraction has 5694 states and 7996 transitions. [2024-10-12 23:42:33,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 12 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 7996 transitions. [2024-10-12 23:42:33,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 23:42:33,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:33,298 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:33,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-12 23:42:33,298 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:33,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:33,299 INFO L85 PathProgramCache]: Analyzing trace with hash -393884302, now seen corresponding path program 1 times [2024-10-12 23:42:33,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:33,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084028188] [2024-10-12 23:42:33,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:33,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:33,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:33,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084028188] [2024-10-12 23:42:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084028188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:33,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:33,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:42:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788578257] [2024-10-12 23:42:33,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:33,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:42:33,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:33,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:42:33,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:42:33,420 INFO L87 Difference]: Start difference. First operand 5694 states and 7996 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:33,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:33,471 INFO L93 Difference]: Finished difference Result 10804 states and 15229 transitions. [2024-10-12 23:42:33,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:42:33,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-12 23:42:33,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:33,507 INFO L225 Difference]: With dead ends: 10804 [2024-10-12 23:42:33,507 INFO L226 Difference]: Without dead ends: 5584 [2024-10-12 23:42:33,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:42:33,510 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 51 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:33,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 652 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:42:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5584 states. [2024-10-12 23:42:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5584 to 5584. [2024-10-12 23:42:33,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5584 states, 5583 states have (on average 1.3967401038867993) internal successors, (7798), 5583 states have internal predecessors, (7798), 0 states have call successors, (0), 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 23:42:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5584 states to 5584 states and 7798 transitions. [2024-10-12 23:42:33,557 INFO L78 Accepts]: Start accepts. Automaton has 5584 states and 7798 transitions. Word has length 86 [2024-10-12 23:42:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:33,557 INFO L471 AbstractCegarLoop]: Abstraction has 5584 states and 7798 transitions. [2024-10-12 23:42:33,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5584 states and 7798 transitions. [2024-10-12 23:42:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 23:42:33,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:33,559 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:33,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-12 23:42:33,559 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:33,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1458839651, now seen corresponding path program 1 times [2024-10-12 23:42:33,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:33,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756919389] [2024-10-12 23:42:33,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:33,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:34,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:34,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756919389] [2024-10-12 23:42:34,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756919389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:34,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:34,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-12 23:42:34,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833800253] [2024-10-12 23:42:34,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:34,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-12 23:42:34,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:34,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-12 23:42:34,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-12 23:42:34,264 INFO L87 Difference]: Start difference. First operand 5584 states and 7798 transitions. Second operand has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 16 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:34,528 INFO L93 Difference]: Finished difference Result 9133 states and 12828 transitions. [2024-10-12 23:42:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 23:42:34,529 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 16 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-12 23:42:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:34,536 INFO L225 Difference]: With dead ends: 9133 [2024-10-12 23:42:34,536 INFO L226 Difference]: Without dead ends: 5618 [2024-10-12 23:42:34,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2024-10-12 23:42:34,541 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 67 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:34,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 2197 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:42:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5618 states. [2024-10-12 23:42:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5618 to 5522. [2024-10-12 23:42:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5522 states, 5521 states have (on average 1.39865966310451) internal successors, (7722), 5521 states have internal predecessors, (7722), 0 states have call successors, (0), 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 23:42:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 7722 transitions. [2024-10-12 23:42:34,597 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 7722 transitions. Word has length 86 [2024-10-12 23:42:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:34,597 INFO L471 AbstractCegarLoop]: Abstraction has 5522 states and 7722 transitions. [2024-10-12 23:42:34,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 16 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 7722 transitions. [2024-10-12 23:42:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 23:42:34,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:34,600 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:34,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-12 23:42:34,600 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:34,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:34,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1871545855, now seen corresponding path program 1 times [2024-10-12 23:42:34,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:34,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726252710] [2024-10-12 23:42:34,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:34,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:35,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:35,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726252710] [2024-10-12 23:42:35,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726252710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:42:35,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048614810] [2024-10-12 23:42:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:35,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:42:35,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:42:35,269 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:42:35,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 23:42:35,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:35,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-10-12 23:42:35,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:42:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:36,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:42:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:38,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048614810] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:42:38,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:42:38,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28, 26] total 72 [2024-10-12 23:42:38,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383104757] [2024-10-12 23:42:38,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:42:38,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-10-12 23:42:38,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:38,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-10-12 23:42:38,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=4638, Unknown=0, NotChecked=0, Total=5256 [2024-10-12 23:42:38,568 INFO L87 Difference]: Start difference. First operand 5522 states and 7722 transitions. Second operand has 73 states, 73 states have (on average 3.3698630136986303) internal successors, (246), 72 states have internal predecessors, (246), 0 states have call successors, (0), 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 23:42:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:44,384 INFO L93 Difference]: Finished difference Result 15780 states and 22221 transitions. [2024-10-12 23:42:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-10-12 23:42:44,384 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 3.3698630136986303) internal successors, (246), 72 states have internal predecessors, (246), 0 states have call successors, (0), 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 86 [2024-10-12 23:42:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:44,396 INFO L225 Difference]: With dead ends: 15780 [2024-10-12 23:42:44,396 INFO L226 Difference]: Without dead ends: 11461 [2024-10-12 23:42:44,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9123 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3199, Invalid=31211, Unknown=0, NotChecked=0, Total=34410 [2024-10-12 23:42:44,404 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 2627 mSDsluCounter, 8624 mSDsCounter, 0 mSdLazyCounter, 4138 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2627 SdHoareTripleChecker+Valid, 8889 SdHoareTripleChecker+Invalid, 4193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:44,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2627 Valid, 8889 Invalid, 4193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4138 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 23:42:44,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11461 states. [2024-10-12 23:42:44,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11461 to 7157. [2024-10-12 23:42:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7157 states, 7156 states have (on average 1.3993851313583008) internal successors, (10014), 7156 states have internal predecessors, (10014), 0 states have call successors, (0), 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 23:42:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7157 states to 7157 states and 10014 transitions. [2024-10-12 23:42:44,506 INFO L78 Accepts]: Start accepts. Automaton has 7157 states and 10014 transitions. Word has length 86 [2024-10-12 23:42:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:44,506 INFO L471 AbstractCegarLoop]: Abstraction has 7157 states and 10014 transitions. [2024-10-12 23:42:44,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.3698630136986303) internal successors, (246), 72 states have internal predecessors, (246), 0 states have call successors, (0), 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 23:42:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 7157 states and 10014 transitions. [2024-10-12 23:42:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 23:42:44,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:44,508 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:44,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-12 23:42:44,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2024-10-12 23:42:44,709 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:44,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:44,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1824345017, now seen corresponding path program 1 times [2024-10-12 23:42:44,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:44,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411794060] [2024-10-12 23:42:44,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:44,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:44,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:44,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411794060] [2024-10-12 23:42:44,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411794060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:44,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:44,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:42:44,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932824564] [2024-10-12 23:42:44,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:44,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:42:44,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:44,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:42:44,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:42:44,825 INFO L87 Difference]: Start difference. First operand 7157 states and 10014 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:44,883 INFO L93 Difference]: Finished difference Result 14249 states and 19941 transitions. [2024-10-12 23:42:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:42:44,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-12 23:42:44,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:44,891 INFO L225 Difference]: With dead ends: 14249 [2024-10-12 23:42:44,892 INFO L226 Difference]: Without dead ends: 7139 [2024-10-12 23:42:44,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:42:44,899 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 51 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:44,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 652 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:42:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7139 states. [2024-10-12 23:42:44,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7139 to 7139. [2024-10-12 23:42:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7139 states, 7138 states have (on average 1.3989913140935837) internal successors, (9986), 7138 states have internal predecessors, (9986), 0 states have call successors, (0), 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 23:42:44,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7139 states to 7139 states and 9986 transitions. [2024-10-12 23:42:44,978 INFO L78 Accepts]: Start accepts. Automaton has 7139 states and 9986 transitions. Word has length 86 [2024-10-12 23:42:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:44,978 INFO L471 AbstractCegarLoop]: Abstraction has 7139 states and 9986 transitions. [2024-10-12 23:42:44,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 7139 states and 9986 transitions. [2024-10-12 23:42:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 23:42:44,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:44,980 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:44,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-12 23:42:44,980 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:44,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1995978519, now seen corresponding path program 1 times [2024-10-12 23:42:44,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:44,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432178030] [2024-10-12 23:42:44,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:44,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:45,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:45,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432178030] [2024-10-12 23:42:45,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432178030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:45,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:45,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-12 23:42:45,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431449417] [2024-10-12 23:42:45,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:45,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 23:42:45,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:45,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 23:42:45,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:42:45,599 INFO L87 Difference]: Start difference. First operand 7139 states and 9986 transitions. Second operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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 23:42:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:45,882 INFO L93 Difference]: Finished difference Result 13019 states and 18328 transitions. [2024-10-12 23:42:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 23:42:45,882 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 23:42:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:45,889 INFO L225 Difference]: With dead ends: 13019 [2024-10-12 23:42:45,890 INFO L226 Difference]: Without dead ends: 7115 [2024-10-12 23:42:45,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2024-10-12 23:42:45,895 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 130 mSDsluCounter, 1425 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:45,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1582 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:45,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states. [2024-10-12 23:42:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 7115. [2024-10-12 23:42:45,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7115 states, 7114 states have (on average 1.3989316840033736) internal successors, (9952), 7114 states have internal predecessors, (9952), 0 states have call successors, (0), 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 23:42:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7115 states to 7115 states and 9952 transitions. [2024-10-12 23:42:45,976 INFO L78 Accepts]: Start accepts. Automaton has 7115 states and 9952 transitions. Word has length 87 [2024-10-12 23:42:45,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:45,976 INFO L471 AbstractCegarLoop]: Abstraction has 7115 states and 9952 transitions. [2024-10-12 23:42:45,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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 23:42:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 7115 states and 9952 transitions. [2024-10-12 23:42:45,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 23:42:45,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:45,978 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:45,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-12 23:42:45,978 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:45,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:45,979 INFO L85 PathProgramCache]: Analyzing trace with hash -903545569, now seen corresponding path program 1 times [2024-10-12 23:42:45,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:45,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623131912] [2024-10-12 23:42:45,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:46,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:46,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:46,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623131912] [2024-10-12 23:42:46,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623131912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:46,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:46,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 23:42:46,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043620646] [2024-10-12 23:42:46,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:46,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 23:42:46,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:46,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 23:42:46,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-12 23:42:46,379 INFO L87 Difference]: Start difference. First operand 7115 states and 9952 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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 23:42:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:46,579 INFO L93 Difference]: Finished difference Result 13594 states and 19151 transitions. [2024-10-12 23:42:46,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 23:42:46,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 23:42:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:46,587 INFO L225 Difference]: With dead ends: 13594 [2024-10-12 23:42:46,588 INFO L226 Difference]: Without dead ends: 7139 [2024-10-12 23:42:46,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:42:46,594 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 54 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:46,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1759 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7139 states. [2024-10-12 23:42:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7139 to 7135. [2024-10-12 23:42:46,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7135 states, 7134 states have (on average 1.3966918979534624) internal successors, (9964), 7134 states have internal predecessors, (9964), 0 states have call successors, (0), 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 23:42:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7135 states to 7135 states and 9964 transitions. [2024-10-12 23:42:46,681 INFO L78 Accepts]: Start accepts. Automaton has 7135 states and 9964 transitions. Word has length 87 [2024-10-12 23:42:46,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:46,681 INFO L471 AbstractCegarLoop]: Abstraction has 7135 states and 9964 transitions. [2024-10-12 23:42:46,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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 23:42:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7135 states and 9964 transitions. [2024-10-12 23:42:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 23:42:46,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:46,683 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:46,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-12 23:42:46,684 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:46,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:46,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2107915820, now seen corresponding path program 1 times [2024-10-12 23:42:46,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003283317] [2024-10-12 23:42:46,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:46,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:47,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:47,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003283317] [2024-10-12 23:42:47,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003283317] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:47,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:47,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-12 23:42:47,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699993797] [2024-10-12 23:42:47,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:47,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 23:42:47,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:47,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 23:42:47,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-12 23:42:47,154 INFO L87 Difference]: Start difference. First operand 7135 states and 9964 transitions. Second operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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 23:42:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:47,346 INFO L93 Difference]: Finished difference Result 13564 states and 19102 transitions. [2024-10-12 23:42:47,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 23:42:47,347 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 23:42:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:47,354 INFO L225 Difference]: With dead ends: 13564 [2024-10-12 23:42:47,354 INFO L226 Difference]: Without dead ends: 7169 [2024-10-12 23:42:47,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-12 23:42:47,359 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 35 mSDsluCounter, 1777 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:47,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1946 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7169 states. [2024-10-12 23:42:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7169 to 7135. [2024-10-12 23:42:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7135 states, 7134 states have (on average 1.3961312026913373) internal successors, (9960), 7134 states have internal predecessors, (9960), 0 states have call successors, (0), 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 23:42:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7135 states to 7135 states and 9960 transitions. [2024-10-12 23:42:47,435 INFO L78 Accepts]: Start accepts. Automaton has 7135 states and 9960 transitions. Word has length 87 [2024-10-12 23:42:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:47,436 INFO L471 AbstractCegarLoop]: Abstraction has 7135 states and 9960 transitions. [2024-10-12 23:42:47,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 14 states have internal predecessors, (87), 0 states have call successors, (0), 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 23:42:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 7135 states and 9960 transitions. [2024-10-12 23:42:47,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 23:42:47,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:47,437 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:47,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-12 23:42:47,438 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:47,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash 930824, now seen corresponding path program 1 times [2024-10-12 23:42:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:47,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348458545] [2024-10-12 23:42:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:47,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348458545] [2024-10-12 23:42:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348458545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:47,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:47,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 23:42:47,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101225576] [2024-10-12 23:42:47,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:47,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 23:42:47,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:47,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 23:42:47,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-12 23:42:47,839 INFO L87 Difference]: Start difference. First operand 7135 states and 9960 transitions. Second operand has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 23:42:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:47,993 INFO L93 Difference]: Finished difference Result 13887 states and 19519 transitions. [2024-10-12 23:42:47,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 23:42:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 23:42:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:48,003 INFO L225 Difference]: With dead ends: 13887 [2024-10-12 23:42:48,003 INFO L226 Difference]: Without dead ends: 9166 [2024-10-12 23:42:48,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-12 23:42:48,008 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 73 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:48,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1586 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:42:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9166 states. [2024-10-12 23:42:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9166 to 7851. [2024-10-12 23:42:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7851 states, 7850 states have (on average 1.397452229299363) internal successors, (10970), 7850 states have internal predecessors, (10970), 0 states have call successors, (0), 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 23:42:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7851 states to 7851 states and 10970 transitions. [2024-10-12 23:42:48,099 INFO L78 Accepts]: Start accepts. Automaton has 7851 states and 10970 transitions. Word has length 87 [2024-10-12 23:42:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:48,099 INFO L471 AbstractCegarLoop]: Abstraction has 7851 states and 10970 transitions. [2024-10-12 23:42:48,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.6923076923076925) internal successors, (87), 13 states have internal predecessors, (87), 0 states have call successors, (0), 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 23:42:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 7851 states and 10970 transitions. [2024-10-12 23:42:48,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 23:42:48,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:48,101 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:48,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-12 23:42:48,101 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:48,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1599836787, now seen corresponding path program 1 times [2024-10-12 23:42:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:48,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249000779] [2024-10-12 23:42:48,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:48,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:48,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:48,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249000779] [2024-10-12 23:42:48,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249000779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:48,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:48,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:42:48,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771494996] [2024-10-12 23:42:48,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:48,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:42:48,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:48,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:42:48,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:42:48,414 INFO L87 Difference]: Start difference. First operand 7851 states and 10970 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 23:42:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:48,499 INFO L93 Difference]: Finished difference Result 15669 states and 21897 transitions. [2024-10-12 23:42:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:42:48,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-12 23:42:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:48,507 INFO L225 Difference]: With dead ends: 15669 [2024-10-12 23:42:48,507 INFO L226 Difference]: Without dead ends: 7853 [2024-10-12 23:42:48,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:42:48,513 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 110 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:48,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 860 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:42:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7853 states. [2024-10-12 23:42:48,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7853 to 7853. [2024-10-12 23:42:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7853 states, 7852 states have (on average 1.3973509933774835) internal successors, (10972), 7852 states have internal predecessors, (10972), 0 states have call successors, (0), 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 23:42:48,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7853 states to 7853 states and 10972 transitions. [2024-10-12 23:42:48,597 INFO L78 Accepts]: Start accepts. Automaton has 7853 states and 10972 transitions. Word has length 87 [2024-10-12 23:42:48,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:48,597 INFO L471 AbstractCegarLoop]: Abstraction has 7853 states and 10972 transitions. [2024-10-12 23:42:48,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 23:42:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 7853 states and 10972 transitions. [2024-10-12 23:42:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 23:42:48,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:48,599 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:42:48,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-12 23:42:48,599 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:48,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash -320128363, now seen corresponding path program 1 times [2024-10-12 23:42:48,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:48,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765076891] [2024-10-12 23:42:48,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:48,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:48,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:42:48,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765076891] [2024-10-12 23:42:48,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765076891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:48,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:48,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:42:48,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992966815] [2024-10-12 23:42:48,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:48,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:42:48,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:42:48,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:42:48,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:42:48,848 INFO L87 Difference]: Start difference. First operand 7853 states and 10972 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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 23:42:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:48,917 INFO L93 Difference]: Finished difference Result 15070 states and 21206 transitions. [2024-10-12 23:42:48,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:42:48,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-12 23:42:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:48,926 INFO L225 Difference]: With dead ends: 15070 [2024-10-12 23:42:48,926 INFO L226 Difference]: Without dead ends: 7633 [2024-10-12 23:42:48,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:42:48,932 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 77 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:48,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 861 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:42:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7633 states. [2024-10-12 23:42:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7633 to 7633. [2024-10-12 23:42:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7633 states, 7632 states have (on average 1.4008123689727463) internal successors, (10691), 7632 states have internal predecessors, (10691), 0 states have call successors, (0), 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 23:42:49,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7633 states to 7633 states and 10691 transitions. [2024-10-12 23:42:49,015 INFO L78 Accepts]: Start accepts. Automaton has 7633 states and 10691 transitions. Word has length 88 [2024-10-12 23:42:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:49,016 INFO L471 AbstractCegarLoop]: Abstraction has 7633 states and 10691 transitions. [2024-10-12 23:42:49,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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 23:42:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 7633 states and 10691 transitions. [2024-10-12 23:42:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 23:42:49,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:49,017 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:42:49,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-12 23:42:49,017 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:49,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1001635075, now seen corresponding path program 1 times [2024-10-12 23:42:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:42:49,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38060775] [2024-10-12 23:42:49,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:49,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:42:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:42:49,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:42:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:42:49,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:42:49,227 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:42:49,227 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:42:49,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-12 23:42:49,231 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-12 23:42:49,283 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:42:49,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:42:49 BoogieIcfgContainer [2024-10-12 23:42:49,285 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:42:49,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:42:49,285 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:42:49,285 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:42:49,286 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:41:45" (3/4) ... [2024-10-12 23:42:49,287 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:42:49,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:42:49,288 INFO L158 Benchmark]: Toolchain (without parser) took 65419.02ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 143.9MB in the beginning and 533.3MB in the end (delta: -389.4MB). Peak memory consumption was 850.2MB. Max. memory is 16.1GB. [2024-10-12 23:42:49,288 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 104.9MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:42:49,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.09ms. Allocated memory is still 174.1MB. Free memory was 143.9MB in the beginning and 125.2MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 23:42:49,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.73ms. Allocated memory is still 174.1MB. Free memory was 125.2MB in the beginning and 114.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 23:42:49,289 INFO L158 Benchmark]: Boogie Preprocessor took 102.18ms. Allocated memory is still 174.1MB. Free memory was 114.7MB in the beginning and 108.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 23:42:49,289 INFO L158 Benchmark]: RCFGBuilder took 819.71ms. Allocated memory is still 174.1MB. Free memory was 107.4MB in the beginning and 86.2MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-12 23:42:49,289 INFO L158 Benchmark]: TraceAbstraction took 64065.31ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 86.2MB in the beginning and 533.3MB in the end (delta: -447.1MB). Peak memory consumption was 794.4MB. Max. memory is 16.1GB. [2024-10-12 23:42:49,289 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 1.4GB. Free memory is still 533.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:42:49,289 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 104.9MB. Free memory is still 76.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.09ms. Allocated memory is still 174.1MB. Free memory was 143.9MB in the beginning and 125.2MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.73ms. Allocated memory is still 174.1MB. Free memory was 125.2MB in the beginning and 114.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.18ms. Allocated memory is still 174.1MB. Free memory was 114.7MB in the beginning and 108.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 819.71ms. Allocated memory is still 174.1MB. Free memory was 107.4MB in the beginning and 86.2MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 64065.31ms. Allocated memory was 174.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 86.2MB in the beginning and 533.3MB in the end (delta: -447.1MB). Peak memory consumption was 794.4MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 1.4GB. Free memory is still 533.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 173, overapproximation of bitwiseAnd at line 113. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_30 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_34; [L49] SORT_12 input_36; [L50] SORT_3 input_38; [L51] SORT_12 input_100; [L52] SORT_3 input_102; [L53] SORT_1 input_105; [L54] SORT_3 input_107; [L55] SORT_3 input_109; [L56] SORT_3 input_111; [L57] SORT_3 input_113; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_34 = __VERIFIER_nondet_uchar() [L85] input_36 = __VERIFIER_nondet_uchar() [L86] input_38 = __VERIFIER_nondet_uchar() [L87] input_100 = __VERIFIER_nondet_uchar() [L88] input_102 = __VERIFIER_nondet_uchar() [L89] input_105 = __VERIFIER_nondet_uchar() [L90] input_107 = __VERIFIER_nondet_uchar() [L91] input_109 = __VERIFIER_nondet_uchar() [L92] input_111 = __VERIFIER_nondet_uchar() [L93] input_113 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_19_arg_0=0, var_19_arg_1=0, var_30=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_22_arg_0=0, var_22_arg_1=0, var_30=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = state_24; [L105] SORT_3 var_26 = ~var_26_arg_0; [L106] SORT_3 var_27_arg_0 = var_23; [L107] SORT_3 var_27_arg_1 = var_26; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_27_arg_0=-1, var_27_arg_1=-1, var_30=1] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L108] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_3 var_31_arg_0 = var_27; [L110] SORT_3 var_31 = ~var_31_arg_0; [L111] SORT_3 var_32_arg_0 = var_30; [L112] SORT_3 var_32_arg_1 = var_31; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_32_arg_0=1, var_32_arg_1=-256] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L113] SORT_3 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L114] var_32 = var_32 & mask_SORT_3 [L115] SORT_3 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND FALSE !(!(cond)) [L116] RET __VERIFIER_assert(!(bad_33_arg_0)) [L118] SORT_3 var_40_arg_0 = state_17; [L119] SORT_3 var_40 = ~var_40_arg_0; [L120] SORT_3 var_41_arg_0 = state_15; [L121] SORT_3 var_41 = ~var_41_arg_0; [L122] SORT_3 var_42_arg_0 = var_41; [L123] SORT_3 var_42_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_42_arg_0=-1, var_42_arg_1=0] [L124] EXPR var_42_arg_0 & var_42_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1] [L124] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L125] SORT_3 var_43_arg_0 = var_42; [L126] SORT_3 var_43 = ~var_43_arg_0; [L127] SORT_3 var_44_arg_0 = var_40; [L128] SORT_3 var_44_arg_1 = var_43; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_44_arg_0=-1, var_44_arg_1=-1] [L129] EXPR var_44_arg_0 | var_44_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1] [L129] SORT_3 var_44 = var_44_arg_0 | var_44_arg_1; [L130] SORT_3 var_45_arg_0 = var_44; [L131] SORT_3 var_45 = ~var_45_arg_0; [L132] SORT_3 var_46_arg_0 = state_17; [L133] SORT_3 var_46_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_45=-256, var_46_arg_0=0, var_46_arg_1=0] [L134] EXPR var_46_arg_0 & var_46_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_45=-256] [L134] SORT_3 var_46 = var_46_arg_0 & var_46_arg_1; [L135] SORT_3 var_47_arg_0 = var_41; [L136] SORT_3 var_47_arg_1 = var_46; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_45=-256, var_47_arg_0=-1, var_47_arg_1=0] [L137] EXPR var_47_arg_0 | var_47_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_45=-256] [L137] SORT_3 var_47 = var_47_arg_0 | var_47_arg_1; [L138] SORT_3 var_48_arg_0 = var_47; [L139] SORT_3 var_48 = ~var_48_arg_0; [L140] SORT_3 var_49_arg_0 = var_45; [L141] SORT_3 var_49_arg_1 = var_48; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_49_arg_0=-256, var_49_arg_1=-256] [L142] EXPR var_49_arg_0 | var_49_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1] [L142] SORT_3 var_49 = var_49_arg_0 | var_49_arg_1; [L143] SORT_3 next_115_arg_1 = var_49; [L144] SORT_3 var_51_arg_0 = state_20; [L145] SORT_3 var_51 = ~var_51_arg_0; [L146] SORT_3 var_52_arg_0 = state_17; [L147] SORT_3 var_52_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52_arg_0=0, var_52_arg_1=-1] [L148] EXPR var_52_arg_0 | var_52_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1] [L148] SORT_3 var_52 = var_52_arg_0 | var_52_arg_1; [L149] SORT_3 var_53_arg_0 = state_17; [L150] SORT_3 var_53_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52=255, var_53_arg_0=0, var_53_arg_1=-1] [L151] EXPR var_53_arg_0 & var_53_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52=255] [L151] SORT_3 var_53 = var_53_arg_0 & var_53_arg_1; [L152] SORT_3 var_54_arg_0 = var_53; [L153] SORT_3 var_54 = ~var_54_arg_0; [L154] SORT_3 var_55_arg_0 = var_52; [L155] SORT_3 var_55_arg_1 = var_54; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_55_arg_0=255, var_55_arg_1=-1] [L156] EXPR var_55_arg_0 & var_55_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1] [L156] SORT_3 var_55 = var_55_arg_0 & var_55_arg_1; [L157] SORT_3 var_56_arg_0 = var_55; [L158] SORT_3 var_56 = ~var_56_arg_0; [L159] SORT_3 next_116_arg_1 = var_56; [L160] SORT_1 var_58_arg_0 = input_2; [L161] SORT_3 var_58 = var_58_arg_0 >> 0; [L162] SORT_1 var_59_arg_0 = input_2; [L163] SORT_3 var_59 = var_59_arg_0 >> 2; [L164] SORT_3 var_60_arg_0 = var_59; [L165] SORT_3 var_60 = ~var_60_arg_0; [L166] SORT_1 var_61_arg_0 = input_2; [L167] SORT_3 var_61 = var_61_arg_0 >> 1; [L168] SORT_3 var_62_arg_0 = var_60; [L169] SORT_3 var_62_arg_1 = var_61; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62_arg_0=-1, var_62_arg_1=0] [L170] EXPR var_62_arg_0 | var_62_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1] [L170] SORT_3 var_62 = var_62_arg_0 | var_62_arg_1; [L171] SORT_3 var_63_arg_0 = var_58; [L172] SORT_3 var_63_arg_1 = var_62; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_63_arg_0=1, var_63_arg_1=255] [L173] EXPR var_63_arg_0 | var_63_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255] [L173] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L174] SORT_3 var_64_arg_0 = var_63; [L175] SORT_3 var_64 = ~var_64_arg_0; [L176] SORT_3 var_65_arg_0 = state_15; [L177] SORT_3 var_65_arg_1 = state_17; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_64=-1, var_65_arg_0=0, var_65_arg_1=0] [L178] EXPR var_65_arg_0 | var_65_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_64=-1] [L178] SORT_3 var_65 = var_65_arg_0 | var_65_arg_1; [L179] SORT_3 var_66_arg_0 = var_64; [L180] SORT_3 var_66_arg_1 = var_65; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_65=0, var_66_arg_0=-1, var_66_arg_1=0] [L181] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_65=0] [L181] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L182] SORT_3 var_67_arg_0 = var_66; [L183] SORT_3 var_67_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0, var_67_arg_0=255, var_67_arg_1=-1] [L184] EXPR var_67_arg_0 & var_67_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0] [L184] SORT_3 var_67 = var_67_arg_0 & var_67_arg_1; [L185] SORT_3 next_117_arg_1 = var_67; [L186] SORT_3 var_69_arg_0 = state_15; [L187] SORT_3 var_69_arg_1 = state_20; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0, var_69_arg_0=0, var_69_arg_1=0] [L188] EXPR var_69_arg_0 & var_69_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0] [L188] SORT_3 var_69 = var_69_arg_0 & var_69_arg_1; [L189] SORT_3 var_70_arg_0 = var_69; [L190] SORT_3 var_70 = ~var_70_arg_0; [L191] SORT_3 var_71_arg_0 = var_40; [L192] SORT_3 var_71_arg_1 = var_70; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_58=1, var_62=255, var_65=0, var_71_arg_0=-1, var_71_arg_1=-1] [L193] EXPR var_71_arg_0 | var_71_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_58=1, var_62=255, var_65=0] [L193] SORT_3 var_71 = var_71_arg_0 | var_71_arg_1; [L194] SORT_3 var_72_arg_0 = var_71; [L195] SORT_3 var_72 = ~var_72_arg_0; [L196] SORT_3 var_73_arg_0 = state_20; [L197] SORT_3 var_73_arg_1 = var_65; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_58=1, var_62=255, var_72=-256, var_73_arg_0=0, var_73_arg_1=0] [L198] EXPR var_73_arg_0 | var_73_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_58=1, var_62=255, var_72=-256] [L198] SORT_3 var_73 = var_73_arg_0 | var_73_arg_1; [L199] SORT_3 var_74_arg_0 = var_73; [L200] SORT_3 var_74 = ~var_74_arg_0; [L201] SORT_3 var_75_arg_0 = var_58; [L202] SORT_3 var_75_arg_1 = var_74; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_72=-256, var_74=-1, var_75_arg_0=1, var_75_arg_1=-1] [L203] EXPR var_75_arg_0 & var_75_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_72=-256, var_74=-1] [L203] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L204] SORT_3 var_76_arg_0 = var_75; [L205] SORT_3 var_76 = ~var_76_arg_0; [L206] SORT_3 var_77_arg_0 = var_76; [L207] SORT_3 var_77 = ~var_77_arg_0; [L208] SORT_3 var_78_arg_0 = var_72; [L209] SORT_3 var_78_arg_1 = var_77; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_74=-1, var_78_arg_0=-256, var_78_arg_1=-256] [L210] EXPR var_78_arg_0 | var_78_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_74=-1] [L210] SORT_3 var_78 = var_78_arg_0 | var_78_arg_1; [L211] SORT_3 var_79_arg_0 = var_62; [L212] SORT_3 var_79_arg_1 = var_74; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_78=0, var_79_arg_0=255, var_79_arg_1=-1] [L213] EXPR var_79_arg_0 & var_79_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_78=0] [L213] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L214] SORT_3 var_80_arg_0 = var_78; [L215] SORT_3 var_80_arg_1 = var_79; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_80_arg_0=0, var_80_arg_1=255] [L216] EXPR var_80_arg_0 | var_80_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1] [L216] SORT_3 var_80 = var_80_arg_0 | var_80_arg_1; [L217] SORT_3 next_118_arg_1 = var_80; [L219] state_15 = next_115_arg_1 [L220] state_17 = next_116_arg_1 [L221] state_20 = next_117_arg_1 [L222] state_24 = next_118_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_34 = __VERIFIER_nondet_uchar() [L85] input_36 = __VERIFIER_nondet_uchar() [L86] input_38 = __VERIFIER_nondet_uchar() [L87] input_100 = __VERIFIER_nondet_uchar() [L88] input_102 = __VERIFIER_nondet_uchar() [L89] input_105 = __VERIFIER_nondet_uchar() [L90] input_107 = __VERIFIER_nondet_uchar() [L91] input_109 = __VERIFIER_nondet_uchar() [L92] input_111 = __VERIFIER_nondet_uchar() [L93] input_113 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_19_arg_0=0, var_19_arg_1=-256, var_30=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_30=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_22_arg_0=0, var_22_arg_1=255, var_30=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_30=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = state_24; [L105] SORT_3 var_26 = ~var_26_arg_0; [L106] SORT_3 var_27_arg_0 = var_23; [L107] SORT_3 var_27_arg_1 = var_26; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_27_arg_0=-256, var_27_arg_1=-256, var_30=1] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L108] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_3 var_31_arg_0 = var_27; [L110] SORT_3 var_31 = ~var_31_arg_0; [L111] SORT_3 var_32_arg_0 = var_30; [L112] SORT_3 var_32_arg_1 = var_31; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1, var_32_arg_0=1, var_32_arg_1=-1] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L113] SORT_3 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L114] var_32 = var_32 & mask_SORT_3 [L115] SORT_3 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.0s, OverallIterations: 49, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9000 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9000 mSDsluCounter, 85136 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76777 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20392 IncrementalHoareTripleChecker+Invalid, 20554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 8359 mSDtfsCounter, 20392 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2082 GetRequests, 1003 SyntacticMatches, 22 SemanticMatches, 1057 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 22.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7853occurred in iteration=47, InterpolantAutomatonStates: 769, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 48 MinimizatonAttempts, 8364 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 32.8s InterpolantComputationTime, 4375 NumberOfCodeBlocks, 4375 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 4807 ConstructedInterpolants, 0 QuantifiedInterpolants, 29275 SizeOfPredicates, 60 NumberOfNonLiveVariables, 3767 ConjunctsInSsa, 807 ConjunctsInUnsatCore, 63 InterpolantComputations, 44 PerfectInterpolantSequences, 578/672 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 23:42:49,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:42:51,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:42:51,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 23:42:51,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:42:51,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:42:51,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:42:51,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:42:51,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:42:51,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:42:51,517 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:42:51,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:42:51,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:42:51,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:42:51,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:42:51,520 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:42:51,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:42:51,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:42:51,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:42:51,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:42:51,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:42:51,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:42:51,524 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:42:51,524 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:42:51,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:42:51,524 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:42:51,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:42:51,525 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:42:51,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:42:51,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:42:51,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:42:51,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:42:51,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:42:51,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:42:51,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:42:51,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:42:51,526 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:42:51,527 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:42:51,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:42:51,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:42:51,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:42:51,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:42:51,528 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:42:51,528 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c [2024-10-12 23:42:51,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:42:51,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:42:51,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:42:51,846 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:42:51,847 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:42:51,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-12 23:42:53,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:42:53,350 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:42:53,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-12 23:42:53,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d1659bd/41a47615ebd04ff09999ae20093160a0/FLAGa95a421a5 [2024-10-12 23:42:53,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d1659bd/41a47615ebd04ff09999ae20093160a0 [2024-10-12 23:42:53,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:42:53,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:42:53,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:42:53,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:42:53,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:42:53,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:42:53" (1/1) ... [2024-10-12 23:42:53,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@168361fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:53, skipping insertion in model container [2024-10-12 23:42:53,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:42:53" (1/1) ... [2024-10-12 23:42:53,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:42:53,905 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-10-12 23:42:53,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:42:53,989 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:42:54,000 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/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-10-12 23:42:54,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:42:54,067 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:42:54,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54 WrapperNode [2024-10-12 23:42:54,068 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:42:54,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:42:54,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:42:54,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:42:54,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,116 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2024-10-12 23:42:54,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:42:54,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:42:54,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:42:54,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:42:54,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,159 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 23:42:54,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:42:54,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:42:54,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:42:54,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:42:54,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (1/1) ... [2024-10-12 23:42:54,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:42:54,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:42:54,214 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 23:42:54,216 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 23:42:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:42:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:42:54,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:42:54,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:42:54,346 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:42:54,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:42:54,599 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-12 23:42:54,599 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:42:54,643 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:42:54,643 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:42:54,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:42:54 BoogieIcfgContainer [2024-10-12 23:42:54,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:42:54,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:42:54,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:42:54,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:42:54,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:42:53" (1/3) ... [2024-10-12 23:42:54,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77685116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:42:54, skipping insertion in model container [2024-10-12 23:42:54,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:42:54" (2/3) ... [2024-10-12 23:42:54,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77685116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:42:54, skipping insertion in model container [2024-10-12 23:42:54,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:42:54" (3/3) ... [2024-10-12 23:42:54,651 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-10-12 23:42:54,666 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:42:54,666 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:42:54,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:42:54,725 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;@72bede1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:42:54,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:42:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 23:42:54,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 23:42:54,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:54,736 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 23:42:54,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:54,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:54,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 23:42:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:42:54,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270055881] [2024-10-12 23:42:54,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:54,756 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:42:54,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:42:54,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:42:54,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 23:42:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:54,853 WARN L253 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 23:42:54,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:42:55,056 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 23:42:55,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:42:55,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:42:55,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270055881] [2024-10-12 23:42:55,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270055881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:42:55,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:42:55,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:42:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966730524] [2024-10-12 23:42:55,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:55,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:42:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:42:55,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:42:55,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:42:55,081 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 23:42:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:55,123 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 23:42:55,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:42:55,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-12 23:42:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:55,135 INFO L225 Difference]: With dead ends: 15 [2024-10-12 23:42:55,135 INFO L226 Difference]: Without dead ends: 9 [2024-10-12 23:42:55,137 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 23:42:55,141 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:55,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:42:55,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-12 23:42:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 23:42:55,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 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 23:42:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 23:42:55,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 23:42:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:55,163 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 23:42:55,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 23:42:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 23:42:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 23:42:55,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:42:55,164 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 23:42:55,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 23:42:55,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:42:55,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:42:55,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:42:55,367 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 23:42:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:42:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538799793] [2024-10-12 23:42:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:42:55,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:42:55,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:42:55,371 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:42:55,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 23:42:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:42:55,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 23:42:55,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:42:55,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:55,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:42:55,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:42:55,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:42:55,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538799793] [2024-10-12 23:42:55,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538799793] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 23:42:55,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 23:42:55,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-12 23:42:55,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723229428] [2024-10-12 23:42:55,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:42:55,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:42:55,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:42:55,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:42:55,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:42:55,660 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 23:42:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:42:55,683 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2024-10-12 23:42:55,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:42:55,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-10-12 23:42:55,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:42:55,684 INFO L225 Difference]: With dead ends: 8 [2024-10-12 23:42:55,684 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 23:42:55,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:42:55,685 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:42:55,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:42:55,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 23:42:55,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 23:42:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:42:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 23:42:55,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2024-10-12 23:42:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:42:55,696 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 23:42:55,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 23:42:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 23:42:55,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 23:42:55,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:42:55,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-12 23:42:55,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:42:55,905 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-12 23:42:55,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 23:42:55,934 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:42:55,941 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-12 23:42:55,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:42:55 BoogieIcfgContainer [2024-10-12 23:42:55,943 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:42:55,943 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:42:55,943 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:42:55,943 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:42:55,944 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:42:54" (3/4) ... [2024-10-12 23:42:55,945 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 23:42:55,952 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 23:42:55,953 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 23:42:55,953 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 23:42:55,953 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 23:42:56,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 23:42:56,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 23:42:56,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:42:56,109 INFO L158 Benchmark]: Toolchain (without parser) took 2396.37ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 35.9MB in the beginning and 75.1MB in the end (delta: -39.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:42:56,109 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 52.4MB. Free memory is still 29.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:42:56,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.78ms. Allocated memory is still 71.3MB. Free memory was 35.7MB in the beginning and 37.0MB in the end (delta: -1.2MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-10-12 23:42:56,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.89ms. Allocated memory is still 71.3MB. Free memory was 37.0MB in the beginning and 34.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:42:56,110 INFO L158 Benchmark]: Boogie Preprocessor took 67.95ms. Allocated memory is still 71.3MB. Free memory was 34.3MB in the beginning and 31.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:42:56,110 INFO L158 Benchmark]: RCFGBuilder took 457.15ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 47.2MB in the end (delta: -16.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-10-12 23:42:56,110 INFO L158 Benchmark]: TraceAbstraction took 1297.31ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 46.5MB in the beginning and 56.3MB in the end (delta: -9.8MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-10-12 23:42:56,111 INFO L158 Benchmark]: Witness Printer took 165.62ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 56.3MB in the beginning and 75.1MB in the end (delta: -18.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:42:56,112 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 52.4MB. Free memory is still 29.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.78ms. Allocated memory is still 71.3MB. Free memory was 35.7MB in the beginning and 37.0MB in the end (delta: -1.2MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.89ms. Allocated memory is still 71.3MB. Free memory was 37.0MB in the beginning and 34.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.95ms. Allocated memory is still 71.3MB. Free memory was 34.3MB in the beginning and 31.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 457.15ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 47.2MB in the end (delta: -16.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1297.31ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 46.5MB in the beginning and 56.3MB in the end (delta: -9.8MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 165.62ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 56.3MB in the beginning and 75.1MB in the end (delta: -18.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 3 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=1, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 2 QuantifiedInterpolants, 199 SizeOfPredicates, 9 NumberOfNonLiveVariables, 108 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-10-12 23:42:56,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE