./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label29.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b63b3bf7ef08814c7616207e01fc54fc4cf0e6569356ae10e2de73225afc9bce --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:16:39,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:16:39,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:16:39,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:16:39,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:16:39,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:16:39,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:16:39,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:16:39,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:16:39,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:16:39,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:16:39,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:16:39,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:16:39,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:16:39,232 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:16:39,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:16:39,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:16:39,233 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:16:39,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:16:39,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:16:39,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:16:39,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:16:39,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:16:39,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:16:39,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:16:39,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:16:39,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:16:39,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:16:39,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:16:39,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:16:39,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:16:39,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:16:39,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:16:39,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:16:39,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:16:39,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:16:39,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:16:39,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:16:39,241 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:16:39,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:16:39,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:16:39,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:16:39,244 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b63b3bf7ef08814c7616207e01fc54fc4cf0e6569356ae10e2de73225afc9bce [2024-10-12 15:16:39,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:16:39,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:16:39,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:16:39,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:16:39,531 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:16:39,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label29.c [2024-10-12 15:16:40,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:16:41,259 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:16:41,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label29.c [2024-10-12 15:16:41,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63c0772e/7d8a9de29d5e4b60bcabfeb8b040ccd0/FLAG32f893e26 [2024-10-12 15:16:41,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c63c0772e/7d8a9de29d5e4b60bcabfeb8b040ccd0 [2024-10-12 15:16:41,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:16:41,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:16:41,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:16:41,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:16:41,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:16:41,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:41,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5155c9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41, skipping insertion in model container [2024-10-12 15:16:41,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:41,374 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:16:41,689 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label29.c[17015,17028] [2024-10-12 15:16:41,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:16:41,744 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:16:41,812 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label29.c[17015,17028] [2024-10-12 15:16:41,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:16:41,839 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:16:41,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41 WrapperNode [2024-10-12 15:16:41,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:16:41,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:16:41,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:16:41,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:16:41,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:41,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:41,932 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-12 15:16:41,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:16:41,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:16:41,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:16:41,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:16:41,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:41,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:41,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:41,971 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 15:16:41,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:41,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:42,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:42,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:42,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:42,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:42,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:16:42,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:16:42,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:16:42,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:16:42,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (1/1) ... [2024-10-12 15:16:42,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:16:42,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:16:42,075 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 15:16:42,078 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 15:16:42,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:16:42,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:16:42,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:16:42,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:16:42,209 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:16:42,212 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:16:43,285 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-12 15:16:43,285 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:16:43,347 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:16:43,349 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:16:43,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:16:43 BoogieIcfgContainer [2024-10-12 15:16:43,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:16:43,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:16:43,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:16:43,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:16:43,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:16:41" (1/3) ... [2024-10-12 15:16:43,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1139c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:16:43, skipping insertion in model container [2024-10-12 15:16:43,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:16:41" (2/3) ... [2024-10-12 15:16:43,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1139c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:16:43, skipping insertion in model container [2024-10-12 15:16:43,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:16:43" (3/3) ... [2024-10-12 15:16:43,359 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label29.c [2024-10-12 15:16:43,375 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:16:43,376 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:16:43,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:16:43,460 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;@1ad7a23c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:16:43,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:16:43,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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 15:16:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 15:16:43,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:43,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:43,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:43,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:43,484 INFO L85 PathProgramCache]: Analyzing trace with hash -407622080, now seen corresponding path program 1 times [2024-10-12 15:16:43,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:43,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643783048] [2024-10-12 15:16:43,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:43,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:43,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 15:16:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:43,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643783048] [2024-10-12 15:16:43,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643783048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:43,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:43,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:43,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606358790] [2024-10-12 15:16:43,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:43,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 15:16:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:43,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 15:16:43,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:16:43,927 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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 15:16:43,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:43,975 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-12 15:16:43,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 15:16:43,978 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-10-12 15:16:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:43,991 INFO L225 Difference]: With dead ends: 329 [2024-10-12 15:16:43,991 INFO L226 Difference]: Without dead ends: 163 [2024-10-12 15:16:43,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 15:16:44,000 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:44,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:16:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-12 15:16:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-12 15:16:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:16:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-12 15:16:44,054 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 101 [2024-10-12 15:16:44,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:44,055 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-12 15:16:44,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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 15:16:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-12 15:16:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 15:16:44,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:44,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:44,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:16:44,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:44,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1769677482, now seen corresponding path program 1 times [2024-10-12 15:16:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630084602] [2024-10-12 15:16:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:44,418 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 15:16:44,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:44,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630084602] [2024-10-12 15:16:44,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630084602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:44,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:44,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842638422] [2024-10-12 15:16:44,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:44,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:44,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:44,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:44,426 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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 15:16:45,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:45,032 INFO L93 Difference]: Finished difference Result 477 states and 731 transitions. [2024-10-12 15:16:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:45,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-10-12 15:16:45,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:45,038 INFO L225 Difference]: With dead ends: 477 [2024-10-12 15:16:45,040 INFO L226 Difference]: Without dead ends: 315 [2024-10-12 15:16:45,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:45,042 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 66 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:45,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 64 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 15:16:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-12 15:16:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 308. [2024-10-12 15:16:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 307 states have (on average 1.4625407166123778) internal successors, (449), 307 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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 15:16:45,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 449 transitions. [2024-10-12 15:16:45,080 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 449 transitions. Word has length 101 [2024-10-12 15:16:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:45,080 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 449 transitions. [2024-10-12 15:16:45,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states 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 15:16:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 449 transitions. [2024-10-12 15:16:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 15:16:45,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:45,086 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:45,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:16:45,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:45,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash -887755337, now seen corresponding path program 1 times [2024-10-12 15:16:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:45,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191802188] [2024-10-12 15:16:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:45,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:45,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191802188] [2024-10-12 15:16:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191802188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:45,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:45,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881651702] [2024-10-12 15:16:45,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:45,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:45,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:45,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:45,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:45,298 INFO L87 Difference]: Start difference. First operand 308 states and 449 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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 15:16:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:45,823 INFO L93 Difference]: Finished difference Result 899 states and 1315 transitions. [2024-10-12 15:16:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:45,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-10-12 15:16:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:45,826 INFO L225 Difference]: With dead ends: 899 [2024-10-12 15:16:45,826 INFO L226 Difference]: Without dead ends: 592 [2024-10-12 15:16:45,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:45,828 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 141 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:45,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 115 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:16:45,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-12 15:16:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 590. [2024-10-12 15:16:45,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 589 states have (on average 1.2937181663837012) internal successors, (762), 589 states have internal predecessors, (762), 0 states have call successors, (0), 0 states 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 15:16:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 762 transitions. [2024-10-12 15:16:45,855 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 762 transitions. Word has length 109 [2024-10-12 15:16:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:45,856 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 762 transitions. [2024-10-12 15:16:45,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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 15:16:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 762 transitions. [2024-10-12 15:16:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 15:16:45,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:45,859 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, 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 15:16:45,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:16:45,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:45,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash 230675909, now seen corresponding path program 1 times [2024-10-12 15:16:45,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:45,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382081378] [2024-10-12 15:16:45,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:45,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:46,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:46,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382081378] [2024-10-12 15:16:46,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382081378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:46,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:46,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389308918] [2024-10-12 15:16:46,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:46,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:46,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:46,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:46,070 INFO L87 Difference]: Start difference. First operand 590 states and 762 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 15:16:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:46,559 INFO L93 Difference]: Finished difference Result 1464 states and 1941 transitions. [2024-10-12 15:16:46,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:46,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-10-12 15:16:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:46,564 INFO L225 Difference]: With dead ends: 1464 [2024-10-12 15:16:46,564 INFO L226 Difference]: Without dead ends: 875 [2024-10-12 15:16:46,565 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 15:16:46,566 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 47 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:46,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 269 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:16:46,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-12 15:16:46,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2024-10-12 15:16:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 1.2270642201834863) internal successors, (1070), 872 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states 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 15:16:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1070 transitions. [2024-10-12 15:16:46,586 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1070 transitions. Word has length 110 [2024-10-12 15:16:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:46,587 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1070 transitions. [2024-10-12 15:16:46,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 15:16:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1070 transitions. [2024-10-12 15:16:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 15:16:46,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:46,590 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, 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 15:16:46,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:16:46,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:46,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash 170501778, now seen corresponding path program 1 times [2024-10-12 15:16:46,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:46,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346061743] [2024-10-12 15:16:46,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:46,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:46,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:46,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346061743] [2024-10-12 15:16:46,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346061743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:46,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:46,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:16:46,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012914126] [2024-10-12 15:16:46,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:46,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:46,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:46,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:46,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:46,669 INFO L87 Difference]: Start difference. First operand 873 states and 1070 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 15:16:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:47,115 INFO L93 Difference]: Finished difference Result 2447 states and 3013 transitions. [2024-10-12 15:16:47,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:47,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-12 15:16:47,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:47,120 INFO L225 Difference]: With dead ends: 2447 [2024-10-12 15:16:47,121 INFO L226 Difference]: Without dead ends: 1575 [2024-10-12 15:16:47,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:47,125 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 188 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:47,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 79 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:16:47,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-10-12 15:16:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2024-10-12 15:16:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.1918678526048285) internal successors, (1876), 1574 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states 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 15:16:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1876 transitions. [2024-10-12 15:16:47,160 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1876 transitions. Word has length 111 [2024-10-12 15:16:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:47,160 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 1876 transitions. [2024-10-12 15:16:47,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 15:16:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1876 transitions. [2024-10-12 15:16:47,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 15:16:47,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:47,163 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:47,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:16:47,164 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:47,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:47,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2040169734, now seen corresponding path program 1 times [2024-10-12 15:16:47,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:47,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654717442] [2024-10-12 15:16:47,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:47,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:47,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:47,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654717442] [2024-10-12 15:16:47,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654717442] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:16:47,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300677743] [2024-10-12 15:16:47,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:47,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:16:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:16:47,592 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 15:16:47,594 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 15:16:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:47,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:16:47,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:16:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 15:16:47,900 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:16:47,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300677743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:47,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:16:47,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-12 15:16:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760796847] [2024-10-12 15:16:47,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:47,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:47,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:47,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:16:47,903 INFO L87 Difference]: Start difference. First operand 1575 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 15:16:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:48,345 INFO L93 Difference]: Finished difference Result 4425 states and 5308 transitions. [2024-10-12 15:16:48,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:48,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 128 [2024-10-12 15:16:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:48,356 INFO L225 Difference]: With dead ends: 4425 [2024-10-12 15:16:48,356 INFO L226 Difference]: Without dead ends: 2851 [2024-10-12 15:16:48,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:16:48,361 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 73 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:48,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 95 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:16:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2024-10-12 15:16:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2845. [2024-10-12 15:16:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2844 states have (on average 1.191279887482419) internal successors, (3388), 2844 states have internal predecessors, (3388), 0 states have call successors, (0), 0 states 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 15:16:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 3388 transitions. [2024-10-12 15:16:48,418 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 3388 transitions. Word has length 128 [2024-10-12 15:16:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:48,418 INFO L471 AbstractCegarLoop]: Abstraction has 2845 states and 3388 transitions. [2024-10-12 15:16:48,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 15:16:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3388 transitions. [2024-10-12 15:16:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-12 15:16:48,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:48,423 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:48,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 15:16:48,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-12 15:16:48,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:48,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:48,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1706843660, now seen corresponding path program 1 times [2024-10-12 15:16:48,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:48,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977230283] [2024-10-12 15:16:48,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:48,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 15:16:48,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:48,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977230283] [2024-10-12 15:16:48,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977230283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:48,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:16:48,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:16:48,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637951895] [2024-10-12 15:16:48,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:48,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:48,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:48,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:48,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:16:48,799 INFO L87 Difference]: Start difference. First operand 2845 states and 3388 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 15:16:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:49,320 INFO L93 Difference]: Finished difference Result 6531 states and 7848 transitions. [2024-10-12 15:16:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:49,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-10-12 15:16:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:49,335 INFO L225 Difference]: With dead ends: 6531 [2024-10-12 15:16:49,335 INFO L226 Difference]: Without dead ends: 3687 [2024-10-12 15:16:49,342 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 15:16:49,344 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 144 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:49,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 251 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:16:49,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2024-10-12 15:16:49,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3685. [2024-10-12 15:16:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3685 states, 3684 states have (on average 1.1639522258414767) internal successors, (4288), 3684 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states 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 15:16:49,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4288 transitions. [2024-10-12 15:16:49,429 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 4288 transitions. Word has length 134 [2024-10-12 15:16:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:49,429 INFO L471 AbstractCegarLoop]: Abstraction has 3685 states and 4288 transitions. [2024-10-12 15:16:49,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 15:16:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 4288 transitions. [2024-10-12 15:16:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-12 15:16:49,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:16:49,435 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:16:49,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 15:16:49,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:16:49,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:16:49,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1732012969, now seen corresponding path program 1 times [2024-10-12 15:16:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:16:49,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247961734] [2024-10-12 15:16:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:49,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:16:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:16:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:16:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247961734] [2024-10-12 15:16:49,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247961734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:16:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068306716] [2024-10-12 15:16:49,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:16:49,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:16:49,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:16:49,802 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 15:16:49,804 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 15:16:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:16:49,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:16:49,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:16:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-12 15:16:50,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:16:50,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068306716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:16:50,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 15:16:50,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-12 15:16:50,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576993103] [2024-10-12 15:16:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:16:50,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:16:50,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:16:50,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:16:50,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:16:50,093 INFO L87 Difference]: Start difference. First operand 3685 states and 4288 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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 15:16:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:16:50,573 INFO L93 Difference]: Finished difference Result 8626 states and 10073 transitions. [2024-10-12 15:16:50,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:16:50,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-10-12 15:16:50,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:16:50,575 INFO L225 Difference]: With dead ends: 8626 [2024-10-12 15:16:50,575 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 15:16:50,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 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 15:16:50,584 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:16:50,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 38 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:16:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 15:16:50,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 15:16:50,585 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 15:16:50,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 15:16:50,585 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2024-10-12 15:16:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:16:50,586 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 15:16:50,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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 15:16:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 15:16:50,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 15:16:50,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:16:50,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 15:16:50,790 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,SelfDestructingSolverStorable7 [2024-10-12 15:16:50,793 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:16:50,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 15:16:50,842 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:16:50,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:16:50 BoogieIcfgContainer [2024-10-12 15:16:50,864 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:16:50,864 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:16:50,864 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:16:50,865 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:16:50,867 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:16:43" (3/4) ... [2024-10-12 15:16:50,869 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 15:16:50,887 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-12 15:16:50,891 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 15:16:50,892 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 15:16:50,893 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 15:16:51,055 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:16:51,059 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 15:16:51,059 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:16:51,060 INFO L158 Benchmark]: Toolchain (without parser) took 9761.85ms. Allocated memory was 130.0MB in the beginning and 293.6MB in the end (delta: 163.6MB). Free memory was 61.6MB in the beginning and 133.8MB in the end (delta: -72.2MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. [2024-10-12 15:16:51,060 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 130.0MB. Free memory was 98.6MB in the beginning and 98.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:16:51,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 540.68ms. Allocated memory was 130.0MB in the beginning and 186.6MB in the end (delta: 56.6MB). Free memory was 61.2MB in the beginning and 133.7MB in the end (delta: -72.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2024-10-12 15:16:51,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.26ms. Allocated memory is still 186.6MB. Free memory was 133.7MB in the beginning and 127.8MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 15:16:51,061 INFO L158 Benchmark]: Boogie Preprocessor took 98.13ms. Allocated memory is still 186.6MB. Free memory was 127.8MB in the beginning and 122.4MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 15:16:51,061 INFO L158 Benchmark]: RCFGBuilder took 1317.78ms. Allocated memory is still 186.6MB. Free memory was 122.4MB in the beginning and 99.9MB in the end (delta: 22.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-12 15:16:51,062 INFO L158 Benchmark]: TraceAbstraction took 7512.29ms. Allocated memory was 186.6MB in the beginning and 293.6MB in the end (delta: 107.0MB). Free memory was 98.9MB in the beginning and 145.3MB in the end (delta: -46.5MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2024-10-12 15:16:51,062 INFO L158 Benchmark]: Witness Printer took 195.21ms. Allocated memory is still 293.6MB. Free memory was 145.3MB in the beginning and 133.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:16:51,064 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.48ms. Allocated memory is still 130.0MB. Free memory was 98.6MB in the beginning and 98.5MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 540.68ms. Allocated memory was 130.0MB in the beginning and 186.6MB in the end (delta: 56.6MB). Free memory was 61.2MB in the beginning and 133.7MB in the end (delta: -72.5MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.26ms. Allocated memory is still 186.6MB. Free memory was 133.7MB in the beginning and 127.8MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.13ms. Allocated memory is still 186.6MB. Free memory was 127.8MB in the beginning and 122.4MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1317.78ms. Allocated memory is still 186.6MB. Free memory was 122.4MB in the beginning and 99.9MB in the end (delta: 22.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7512.29ms. Allocated memory was 186.6MB in the beginning and 293.6MB in the end (delta: 107.0MB). Free memory was 98.9MB in the beginning and 145.3MB in the end (delta: -46.5MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * Witness Printer took 195.21ms. Allocated memory is still 293.6MB. Free memory was 145.3MB in the beginning and 133.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 488]: 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, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 774 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 774 mSDsluCounter, 1159 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 498 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2612 IncrementalHoareTripleChecker+Invalid, 3110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 498 mSolverCounterUnsat, 1040 mSDtfsCounter, 2612 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3685occurred in iteration=7, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1190 NumberOfCodeBlocks, 1190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1180 ConstructedInterpolants, 0 QuantifiedInterpolants, 4342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 507 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 191/215 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: 616]: Loop Invariant Derived loop invariant: ((((a25 == a11) || (a19 == 1)) || ((10 <= a28) && (a25 <= 0))) || (7 < a17)) RESULT: Ultimate proved your program to be correct! [2024-10-12 15:16:51,098 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