./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/Problem14_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label01.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c37d32a33cb40c9afe6e04b3666819154b9d70eb1819b42c10fde7907ef957d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:31:51,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:31:51,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:31:51,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:31:51,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:31:51,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:31:51,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:31:51,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:31:51,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:31:51,568 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:31:51,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:31:51,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:31:51,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:31:51,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:31:51,571 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:31:51,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:31:51,571 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:31:51,571 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:31:51,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:31:51,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:31:51,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:31:51,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:31:51,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:31:51,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:31:51,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:31:51,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:31:51,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:31:51,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:31:51,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:31:51,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:31:51,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:31:51,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:31:51,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:31:51,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:31:51,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:31:51,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:31:51,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:31:51,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:31:51,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:31:51,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:31:51,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:31:51,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:31:51,578 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c37d32a33cb40c9afe6e04b3666819154b9d70eb1819b42c10fde7907ef957d [2024-10-10 23:31:51,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:31:51,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:31:51,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:31:51,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:31:51,809 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:31:51,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label01.c [2024-10-10 23:31:53,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:31:53,324 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:31:53,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label01.c [2024-10-10 23:31:53,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9157cc55c/ef7494872cef4ec3bdcc8360e9ea0ada/FLAG05306c1f2 [2024-10-10 23:31:53,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9157cc55c/ef7494872cef4ec3bdcc8360e9ea0ada [2024-10-10 23:31:53,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:31:53,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:31:53,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:31:53,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:31:53,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:31:53,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62384ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53, skipping insertion in model container [2024-10-10 23:31:53,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:31:53,598 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/Problem14_label01.c[5556,5569] [2024-10-10 23:31:53,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:31:53,750 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:31:53,770 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/Problem14_label01.c[5556,5569] [2024-10-10 23:31:53,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:31:53,847 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:31:53,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53 WrapperNode [2024-10-10 23:31:53,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:31:53,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:31:53,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:31:53,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:31:53,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,916 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-10 23:31:53,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:31:53,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:31:53,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:31:53,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:31:53,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,967 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:31:53,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,983 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:53,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:54,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:31:54,005 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:31:54,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:31:54,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:31:54,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (1/1) ... [2024-10-10 23:31:54,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:31:54,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:31:54,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:31:54,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:31:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:31:54,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:31:54,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:31:54,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:31:54,215 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:31:54,217 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:31:55,196 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-10 23:31:55,196 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:31:55,244 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:31:55,245 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:31:55,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:31:55 BoogieIcfgContainer [2024-10-10 23:31:55,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:31:55,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:31:55,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:31:55,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:31:55,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:31:53" (1/3) ... [2024-10-10 23:31:55,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5389d092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:31:55, skipping insertion in model container [2024-10-10 23:31:55,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:31:53" (2/3) ... [2024-10-10 23:31:55,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5389d092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:31:55, skipping insertion in model container [2024-10-10 23:31:55,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:31:55" (3/3) ... [2024-10-10 23:31:55,255 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label01.c [2024-10-10 23:31:55,268 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:31:55,269 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:31:55,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:31:55,335 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;@16740ef9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:31:55,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:31:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-10 23:31:55,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:55,345 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] [2024-10-10 23:31:55,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:55,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash -737880132, now seen corresponding path program 1 times [2024-10-10 23:31:55,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:55,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793407723] [2024-10-10 23:31:55,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:55,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:31:55,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:55,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793407723] [2024-10-10 23:31:55,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793407723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:55,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:55,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652254797] [2024-10-10 23:31:55,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:55,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:31:55,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:55,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:31:55,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:31:55,541 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 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 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:55,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:55,577 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-10 23:31:55,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:31:55,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-10 23:31:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:55,586 INFO L225 Difference]: With dead ends: 365 [2024-10-10 23:31:55,587 INFO L226 Difference]: Without dead ends: 181 [2024-10-10 23:31:55,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:31:55,593 INFO L432 NwaCegarLoop]: 295 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, 295 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:55,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:31:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-10 23:31:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-10 23:31:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-10 23:31:55,645 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 53 [2024-10-10 23:31:55,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:55,646 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-10 23:31:55,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:55,646 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-10 23:31:55,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-10 23:31:55,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:55,647 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] [2024-10-10 23:31:55,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:31:55,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:55,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1572917954, now seen corresponding path program 1 times [2024-10-10 23:31:55,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:55,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347564595] [2024-10-10 23:31:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:55,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:55,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:31:55,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:55,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347564595] [2024-10-10 23:31:55,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347564595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:55,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:55,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:31:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507614544] [2024-10-10 23:31:55,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:55,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:31:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:55,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:31:55,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:31:55,959 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:57,180 INFO L93 Difference]: Finished difference Result 717 states and 1175 transitions. [2024-10-10 23:31:57,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:31:57,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-10 23:31:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:57,186 INFO L225 Difference]: With dead ends: 717 [2024-10-10 23:31:57,187 INFO L226 Difference]: Without dead ends: 537 [2024-10-10 23:31:57,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:31:57,190 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 485 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:57,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 120 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:31:57,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-10 23:31:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2024-10-10 23:31:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4496268656716418) internal successors, (777), 536 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 777 transitions. [2024-10-10 23:31:57,235 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 777 transitions. Word has length 53 [2024-10-10 23:31:57,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:57,235 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 777 transitions. [2024-10-10 23:31:57,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 777 transitions. [2024-10-10 23:31:57,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-10 23:31:57,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:57,238 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:31:57,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:31:57,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:57,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:57,239 INFO L85 PathProgramCache]: Analyzing trace with hash -75138259, now seen corresponding path program 1 times [2024-10-10 23:31:57,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:57,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767090834] [2024-10-10 23:31:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:57,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:31:57,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:57,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767090834] [2024-10-10 23:31:57,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767090834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:57,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:57,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:31:57,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367678736] [2024-10-10 23:31:57,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:57,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:57,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:57,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:57,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:57,381 INFO L87 Difference]: Start difference. First operand 537 states and 777 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:57,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:57,886 INFO L93 Difference]: Finished difference Result 1073 states and 1655 transitions. [2024-10-10 23:31:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:57,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-10-10 23:31:57,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:57,889 INFO L225 Difference]: With dead ends: 1073 [2024-10-10 23:31:57,889 INFO L226 Difference]: Without dead ends: 715 [2024-10-10 23:31:57,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:57,891 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:57,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 55 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:31:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-10 23:31:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-10 23:31:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.354341736694678) internal successors, (967), 714 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:57,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2024-10-10 23:31:57,912 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 119 [2024-10-10 23:31:57,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:57,912 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2024-10-10 23:31:57,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:57,913 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2024-10-10 23:31:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-10 23:31:57,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:57,917 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:31:57,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:31:57,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:57,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash -353627734, now seen corresponding path program 1 times [2024-10-10 23:31:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:57,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994611581] [2024-10-10 23:31:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:57,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:31:58,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:58,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994611581] [2024-10-10 23:31:58,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994611581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:58,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:58,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:31:58,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193995369] [2024-10-10 23:31:58,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:58,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:31:58,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:58,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:31:58,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:31:58,125 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:58,758 INFO L93 Difference]: Finished difference Result 1638 states and 2268 transitions. [2024-10-10 23:31:58,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:31:58,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2024-10-10 23:31:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:58,761 INFO L225 Difference]: With dead ends: 1638 [2024-10-10 23:31:58,761 INFO L226 Difference]: Without dead ends: 1073 [2024-10-10 23:31:58,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:31:58,763 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 112 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:58,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 112 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:31:58,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-10-10 23:31:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1071. [2024-10-10 23:31:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1476635514018692) internal successors, (1228), 1070 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1228 transitions. [2024-10-10 23:31:58,782 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1228 transitions. Word has length 133 [2024-10-10 23:31:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:58,782 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1228 transitions. [2024-10-10 23:31:58,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1228 transitions. [2024-10-10 23:31:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-10-10 23:31:58,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:58,788 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:31:58,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:31:58,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:58,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:58,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1261814563, now seen corresponding path program 1 times [2024-10-10 23:31:58,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:58,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169980466] [2024-10-10 23:31:58,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:58,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 23:31:59,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:59,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169980466] [2024-10-10 23:31:59,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169980466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:59,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:59,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:31:59,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258973908] [2024-10-10 23:31:59,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:59,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:31:59,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:31:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:59,130 INFO L87 Difference]: Start difference. First operand 1071 states and 1228 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:31:59,563 INFO L93 Difference]: Finished difference Result 2497 states and 2960 transitions. [2024-10-10 23:31:59,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:31:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 333 [2024-10-10 23:31:59,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:31:59,569 INFO L225 Difference]: With dead ends: 2497 [2024-10-10 23:31:59,569 INFO L226 Difference]: Without dead ends: 1605 [2024-10-10 23:31:59,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:31:59,574 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:31:59,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 75 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:31:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-10-10 23:31:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1427. [2024-10-10 23:31:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.138148667601683) internal successors, (1623), 1426 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1623 transitions. [2024-10-10 23:31:59,609 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1623 transitions. Word has length 333 [2024-10-10 23:31:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:31:59,610 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1623 transitions. [2024-10-10 23:31:59,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:31:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1623 transitions. [2024-10-10 23:31:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-10 23:31:59,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:31:59,614 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:31:59,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:31:59,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:31:59,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:31:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash 514564169, now seen corresponding path program 1 times [2024-10-10 23:31:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:31:59,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322313807] [2024-10-10 23:31:59,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:31:59,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:31:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:31:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-10-10 23:31:59,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:31:59,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322313807] [2024-10-10 23:31:59,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322313807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:31:59,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:31:59,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:31:59,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415295548] [2024-10-10 23:31:59,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:31:59,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:31:59,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:31:59,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:31:59,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:31:59,894 INFO L87 Difference]: Start difference. First operand 1427 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:00,422 INFO L93 Difference]: Finished difference Result 2882 states and 3311 transitions. [2024-10-10 23:32:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:32:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 344 [2024-10-10 23:32:00,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:00,429 INFO L225 Difference]: With dead ends: 2882 [2024-10-10 23:32:00,429 INFO L226 Difference]: Without dead ends: 1605 [2024-10-10 23:32:00,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:32:00,433 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:00,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:32:00,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-10-10 23:32:00,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1427. [2024-10-10 23:32:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.0953716690042077) internal successors, (1562), 1426 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1562 transitions. [2024-10-10 23:32:00,454 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1562 transitions. Word has length 344 [2024-10-10 23:32:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:00,455 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1562 transitions. [2024-10-10 23:32:00,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1562 transitions. [2024-10-10 23:32:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2024-10-10 23:32:00,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:00,458 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:00,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:32:00,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:00,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2008118751, now seen corresponding path program 1 times [2024-10-10 23:32:00,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:00,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189925872] [2024-10-10 23:32:00,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:00,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-10 23:32:00,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:00,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189925872] [2024-10-10 23:32:00,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189925872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:00,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:00,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:00,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455114749] [2024-10-10 23:32:00,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:00,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:32:00,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:00,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:32:00,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:32:00,730 INFO L87 Difference]: Start difference. First operand 1427 states and 1562 transitions. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:01,350 INFO L93 Difference]: Finished difference Result 3211 states and 3531 transitions. [2024-10-10 23:32:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:32:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 357 [2024-10-10 23:32:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:01,355 INFO L225 Difference]: With dead ends: 3211 [2024-10-10 23:32:01,355 INFO L226 Difference]: Without dead ends: 1963 [2024-10-10 23:32:01,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:32:01,357 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 126 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:01,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 72 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:32:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2024-10-10 23:32:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1783. [2024-10-10 23:32:01,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.0841750841750841) internal successors, (1932), 1782 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 1932 transitions. [2024-10-10 23:32:01,378 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 1932 transitions. Word has length 357 [2024-10-10 23:32:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:01,378 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 1932 transitions. [2024-10-10 23:32:01,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 1932 transitions. [2024-10-10 23:32:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2024-10-10 23:32:01,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:01,383 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-10-10 23:32:01,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:32:01,383 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:01,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1668744120, now seen corresponding path program 2 times [2024-10-10 23:32:01,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:01,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865469151] [2024-10-10 23:32:01,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:01,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:01,662 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 413 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:32:01,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:01,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865469151] [2024-10-10 23:32:01,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865469151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:01,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:01,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:01,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607640415] [2024-10-10 23:32:01,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:01,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:01,665 INFO L87 Difference]: Start difference. First operand 1783 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:02,101 INFO L93 Difference]: Finished difference Result 3743 states and 4121 transitions. [2024-10-10 23:32:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:02,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 439 [2024-10-10 23:32:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:02,107 INFO L225 Difference]: With dead ends: 3743 [2024-10-10 23:32:02,107 INFO L226 Difference]: Without dead ends: 2139 [2024-10-10 23:32:02,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:02,109 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:02,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:02,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-10 23:32:02,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1961. [2024-10-10 23:32:02,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.0775510204081633) internal successors, (2112), 1960 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2112 transitions. [2024-10-10 23:32:02,132 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2112 transitions. Word has length 439 [2024-10-10 23:32:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:02,132 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2112 transitions. [2024-10-10 23:32:02,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2112 transitions. [2024-10-10 23:32:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2024-10-10 23:32:02,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:02,136 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:02,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:32:02,136 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:02,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:02,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2102570827, now seen corresponding path program 1 times [2024-10-10 23:32:02,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:02,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405954106] [2024-10-10 23:32:02,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:02,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:02,411 INFO L134 CoverageAnalysis]: Checked inductivity of 727 backedges. 413 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:32:02,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:02,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405954106] [2024-10-10 23:32:02,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405954106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:02,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:02,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:02,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912968317] [2024-10-10 23:32:02,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:02,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:02,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:02,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:02,413 INFO L87 Difference]: Start difference. First operand 1961 states and 2112 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:02,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:02,851 INFO L93 Difference]: Finished difference Result 4455 states and 4866 transitions. [2024-10-10 23:32:02,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:02,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 446 [2024-10-10 23:32:02,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:02,858 INFO L225 Difference]: With dead ends: 4455 [2024-10-10 23:32:02,858 INFO L226 Difference]: Without dead ends: 2673 [2024-10-10 23:32:02,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:02,860 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 112 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:02,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 200 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-10 23:32:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2495. [2024-10-10 23:32:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2494 states have (on average 1.0838011226944668) internal successors, (2703), 2494 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 2703 transitions. [2024-10-10 23:32:02,890 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 2703 transitions. Word has length 446 [2024-10-10 23:32:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:02,891 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 2703 transitions. [2024-10-10 23:32:02,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2703 transitions. [2024-10-10 23:32:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2024-10-10 23:32:02,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:02,893 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:02,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:32:02,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:02,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:02,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1573591498, now seen corresponding path program 1 times [2024-10-10 23:32:02,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:02,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048515292] [2024-10-10 23:32:02,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:02,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:32:03,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:03,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048515292] [2024-10-10 23:32:03,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048515292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:03,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:03,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:03,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770516034] [2024-10-10 23:32:03,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:03,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:03,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:03,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:03,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:03,087 INFO L87 Difference]: Start difference. First operand 2495 states and 2703 transitions. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:03,531 INFO L93 Difference]: Finished difference Result 5879 states and 6459 transitions. [2024-10-10 23:32:03,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:03,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 487 [2024-10-10 23:32:03,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:03,539 INFO L225 Difference]: With dead ends: 5879 [2024-10-10 23:32:03,539 INFO L226 Difference]: Without dead ends: 3563 [2024-10-10 23:32:03,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:03,541 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 73 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:03,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 48 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2024-10-10 23:32:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3563. [2024-10-10 23:32:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.0797304884896126) internal successors, (3846), 3562 states have internal predecessors, (3846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3846 transitions. [2024-10-10 23:32:03,590 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3846 transitions. Word has length 487 [2024-10-10 23:32:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:03,591 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3846 transitions. [2024-10-10 23:32:03,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3846 transitions. [2024-10-10 23:32:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2024-10-10 23:32:03,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:03,595 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:03,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:32:03,595 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:03,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:03,596 INFO L85 PathProgramCache]: Analyzing trace with hash 843315721, now seen corresponding path program 1 times [2024-10-10 23:32:03,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:03,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606745591] [2024-10-10 23:32:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:03,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1078 backedges. 695 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-10-10 23:32:03,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:03,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606745591] [2024-10-10 23:32:03,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606745591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:03,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:32:03,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:32:03,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200423693] [2024-10-10 23:32:03,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:03,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:03,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:03,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:03,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:03,866 INFO L87 Difference]: Start difference. First operand 3563 states and 3846 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:04,264 INFO L93 Difference]: Finished difference Result 7303 states and 7901 transitions. [2024-10-10 23:32:04,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:04,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 523 [2024-10-10 23:32:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:04,275 INFO L225 Difference]: With dead ends: 7303 [2024-10-10 23:32:04,275 INFO L226 Difference]: Without dead ends: 3919 [2024-10-10 23:32:04,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:32:04,279 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 102 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:04,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 240 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-10 23:32:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3385. [2024-10-10 23:32:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.0765366430260048) internal successors, (3643), 3384 states have internal predecessors, (3643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:04,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3643 transitions. [2024-10-10 23:32:04,318 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3643 transitions. Word has length 523 [2024-10-10 23:32:04,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:04,319 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 3643 transitions. [2024-10-10 23:32:04,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3643 transitions. [2024-10-10 23:32:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2024-10-10 23:32:04,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:04,323 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:04,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:32:04,323 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:04,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:04,323 INFO L85 PathProgramCache]: Analyzing trace with hash 28022453, now seen corresponding path program 1 times [2024-10-10 23:32:04,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:04,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514120669] [2024-10-10 23:32:04,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:04,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 902 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:32:04,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:04,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514120669] [2024-10-10 23:32:04,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514120669] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:32:04,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797480512] [2024-10-10 23:32:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:04,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:04,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:04,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:32:04,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:32:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:04,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:32:04,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:32:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-10-10 23:32:04,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:32:04,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797480512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:04,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:32:04,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:32:04,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449261858] [2024-10-10 23:32:04,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:04,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:04,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:04,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:04,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:32:04,939 INFO L87 Difference]: Start difference. First operand 3385 states and 3643 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:05,353 INFO L93 Difference]: Finished difference Result 7303 states and 7903 transitions. [2024-10-10 23:32:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:05,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 642 [2024-10-10 23:32:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:05,363 INFO L225 Difference]: With dead ends: 7303 [2024-10-10 23:32:05,363 INFO L226 Difference]: Without dead ends: 4097 [2024-10-10 23:32:05,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:32:05,366 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:05,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 234 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2024-10-10 23:32:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 4097. [2024-10-10 23:32:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.069091796875) internal successors, (4379), 4096 states have internal predecessors, (4379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4379 transitions. [2024-10-10 23:32:05,415 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4379 transitions. Word has length 642 [2024-10-10 23:32:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:05,416 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4379 transitions. [2024-10-10 23:32:05,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4379 transitions. [2024-10-10 23:32:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 804 [2024-10-10 23:32:05,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:32:05,421 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:05,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:32:05,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 23:32:05,622 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:32:05,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:32:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1729981029, now seen corresponding path program 1 times [2024-10-10 23:32:05,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:32:05,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997450659] [2024-10-10 23:32:05,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:05,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:32:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 1490 proven. 110 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-10-10 23:32:05,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:32:05,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997450659] [2024-10-10 23:32:05,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997450659] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:32:05,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744322103] [2024-10-10 23:32:05,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:32:05,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:05,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:32:05,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:32:05,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:32:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:32:06,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 981 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:32:06,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:32:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 1655 trivial. 0 not checked. [2024-10-10 23:32:06,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:32:06,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744322103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:32:06,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:32:06,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:32:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086378141] [2024-10-10 23:32:06,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:32:06,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:32:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:32:06,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:32:06,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:32:06,289 INFO L87 Difference]: Start difference. First operand 4097 states and 4379 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:32:06,709 INFO L93 Difference]: Finished difference Result 8903 states and 9616 transitions. [2024-10-10 23:32:06,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:32:06,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 803 [2024-10-10 23:32:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:32:06,710 INFO L225 Difference]: With dead ends: 8903 [2024-10-10 23:32:06,710 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:32:06,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 803 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:32:06,717 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 127 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:32:06,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 236 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:32:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:32:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:32:06,718 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-10 23:32:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:32:06,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 803 [2024-10-10 23:32:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:32:06,719 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:32:06,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:32:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:32:06,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:32:06,722 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:32:06,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:32:06,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:32:06,926 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:32:06,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:32:07,160 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:32:07,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:32:07 BoogieIcfgContainer [2024-10-10 23:32:07,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:32:07,173 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:32:07,173 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:32:07,173 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:32:07,174 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:31:55" (3/4) ... [2024-10-10 23:32:07,175 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:32:07,187 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:32:07,188 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:32:07,188 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:32:07,189 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:32:07,302 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:32:07,303 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:32:07,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:32:07,303 INFO L158 Benchmark]: Toolchain (without parser) took 13938.85ms. Allocated memory was 176.2MB in the beginning and 413.1MB in the end (delta: 237.0MB). Free memory was 145.1MB in the beginning and 144.3MB in the end (delta: 815.7kB). Peak memory consumption was 237.6MB. Max. memory is 16.1GB. [2024-10-10 23:32:07,304 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:32:07,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.81ms. Allocated memory is still 176.2MB. Free memory was 145.1MB in the beginning and 110.3MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-10 23:32:07,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.30ms. Allocated memory is still 176.2MB. Free memory was 110.3MB in the beginning and 100.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:32:07,304 INFO L158 Benchmark]: Boogie Preprocessor took 86.72ms. Allocated memory is still 176.2MB. Free memory was 100.4MB in the beginning and 87.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:32:07,304 INFO L158 Benchmark]: RCFGBuilder took 1241.44ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 87.9MB in the beginning and 155.7MB in the end (delta: -67.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-10-10 23:32:07,305 INFO L158 Benchmark]: TraceAbstraction took 11925.07ms. Allocated memory was 237.0MB in the beginning and 413.1MB in the end (delta: 176.2MB). Free memory was 155.7MB in the beginning and 159.0MB in the end (delta: -3.2MB). Peak memory consumption was 172.9MB. Max. memory is 16.1GB. [2024-10-10 23:32:07,305 INFO L158 Benchmark]: Witness Printer took 129.87ms. Allocated memory is still 413.1MB. Free memory was 159.0MB in the beginning and 144.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:32:07,306 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.13ms. Allocated memory is still 121.6MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.81ms. Allocated memory is still 176.2MB. Free memory was 145.1MB in the beginning and 110.3MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.30ms. Allocated memory is still 176.2MB. Free memory was 110.3MB in the beginning and 100.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.72ms. Allocated memory is still 176.2MB. Free memory was 100.4MB in the beginning and 87.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1241.44ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 87.9MB in the beginning and 155.7MB in the end (delta: -67.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11925.07ms. Allocated memory was 237.0MB in the beginning and 413.1MB in the end (delta: 176.2MB). Free memory was 155.7MB in the beginning and 159.0MB in the end (delta: -3.2MB). Peak memory consumption was 172.9MB. Max. memory is 16.1GB. * Witness Printer took 129.87ms. Allocated memory is still 413.1MB. Free memory was 159.0MB in the beginning and 144.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 176]: 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, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1750 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1750 mSDsluCounter, 1943 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 932 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6810 IncrementalHoareTripleChecker+Invalid, 7742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 932 mSolverCounterUnsat, 1879 mSDtfsCounter, 6810 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1483 GetRequests, 1462 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4097occurred in iteration=12, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1428 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 6177 NumberOfCodeBlocks, 6177 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 6162 ConstructedInterpolants, 0 QuantifiedInterpolants, 14219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1781 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 11050/11270 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: 890]: Loop Invariant Derived loop invariant: ((((((a24 == 1) && (7 == a21)) || ((a15 <= 8) && (a21 <= 6))) || ((9 <= a21) && (a15 <= 8))) || ((a24 == 1) && (5 != a15))) || ((a15 <= 8) && (0 <= ((long long) a12 + 42)))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:32:07,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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