./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label02.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/Problem02_label02.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 85831c87ee726a5ebef35050faa06bdc8a4bd6c3085f34f2763b92257fb80baa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:34:31,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:34:31,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:34:31,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:34:31,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:34:31,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:34:31,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:34:31,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:34:31,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:34:31,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:34:31,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:34:31,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:34:31,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:34:31,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:34:31,870 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:34:31,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:34:31,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:34:31,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:34:31,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:34:31,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:34:31,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:34:31,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:34:31,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:34:31,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:34:31,873 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:34:31,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:34:31,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:34:31,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:34:31,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:34:31,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:34:31,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:34:31,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:34:31,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:34:31,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:34:31,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:34:31,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:34:31,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:34:31,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:34:31,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:34:31,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:34:31,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:34:31,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:34:31,878 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 -> 85831c87ee726a5ebef35050faa06bdc8a4bd6c3085f34f2763b92257fb80baa [2024-10-10 22:34:32,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:34:32,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:34:32,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:34:32,112 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:34:32,112 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:34:32,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label02.c [2024-10-10 22:34:33,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:34:33,656 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:34:33,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label02.c [2024-10-10 22:34:33,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ba681d591/d939695f5c824ba1a2f138d109ea6bb0/FLAGa04ab481b [2024-10-10 22:34:33,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ba681d591/d939695f5c824ba1a2f138d109ea6bb0 [2024-10-10 22:34:33,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:34:33,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:34:33,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:34:33,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:34:33,699 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:34:33,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:34:33" (1/1) ... [2024-10-10 22:34:33,701 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36cf3a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:33, skipping insertion in model container [2024-10-10 22:34:33,701 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:34:33" (1/1) ... [2024-10-10 22:34:33,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:34:33,984 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label02.c[15989,16002] [2024-10-10 22:34:34,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:34:34,016 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:34:34,063 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label02.c[15989,16002] [2024-10-10 22:34:34,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:34:34,096 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:34:34,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34 WrapperNode [2024-10-10 22:34:34,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:34:34,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:34:34,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:34:34,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:34:34,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,163 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-10 22:34:34,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:34:34,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:34:34,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:34:34,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:34:34,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,195 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 22:34:34,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:34:34,241 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:34:34,241 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:34:34,241 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:34:34,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (1/1) ... [2024-10-10 22:34:34,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:34:34,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:34:34,278 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 22:34:34,280 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 22:34:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:34:34,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:34:34,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:34:34,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:34:34,389 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:34:34,391 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:34:35,152 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 22:34:35,153 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:34:35,198 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:34:35,198 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:34:35,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:35 BoogieIcfgContainer [2024-10-10 22:34:35,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:34:35,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:34:35,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:34:35,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:34:35,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:34:33" (1/3) ... [2024-10-10 22:34:35,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384e61dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:34:35, skipping insertion in model container [2024-10-10 22:34:35,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:34:34" (2/3) ... [2024-10-10 22:34:35,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384e61dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:34:35, skipping insertion in model container [2024-10-10 22:34:35,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:35" (3/3) ... [2024-10-10 22:34:35,206 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label02.c [2024-10-10 22:34:35,219 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:34:35,220 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:34:35,271 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:34:35,276 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;@7b98ebdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:34:35,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:34:35,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:35,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-10 22:34:35,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:35,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:35,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:35,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:35,292 INFO L85 PathProgramCache]: Analyzing trace with hash 545144072, now seen corresponding path program 1 times [2024-10-10 22:34:35,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:35,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660608818] [2024-10-10 22:34:35,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:35,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:35,586 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 22:34:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:35,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660608818] [2024-10-10 22:34:35,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660608818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:35,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:35,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795855560] [2024-10-10 22:34:35,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:35,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:34:35,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:35,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:34:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:34:35,618 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 22:34:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:35,652 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-10 22:34:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:34:35,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-10 22:34:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:35,663 INFO L225 Difference]: With dead ends: 329 [2024-10-10 22:34:35,663 INFO L226 Difference]: Without dead ends: 163 [2024-10-10 22:34:35,666 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 22:34:35,669 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:35,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:34:35,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-10 22:34:35,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-10 22:34:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:35,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-10 22:34:35,712 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 92 [2024-10-10 22:34:35,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:35,712 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-10 22:34:35,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 46.0) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 22:34:35,713 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-10 22:34:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-10 22:34:35,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:35,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:35,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:34:35,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:35,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1779609507, now seen corresponding path program 1 times [2024-10-10 22:34:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693648794] [2024-10-10 22:34:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:35,931 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 22:34:35,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:35,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693648794] [2024-10-10 22:34:35,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693648794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:35,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:35,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:35,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069259618] [2024-10-10 22:34:35,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:35,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:35,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:35,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:35,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:35,938 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 22:34:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:36,443 INFO L93 Difference]: Finished difference Result 479 states and 731 transitions. [2024-10-10 22:34:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:36,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-10 22:34:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:36,446 INFO L225 Difference]: With dead ends: 479 [2024-10-10 22:34:36,446 INFO L226 Difference]: Without dead ends: 317 [2024-10-10 22:34:36,447 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 22:34:36,448 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 113 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:36,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 72 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:34:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-10 22:34:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-10 22:34:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 1.4746835443037976) internal successors, (466), 316 states have internal predecessors, (466), 0 states have call successors, (0), 0 states 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 22:34:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 466 transitions. [2024-10-10 22:34:36,482 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 466 transitions. Word has length 92 [2024-10-10 22:34:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:36,482 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 466 transitions. [2024-10-10 22:34:36,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states 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 22:34:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 466 transitions. [2024-10-10 22:34:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-10 22:34:36,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:36,489 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:36,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:34:36,490 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:36,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash 158869528, now seen corresponding path program 1 times [2024-10-10 22:34:36,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:36,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710108840] [2024-10-10 22:34:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:36,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:36,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:36,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710108840] [2024-10-10 22:34:36,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710108840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:36,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:36,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:36,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125862875] [2024-10-10 22:34:36,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:36,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:36,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:36,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:36,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:36,708 INFO L87 Difference]: Start difference. First operand 317 states and 466 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 22:34:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:37,118 INFO L93 Difference]: Finished difference Result 918 states and 1356 transitions. [2024-10-10 22:34:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:37,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-10 22:34:37,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:37,121 INFO L225 Difference]: With dead ends: 918 [2024-10-10 22:34:37,121 INFO L226 Difference]: Without dead ends: 602 [2024-10-10 22:34:37,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:37,126 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 143 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:37,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 120 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-10-10 22:34:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2024-10-10 22:34:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.2921535893155258) internal successors, (774), 599 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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 22:34:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 774 transitions. [2024-10-10 22:34:37,150 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 774 transitions. Word has length 96 [2024-10-10 22:34:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:37,150 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 774 transitions. [2024-10-10 22:34:37,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 22:34:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 774 transitions. [2024-10-10 22:34:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-10 22:34:37,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:37,154 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:37,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:34:37,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:37,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:37,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1102449117, now seen corresponding path program 1 times [2024-10-10 22:34:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931791186] [2024-10-10 22:34:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:37,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:37,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:37,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931791186] [2024-10-10 22:34:37,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931791186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:37,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:37,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:37,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617254456] [2024-10-10 22:34:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:37,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:37,329 INFO L87 Difference]: Start difference. First operand 600 states and 774 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:37,707 INFO L93 Difference]: Finished difference Result 1485 states and 1973 transitions. [2024-10-10 22:34:37,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-10-10 22:34:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:37,710 INFO L225 Difference]: With dead ends: 1485 [2024-10-10 22:34:37,710 INFO L226 Difference]: Without dead ends: 886 [2024-10-10 22:34:37,711 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 22:34:37,712 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 144 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:37,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 252 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-10-10 22:34:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2024-10-10 22:34:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 1.232163080407701) internal successors, (1088), 883 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states 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 22:34:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1088 transitions. [2024-10-10 22:34:37,726 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1088 transitions. Word has length 101 [2024-10-10 22:34:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:37,729 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1088 transitions. [2024-10-10 22:34:37,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1088 transitions. [2024-10-10 22:34:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-10 22:34:37,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:37,734 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:37,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:34:37,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:37,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:37,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1681898919, now seen corresponding path program 1 times [2024-10-10 22:34:37,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:37,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623955637] [2024-10-10 22:34:37,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:37,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:37,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623955637] [2024-10-10 22:34:37,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623955637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:37,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:37,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724747279] [2024-10-10 22:34:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:37,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:37,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:37,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:37,808 INFO L87 Difference]: Start difference. First operand 884 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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 22:34:38,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:38,180 INFO L93 Difference]: Finished difference Result 2468 states and 3052 transitions. [2024-10-10 22:34:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:38,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-10-10 22:34:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:38,185 INFO L225 Difference]: With dead ends: 2468 [2024-10-10 22:34:38,185 INFO L226 Difference]: Without dead ends: 1585 [2024-10-10 22:34:38,186 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 22:34:38,188 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 190 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:38,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 77 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:34:38,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-10-10 22:34:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2024-10-10 22:34:38,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1584 states have (on average 1.1957070707070707) internal successors, (1894), 1584 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states 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 22:34:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 1894 transitions. [2024-10-10 22:34:38,214 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 1894 transitions. Word has length 102 [2024-10-10 22:34:38,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:38,215 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 1894 transitions. [2024-10-10 22:34:38,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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 22:34:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 1894 transitions. [2024-10-10 22:34:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-10 22:34:38,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:38,218 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:38,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:34:38,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:38,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:38,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1928039207, now seen corresponding path program 1 times [2024-10-10 22:34:38,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:38,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468532724] [2024-10-10 22:34:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:38,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:38,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468532724] [2024-10-10 22:34:38,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468532724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:38,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:38,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292875703] [2024-10-10 22:34:38,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:38,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:38,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:38,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:38,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:38,325 INFO L87 Difference]: Start difference. First operand 1585 states and 1894 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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 22:34:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:38,697 INFO L93 Difference]: Finished difference Result 3730 states and 4455 transitions. [2024-10-10 22:34:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:38,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-10 22:34:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:38,702 INFO L225 Difference]: With dead ends: 3730 [2024-10-10 22:34:38,703 INFO L226 Difference]: Without dead ends: 2146 [2024-10-10 22:34:38,704 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 22:34:38,705 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 143 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:38,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 267 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:34:38,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2024-10-10 22:34:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2145. [2024-10-10 22:34:38,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 1.15625) internal successors, (2479), 2144 states have internal predecessors, (2479), 0 states have call successors, (0), 0 states 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 22:34:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2479 transitions. [2024-10-10 22:34:38,736 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2479 transitions. Word has length 105 [2024-10-10 22:34:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:38,737 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 2479 transitions. [2024-10-10 22:34:38,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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 22:34:38,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2479 transitions. [2024-10-10 22:34:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-10 22:34:38,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:38,740 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:38,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:34:38,740 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:38,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:38,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1452645866, now seen corresponding path program 1 times [2024-10-10 22:34:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:38,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975716900] [2024-10-10 22:34:38,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:38,868 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:38,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:38,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975716900] [2024-10-10 22:34:38,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975716900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:38,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:38,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:38,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700606841] [2024-10-10 22:34:38,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:38,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:38,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:38,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:38,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:38,870 INFO L87 Difference]: Start difference. First operand 2145 states and 2479 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:39,240 INFO L93 Difference]: Finished difference Result 4290 states and 4959 transitions. [2024-10-10 22:34:39,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:39,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-10-10 22:34:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:39,246 INFO L225 Difference]: With dead ends: 4290 [2024-10-10 22:34:39,247 INFO L226 Difference]: Without dead ends: 2146 [2024-10-10 22:34:39,249 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 22:34:39,250 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:39,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 50 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:34:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2024-10-10 22:34:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2145. [2024-10-10 22:34:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 1.1305970149253732) internal successors, (2424), 2144 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states 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 22:34:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2424 transitions. [2024-10-10 22:34:39,278 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2424 transitions. Word has length 121 [2024-10-10 22:34:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:39,278 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 2424 transitions. [2024-10-10 22:34:39,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2424 transitions. [2024-10-10 22:34:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-10 22:34:39,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:39,280 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:39,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:34:39,281 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:39,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:39,281 INFO L85 PathProgramCache]: Analyzing trace with hash -435398048, now seen corresponding path program 1 times [2024-10-10 22:34:39,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:39,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635104345] [2024-10-10 22:34:39,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:39,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:34:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:39,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635104345] [2024-10-10 22:34:39,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635104345] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:34:39,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906640207] [2024-10-10 22:34:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:39,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:39,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:34:39,523 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 22:34:39,527 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 22:34:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:39,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:34:39,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:34:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-10 22:34:39,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:34:39,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906640207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:39,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:34:39,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-10 22:34:39,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602110023] [2024-10-10 22:34:39,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:39,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:39,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:39,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:39,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:34:39,763 INFO L87 Difference]: Start difference. First operand 2145 states and 2424 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 22:34:40,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:40,147 INFO L93 Difference]: Finished difference Result 5407 states and 6177 transitions. [2024-10-10 22:34:40,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:40,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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 125 [2024-10-10 22:34:40,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:40,157 INFO L225 Difference]: With dead ends: 5407 [2024-10-10 22:34:40,157 INFO L226 Difference]: Without dead ends: 3263 [2024-10-10 22:34:40,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:34:40,162 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 120 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:40,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 46 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:34:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3263 states. [2024-10-10 22:34:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3263 to 2422. [2024-10-10 22:34:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2422 states, 2421 states have (on average 1.1581990912845932) internal successors, (2804), 2421 states have internal predecessors, (2804), 0 states have call successors, (0), 0 states 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 22:34:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 2804 transitions. [2024-10-10 22:34:40,198 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 2804 transitions. Word has length 125 [2024-10-10 22:34:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:40,199 INFO L471 AbstractCegarLoop]: Abstraction has 2422 states and 2804 transitions. [2024-10-10 22:34:40,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states 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 22:34:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 2804 transitions. [2024-10-10 22:34:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-10 22:34:40,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:40,203 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:34:40,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 22:34:40,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:40,408 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:40,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:40,409 INFO L85 PathProgramCache]: Analyzing trace with hash -224540205, now seen corresponding path program 1 times [2024-10-10 22:34:40,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:40,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760486645] [2024-10-10 22:34:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:40,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-10 22:34:40,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:40,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760486645] [2024-10-10 22:34:40,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760486645] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:34:40,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089099135] [2024-10-10 22:34:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:40,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:40,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:34:40,668 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 22:34:40,669 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 22:34:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:40,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:34:40,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:34:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-10 22:34:40,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:34:40,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089099135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:40,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:34:40,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:34:40,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957453477] [2024-10-10 22:34:40,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:40,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:40,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:34:40,872 INFO L87 Difference]: Start difference. First operand 2422 states and 2804 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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 22:34:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:41,234 INFO L93 Difference]: Finished difference Result 4843 states and 5607 transitions. [2024-10-10 22:34:41,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:41,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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 151 [2024-10-10 22:34:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:41,243 INFO L225 Difference]: With dead ends: 4843 [2024-10-10 22:34:41,243 INFO L226 Difference]: Without dead ends: 2422 [2024-10-10 22:34:41,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:34:41,245 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 70 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:41,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 244 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:34:41,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2024-10-10 22:34:41,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2282. [2024-10-10 22:34:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2282 states, 2281 states have (on average 1.1030249890398949) internal successors, (2516), 2281 states have internal predecessors, (2516), 0 states have call successors, (0), 0 states 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 22:34:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 2516 transitions. [2024-10-10 22:34:41,270 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 2516 transitions. Word has length 151 [2024-10-10 22:34:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:41,271 INFO L471 AbstractCegarLoop]: Abstraction has 2282 states and 2516 transitions. [2024-10-10 22:34:41,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 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 22:34:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 2516 transitions. [2024-10-10 22:34:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-10 22:34:41,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:41,274 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:41,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 22:34:41,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:34:41,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:41,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:41,476 INFO L85 PathProgramCache]: Analyzing trace with hash -257477119, now seen corresponding path program 1 times [2024-10-10 22:34:41,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:41,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10536983] [2024-10-10 22:34:41,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:41,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:34:41,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:41,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10536983] [2024-10-10 22:34:41,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10536983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:41,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:41,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:34:41,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715220272] [2024-10-10 22:34:41,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:41,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:41,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:41,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:41,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:41,567 INFO L87 Difference]: Start difference. First operand 2282 states and 2516 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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 22:34:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:41,910 INFO L93 Difference]: Finished difference Result 4993 states and 5578 transitions. [2024-10-10 22:34:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:41,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 202 [2024-10-10 22:34:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:41,917 INFO L225 Difference]: With dead ends: 4993 [2024-10-10 22:34:41,918 INFO L226 Difference]: Without dead ends: 2712 [2024-10-10 22:34:41,920 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 22:34:41,920 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 90 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:41,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 252 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:34:41,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2024-10-10 22:34:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 2704. [2024-10-10 22:34:41,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.1091379948205697) internal successors, (2998), 2703 states have internal predecessors, (2998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:34:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 2998 transitions. [2024-10-10 22:34:41,949 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 2998 transitions. Word has length 202 [2024-10-10 22:34:41,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:41,949 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 2998 transitions. [2024-10-10 22:34:41,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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 22:34:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 2998 transitions. [2024-10-10 22:34:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-10-10 22:34:41,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:34:41,953 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:34:41,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:34:41,953 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:34:41,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:34:41,953 INFO L85 PathProgramCache]: Analyzing trace with hash -601226757, now seen corresponding path program 1 times [2024-10-10 22:34:41,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:34:41,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465113737] [2024-10-10 22:34:41,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:34:41,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:34:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:34:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-10-10 22:34:42,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:34:42,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465113737] [2024-10-10 22:34:42,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465113737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:34:42,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:34:42,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:34:42,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221529898] [2024-10-10 22:34:42,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:34:42,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:34:42,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:34:42,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:34:42,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:34:42,091 INFO L87 Difference]: Start difference. First operand 2704 states and 2998 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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 22:34:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:34:42,270 INFO L93 Difference]: Finished difference Result 4828 states and 5357 transitions. [2024-10-10 22:34:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:34:42,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 227 [2024-10-10 22:34:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:34:42,270 INFO L225 Difference]: With dead ends: 4828 [2024-10-10 22:34:42,270 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 22:34:42,273 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 22:34:42,273 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:34:42,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 16 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:34:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 22:34:42,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 22:34:42,274 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 22:34:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 22:34:42,274 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2024-10-10 22:34:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:34:42,274 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 22:34:42,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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 22:34:42,274 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 22:34:42,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 22:34:42,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:34:42,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:34:42,279 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:34:42,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 22:34:42,437 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:34:42,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:34:42 BoogieIcfgContainer [2024-10-10 22:34:42,456 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:34:42,457 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:34:42,457 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:34:42,457 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:34:42,457 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:34:35" (3/4) ... [2024-10-10 22:34:42,459 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 22:34:42,471 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 22:34:42,474 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 22:34:42,475 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 22:34:42,475 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 22:34:42,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:34:42,594 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 22:34:42,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:34:42,594 INFO L158 Benchmark]: Toolchain (without parser) took 8901.78ms. Allocated memory was 161.5MB in the beginning and 337.6MB in the end (delta: 176.2MB). Free memory was 106.5MB in the beginning and 182.1MB in the end (delta: -75.6MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. [2024-10-10 22:34:42,594 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 161.5MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:34:42,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.74ms. Allocated memory is still 161.5MB. Free memory was 105.9MB in the beginning and 77.9MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-10 22:34:42,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.01ms. Allocated memory is still 161.5MB. Free memory was 77.9MB in the beginning and 72.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:34:42,595 INFO L158 Benchmark]: Boogie Preprocessor took 75.89ms. Allocated memory is still 161.5MB. Free memory was 72.3MB in the beginning and 66.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:34:42,595 INFO L158 Benchmark]: RCFGBuilder took 959.30ms. Allocated memory is still 161.5MB. Free memory was 66.7MB in the beginning and 63.1MB in the end (delta: 3.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-10 22:34:42,595 INFO L158 Benchmark]: TraceAbstraction took 7255.12ms. Allocated memory was 161.5MB in the beginning and 337.6MB in the end (delta: 176.2MB). Free memory was 62.3MB in the beginning and 194.7MB in the end (delta: -132.4MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-10-10 22:34:42,595 INFO L158 Benchmark]: Witness Printer took 136.91ms. Allocated memory is still 337.6MB. Free memory was 194.7MB in the beginning and 182.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 22:34:42,596 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.14ms. Allocated memory is still 161.5MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.74ms. Allocated memory is still 161.5MB. Free memory was 105.9MB in the beginning and 77.9MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.01ms. Allocated memory is still 161.5MB. Free memory was 77.9MB in the beginning and 72.3MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.89ms. Allocated memory is still 161.5MB. Free memory was 72.3MB in the beginning and 66.7MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 959.30ms. Allocated memory is still 161.5MB. Free memory was 66.7MB in the beginning and 63.1MB in the end (delta: 3.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7255.12ms. Allocated memory was 161.5MB in the beginning and 337.6MB in the end (delta: 176.2MB). Free memory was 62.3MB in the beginning and 194.7MB in the end (delta: -132.4MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * Witness Printer took 136.91ms. Allocated memory is still 337.6MB. Free memory was 194.7MB in the beginning and 182.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 461]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1344 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1344 mSDsluCounter, 1644 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 617 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3512 IncrementalHoareTripleChecker+Invalid, 4129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 617 mSolverCounterUnsat, 1499 mSDtfsCounter, 3512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2704occurred in iteration=10, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 995 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1690 NumberOfCodeBlocks, 1690 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1677 ConstructedInterpolants, 0 QuantifiedInterpolants, 3637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 544 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 698/714 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((((((((a25 == 1) && (a11 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a28 <= 7)) || ((((a28 == 10) && (a17 <= 8)) && (a25 != 1)) && (a19 == 1))) || ((((a11 == 0) && (a17 <= 8)) && (a28 <= 10)) && (a19 == 1))) || (((a17 == 8) && (a28 <= 10)) && (a19 == 1))) || (((a17 == 8) && (a25 == 1)) && (a19 == 1))) || (((a17 <= 8) && (a28 <= 10)) && (a19 <= 0))) || ((((a25 == 1) && (a11 == 0)) && (a17 <= 8)) && (a19 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-10 22:34:42,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE