./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/Problem10_label56.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/Problem10_label56.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 02a46d4d5c96ca48bb00b0ccf13d03f94a934872e425472af0469d5ca6049200 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:17:07,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:17:07,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:17:07,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:17:07,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:17:08,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:17:08,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:17:08,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:17:08,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:17:08,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:17:08,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:17:08,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:17:08,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:17:08,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:17:08,012 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:17:08,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:17:08,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:17:08,013 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:17:08,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:17:08,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:17:08,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:17:08,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:17:08,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:17:08,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:17:08,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:17:08,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:17:08,017 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:17:08,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:17:08,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:17:08,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:17:08,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:17:08,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:17:08,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:17:08,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:17:08,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:17:08,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:17:08,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:17:08,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:17:08,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:17:08,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:17:08,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:17:08,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:17:08,023 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 -> 02a46d4d5c96ca48bb00b0ccf13d03f94a934872e425472af0469d5ca6049200 [2024-10-10 23:17:08,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:17:08,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:17:08,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:17:08,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:17:08,247 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:17:08,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label56.c [2024-10-10 23:17:09,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:17:09,932 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:17:09,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label56.c [2024-10-10 23:17:09,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/24fa0cdbf/ce9970d65e0f4c8a88bde54519b7fe36/FLAG1da1bc444 [2024-10-10 23:17:09,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/24fa0cdbf/ce9970d65e0f4c8a88bde54519b7fe36 [2024-10-10 23:17:09,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:17:09,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:17:09,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:17:09,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:17:09,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:17:09,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:17:09" (1/1) ... [2024-10-10 23:17:09,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73f59f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:09, skipping insertion in model container [2024-10-10 23:17:09,975 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:17:09" (1/1) ... [2024-10-10 23:17:10,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:17:10,194 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/Problem10_label56.c[2832,2845] [2024-10-10 23:17:10,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:17:10,316 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:17:10,332 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/Problem10_label56.c[2832,2845] [2024-10-10 23:17:10,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:17:10,408 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:17:10,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10 WrapperNode [2024-10-10 23:17:10,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:17:10,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:17:10,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:17:10,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:17:10,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,486 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-10 23:17:10,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:17:10,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:17:10,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:17:10,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:17:10,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,537 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:17:10,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:17:10,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:17:10,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:17:10,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:17:10,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (1/1) ... [2024-10-10 23:17:10,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:17:10,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:10,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:17:10,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:17:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:17:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:17:10,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:17:10,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:17:10,744 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:17:10,746 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:17:11,726 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 23:17:11,727 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:17:11,773 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:17:11,775 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:17:11,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:17:11 BoogieIcfgContainer [2024-10-10 23:17:11,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:17:11,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:17:11,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:17:11,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:17:11,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:17:09" (1/3) ... [2024-10-10 23:17:11,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5297ec81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:17:11, skipping insertion in model container [2024-10-10 23:17:11,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:17:10" (2/3) ... [2024-10-10 23:17:11,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5297ec81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:17:11, skipping insertion in model container [2024-10-10 23:17:11,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:17:11" (3/3) ... [2024-10-10 23:17:11,783 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label56.c [2024-10-10 23:17:11,801 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:17:11,801 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:17:11,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:17:11,879 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;@7d9c715e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:17:11,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:17:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 23:17:11,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:11,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:11,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:11,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:11,900 INFO L85 PathProgramCache]: Analyzing trace with hash 178922944, now seen corresponding path program 1 times [2024-10-10 23:17:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:11,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273529896] [2024-10-10 23:17:11,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:11,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:12,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:12,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:12,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273529896] [2024-10-10 23:17:12,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273529896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:12,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:12,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12135773] [2024-10-10 23:17:12,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:12,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:17:12,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:12,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:17:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:17:12,086 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:12,121 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-10 23:17:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:17:12,125 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-10 23:17:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:12,132 INFO L225 Difference]: With dead ends: 287 [2024-10-10 23:17:12,133 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 23:17:12,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:17:12,139 INFO L432 NwaCegarLoop]: 217 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, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:12,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:17:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 23:17:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 23:17:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-10 23:17:12,188 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 22 [2024-10-10 23:17:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:12,189 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-10 23:17:12,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-10 23:17:12,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-10 23:17:12,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:12,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:12,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:17:12,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:12,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:12,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1517123994, now seen corresponding path program 1 times [2024-10-10 23:17:12,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:12,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160939743] [2024-10-10 23:17:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:12,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:12,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:12,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160939743] [2024-10-10 23:17:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160939743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:12,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:12,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:12,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715662225] [2024-10-10 23:17:12,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:12,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:12,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:12,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:12,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:12,339 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:12,833 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2024-10-10 23:17:12,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:12,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-10 23:17:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:12,836 INFO L225 Difference]: With dead ends: 422 [2024-10-10 23:17:12,836 INFO L226 Difference]: Without dead ends: 281 [2024-10-10 23:17:12,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:12,837 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 124 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:12,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 65 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:17:12,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-10 23:17:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-10 23:17:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 280 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 376 transitions. [2024-10-10 23:17:12,852 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 376 transitions. Word has length 22 [2024-10-10 23:17:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:12,853 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 376 transitions. [2024-10-10 23:17:12,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 376 transitions. [2024-10-10 23:17:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-10 23:17:12,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:12,859 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:17:12,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:17:12,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:12,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:12,860 INFO L85 PathProgramCache]: Analyzing trace with hash -951428231, now seen corresponding path program 1 times [2024-10-10 23:17:12,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:12,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190400378] [2024-10-10 23:17:12,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:13,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:13,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190400378] [2024-10-10 23:17:13,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190400378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:13,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:13,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:13,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465862368] [2024-10-10 23:17:13,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:13,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:13,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:13,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:13,121 INFO L87 Difference]: Start difference. First operand 281 states and 376 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:13,567 INFO L93 Difference]: Finished difference Result 700 states and 966 transitions. [2024-10-10 23:17:13,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:13,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2024-10-10 23:17:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:13,570 INFO L225 Difference]: With dead ends: 700 [2024-10-10 23:17:13,570 INFO L226 Difference]: Without dead ends: 420 [2024-10-10 23:17:13,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:13,576 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:13,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 19 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-10 23:17:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-10 23:17:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.3842482100238664) internal successors, (580), 419 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2024-10-10 23:17:13,603 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 580 transitions. Word has length 88 [2024-10-10 23:17:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:13,604 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 580 transitions. [2024-10-10 23:17:13,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 580 transitions. [2024-10-10 23:17:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-10 23:17:13,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:13,605 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 23:17:13,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:17:13,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:13,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash -455156137, now seen corresponding path program 1 times [2024-10-10 23:17:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:13,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325877687] [2024-10-10 23:17:13,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:13,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:13,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:13,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325877687] [2024-10-10 23:17:13,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325877687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:13,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:13,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:13,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264847845] [2024-10-10 23:17:13,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:13,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:13,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:13,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:13,821 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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 23:17:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:14,212 INFO L93 Difference]: Finished difference Result 978 states and 1318 transitions. [2024-10-10 23:17:14,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:14,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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 23:17:14,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:14,215 INFO L225 Difference]: With dead ends: 978 [2024-10-10 23:17:14,215 INFO L226 Difference]: Without dead ends: 559 [2024-10-10 23:17:14,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:14,216 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 58 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:14,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 75 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:14,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-10 23:17:14,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-10 23:17:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3064516129032258) internal successors, (729), 558 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 729 transitions. [2024-10-10 23:17:14,232 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 729 transitions. Word has length 105 [2024-10-10 23:17:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:14,233 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 729 transitions. [2024-10-10 23:17:14,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 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 23:17:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 729 transitions. [2024-10-10 23:17:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-10 23:17:14,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:14,238 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:14,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:17:14,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:14,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash -273897749, now seen corresponding path program 1 times [2024-10-10 23:17:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:14,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109412998] [2024-10-10 23:17:14,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:14,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:14,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:14,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109412998] [2024-10-10 23:17:14,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109412998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:14,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:14,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:17:14,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740915537] [2024-10-10 23:17:14,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:14,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:14,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:14,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:14,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:14,363 INFO L87 Difference]: Start difference. First operand 559 states and 729 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:14,762 INFO L93 Difference]: Finished difference Result 1256 states and 1671 transitions. [2024-10-10 23:17:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:14,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-10 23:17:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:14,766 INFO L225 Difference]: With dead ends: 1256 [2024-10-10 23:17:14,767 INFO L226 Difference]: Without dead ends: 837 [2024-10-10 23:17:14,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:14,770 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:14,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 32 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-10 23:17:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2024-10-10 23:17:14,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2284688995215312) internal successors, (1027), 836 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1027 transitions. [2024-10-10 23:17:14,790 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1027 transitions. Word has length 113 [2024-10-10 23:17:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:14,790 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1027 transitions. [2024-10-10 23:17:14,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1027 transitions. [2024-10-10 23:17:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-10 23:17:14,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:14,793 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-10-10 23:17:14,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:17:14,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:14,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:14,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1799416420, now seen corresponding path program 1 times [2024-10-10 23:17:14,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:14,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872793250] [2024-10-10 23:17:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-10 23:17:15,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872793250] [2024-10-10 23:17:15,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872793250] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:17:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038625055] [2024-10-10 23:17:15,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:15,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:15,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:15,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:17:15,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:17:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:15,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:17:15,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:17:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-10 23:17:15,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:17:15,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038625055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:15,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:17:15,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:17:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083387485] [2024-10-10 23:17:15,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:15,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:15,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:15,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:15,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:17:15,436 INFO L87 Difference]: Start difference. First operand 837 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:15,821 INFO L93 Difference]: Finished difference Result 1256 states and 1546 transitions. [2024-10-10 23:17:15,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:15,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2024-10-10 23:17:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:15,826 INFO L225 Difference]: With dead ends: 1256 [2024-10-10 23:17:15,826 INFO L226 Difference]: Without dead ends: 1254 [2024-10-10 23:17:15,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:17:15,827 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 96 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:15,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 9 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-10 23:17:15,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 976. [2024-10-10 23:17:15,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.2471794871794872) internal successors, (1216), 975 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1216 transitions. [2024-10-10 23:17:15,841 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1216 transitions. Word has length 171 [2024-10-10 23:17:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:15,842 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1216 transitions. [2024-10-10 23:17:15,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1216 transitions. [2024-10-10 23:17:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-10 23:17:15,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:15,845 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:15,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:17:16,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:16,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:16,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1396425077, now seen corresponding path program 1 times [2024-10-10 23:17:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288693667] [2024-10-10 23:17:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:16,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:16,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:16,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288693667] [2024-10-10 23:17:16,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288693667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:16,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:16,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:17:16,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6705257] [2024-10-10 23:17:16,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:16,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:16,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:16,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:16,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:16,233 INFO L87 Difference]: Start difference. First operand 976 states and 1216 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:16,585 INFO L93 Difference]: Finished difference Result 1951 states and 2466 transitions. [2024-10-10 23:17:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:16,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2024-10-10 23:17:16,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:16,589 INFO L225 Difference]: With dead ends: 1951 [2024-10-10 23:17:16,589 INFO L226 Difference]: Without dead ends: 1115 [2024-10-10 23:17:16,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:17:16,591 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:16,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 212 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:17:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-10 23:17:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-10 23:17:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2253141831238779) internal successors, (1365), 1114 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1365 transitions. [2024-10-10 23:17:16,609 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1365 transitions. Word has length 225 [2024-10-10 23:17:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:16,610 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1365 transitions. [2024-10-10 23:17:16,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1365 transitions. [2024-10-10 23:17:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-10-10 23:17:16,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:16,613 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:16,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:17:16,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:16,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash -825600127, now seen corresponding path program 1 times [2024-10-10 23:17:16,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:16,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756883020] [2024-10-10 23:17:16,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:16,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:16,985 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:16,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:16,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756883020] [2024-10-10 23:17:16,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756883020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:16,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:16,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:17:16,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816397286] [2024-10-10 23:17:16,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:16,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:17:16,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:16,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:17:16,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:17:16,988 INFO L87 Difference]: Start difference. First operand 1115 states and 1365 transitions. Second operand has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:17,429 INFO L93 Difference]: Finished difference Result 2145 states and 2640 transitions. [2024-10-10 23:17:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:17:17,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2024-10-10 23:17:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:17,432 INFO L225 Difference]: With dead ends: 2145 [2024-10-10 23:17:17,433 INFO L226 Difference]: Without dead ends: 1115 [2024-10-10 23:17:17,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:17:17,435 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:17,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 18 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:17:17,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2024-10-10 23:17:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2024-10-10 23:17:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2190305206463197) internal successors, (1358), 1114 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1358 transitions. [2024-10-10 23:17:17,448 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1358 transitions. Word has length 234 [2024-10-10 23:17:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:17,448 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1358 transitions. [2024-10-10 23:17:17,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.42857142857143) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1358 transitions. [2024-10-10 23:17:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-10 23:17:17,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:17,451 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:17:17,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:17:17,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:17,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2049059289, now seen corresponding path program 1 times [2024-10-10 23:17:17,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:17,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538221057] [2024-10-10 23:17:17,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:17,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 26 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:18,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:18,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538221057] [2024-10-10 23:17:18,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538221057] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:17:18,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458547444] [2024-10-10 23:17:18,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:18,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:18,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:18,138 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:17:18,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:17:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:18,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 23:17:18,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:17:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 21 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:17:18,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:17:24,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div c_~a1~0 5))) (let ((.cse2 (forall ((v_~a1~0_465 Int)) (or (< (+ 505228 .cse1) v_~a1~0_465) (< (div (* v_~a1~0_465 9) 10) 545151))))) (and (forall ((v_~a1~0_465 Int)) (let ((.cse0 (+ 505229 .cse1))) (or (< .cse0 v_~a1~0_465) (< (div (* v_~a1~0_465 9) 10) 545151) (= v_~a1~0_465 .cse0)))) (or (< c_~a1~0 0) .cse2) (or .cse2 (not (= (mod c_~a1~0 5) 0)))))) is different from false [2024-10-10 23:17:26,798 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 130 not checked. [2024-10-10 23:17:26,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458547444] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:17:26,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:17:26,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-10-10 23:17:26,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754920961] [2024-10-10 23:17:26,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:17:26,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 23:17:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:26,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 23:17:26,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=56, Unknown=1, NotChecked=16, Total=110 [2024-10-10 23:17:26,801 INFO L87 Difference]: Start difference. First operand 1115 states and 1358 transitions. Second operand has 11 states, 11 states have (on average 73.45454545454545) internal successors, (808), 10 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:28,462 INFO L93 Difference]: Finished difference Result 4191 states and 5183 transitions. [2024-10-10 23:17:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 23:17:28,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 73.45454545454545) internal successors, (808), 10 states have internal predecessors, (808), 0 states have call successors, (0), 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 270 [2024-10-10 23:17:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:28,471 INFO L225 Difference]: With dead ends: 4191 [2024-10-10 23:17:28,471 INFO L226 Difference]: Without dead ends: 3200 [2024-10-10 23:17:28,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 533 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=62, Invalid=97, Unknown=1, NotChecked=22, Total=182 [2024-10-10 23:17:28,473 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 292 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 2497 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 795 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:28,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 57 Invalid, 3563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2497 Invalid, 0 Unknown, 795 Unchecked, 1.5s Time] [2024-10-10 23:17:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2024-10-10 23:17:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 1949. [2024-10-10 23:17:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1948 states have (on average 1.212012320328542) internal successors, (2361), 1948 states have internal predecessors, (2361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2361 transitions. [2024-10-10 23:17:28,515 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2361 transitions. Word has length 270 [2024-10-10 23:17:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:28,516 INFO L471 AbstractCegarLoop]: Abstraction has 1949 states and 2361 transitions. [2024-10-10 23:17:28,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 73.45454545454545) internal successors, (808), 10 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2361 transitions. [2024-10-10 23:17:28,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-10-10 23:17:28,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:28,519 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:28,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:17:28,720 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 23:17:28,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:28,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:28,721 INFO L85 PathProgramCache]: Analyzing trace with hash -525309130, now seen corresponding path program 1 times [2024-10-10 23:17:28,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:28,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954827896] [2024-10-10 23:17:28,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:28,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-10 23:17:28,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954827896] [2024-10-10 23:17:28,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954827896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:17:28,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:17:28,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:17:28,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397671348] [2024-10-10 23:17:28,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:28,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:17:28,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:28,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:17:28,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:17:28,983 INFO L87 Difference]: Start difference. First operand 1949 states and 2361 transitions. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:29,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:29,467 INFO L93 Difference]: Finished difference Result 3908 states and 4748 transitions. [2024-10-10 23:17:29,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:17:29,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 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 311 [2024-10-10 23:17:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:29,472 INFO L225 Difference]: With dead ends: 3908 [2024-10-10 23:17:29,472 INFO L226 Difference]: Without dead ends: 2088 [2024-10-10 23:17:29,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:17:29,474 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:29,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 17 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:17:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2024-10-10 23:17:29,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2024-10-10 23:17:29,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 1.1677048394825107) internal successors, (2437), 2087 states have internal predecessors, (2437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2437 transitions. [2024-10-10 23:17:29,503 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2437 transitions. Word has length 311 [2024-10-10 23:17:29,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:29,503 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2437 transitions. [2024-10-10 23:17:29,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:29,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2437 transitions. [2024-10-10 23:17:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-10-10 23:17:29,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:17:29,509 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:29,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:17:29,509 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:17:29,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:17:29,509 INFO L85 PathProgramCache]: Analyzing trace with hash 424025932, now seen corresponding path program 1 times [2024-10-10 23:17:29,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:17:29,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572321398] [2024-10-10 23:17:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:29,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:17:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 219 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-10 23:17:29,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:17:29,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572321398] [2024-10-10 23:17:29,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572321398] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:17:29,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343814594] [2024-10-10 23:17:29,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:17:29,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:29,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:17:29,890 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:17:29,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:17:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:17:29,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:17:29,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:17:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 219 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-10 23:17:30,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:17:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-10-10 23:17:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343814594] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 23:17:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 23:17:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 5 [2024-10-10 23:17:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375345749] [2024-10-10 23:17:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:17:30,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:17:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:17:30,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:17:30,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:17:30,163 INFO L87 Difference]: Start difference. First operand 2088 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:17:30,508 INFO L93 Difference]: Finished difference Result 4729 states and 5558 transitions. [2024-10-10 23:17:30,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:17:30,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 324 [2024-10-10 23:17:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:17:30,509 INFO L225 Difference]: With dead ends: 4729 [2024-10-10 23:17:30,509 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:17:30,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 646 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:17:30,514 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 123 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:17:30,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 178 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:17:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:17:30,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:17:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:17:30,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 324 [2024-10-10 23:17:30,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:17:30,517 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:17:30,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:17:30,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:17:30,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:17:30,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:17:30,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 23:17:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:17:30,727 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:17:30,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:17:31,037 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:17:31,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:17:31 BoogieIcfgContainer [2024-10-10 23:17:31,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:17:31,054 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:17:31,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:17:31,055 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:17:31,055 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:17:11" (3/4) ... [2024-10-10 23:17:31,057 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:17:31,073 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:17:31,078 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:17:31,078 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:17:31,079 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:17:31,209 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:17:31,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:17:31,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:17:31,211 INFO L158 Benchmark]: Toolchain (without parser) took 21245.75ms. Allocated memory was 190.8MB in the beginning and 388.0MB in the end (delta: 197.1MB). Free memory was 161.6MB in the beginning and 129.6MB in the end (delta: 32.0MB). Peak memory consumption was 229.1MB. Max. memory is 16.1GB. [2024-10-10 23:17:31,211 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:17:31,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.52ms. Allocated memory is still 190.8MB. Free memory was 161.6MB in the beginning and 132.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-10 23:17:31,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.93ms. Allocated memory is still 190.8MB. Free memory was 132.2MB in the beginning and 123.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:17:31,213 INFO L158 Benchmark]: Boogie Preprocessor took 122.01ms. Allocated memory is still 190.8MB. Free memory was 123.8MB in the beginning and 113.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:17:31,213 INFO L158 Benchmark]: RCFGBuilder took 1165.20ms. Allocated memory is still 190.8MB. Free memory was 113.3MB in the beginning and 114.5MB in the end (delta: -1.2MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-10-10 23:17:31,213 INFO L158 Benchmark]: TraceAbstraction took 19277.10ms. Allocated memory was 190.8MB in the beginning and 388.0MB in the end (delta: 197.1MB). Free memory was 114.5MB in the beginning and 141.2MB in the end (delta: -26.6MB). Peak memory consumption was 172.6MB. Max. memory is 16.1GB. [2024-10-10 23:17:31,214 INFO L158 Benchmark]: Witness Printer took 156.07ms. Allocated memory is still 388.0MB. Free memory was 141.2MB in the beginning and 129.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:17:31,215 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.18ms. Allocated memory is still 151.0MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.52ms. Allocated memory is still 190.8MB. Free memory was 161.6MB in the beginning and 132.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.93ms. Allocated memory is still 190.8MB. Free memory was 132.2MB in the beginning and 123.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.01ms. Allocated memory is still 190.8MB. Free memory was 123.8MB in the beginning and 113.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1165.20ms. Allocated memory is still 190.8MB. Free memory was 113.3MB in the beginning and 114.5MB in the end (delta: -1.2MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19277.10ms. Allocated memory was 190.8MB in the beginning and 388.0MB in the end (delta: 197.1MB). Free memory was 114.5MB in the beginning and 141.2MB in the end (delta: -26.6MB). Peak memory consumption was 172.6MB. Max. memory is 16.1GB. * Witness Printer took 156.07ms. Allocated memory is still 388.0MB. Free memory was 141.2MB in the beginning and 129.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. 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: 83]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1218 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1218 mSDsluCounter, 899 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 795 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 753 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6424 IncrementalHoareTripleChecker+Invalid, 7972 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 753 mSolverCounterUnsat, 811 mSDtfsCounter, 6424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1395 GetRequests, 1362 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2088occurred in iteration=10, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1529 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 2650 NumberOfCodeBlocks, 2650 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3228 ConstructedInterpolants, 131 QuantifiedInterpolants, 20790 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1095 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 1698/2191 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: 592]: Loop Invariant Derived loop invariant: ((((((((a10 != 4) && (14 == a4)) && (a12 == 0)) && (((((long long) 9 * a1) >= 0) ? (((long long) 9 * a1) / 10) : ((((long long) 9 * a1) / 10) - 1)) <= 545150)) || ((((a10 == 1) && (14 == a4)) && (a12 == 0)) && (a19 == 8))) || (((((a19 <= 9) && (a1 <= 505232)) && (39 <= a1)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (((long long) a1 + 13) <= 0)) && (14 == a4)) && (a12 == 0))) || ((((a19 == 9) && (a1 <= 505232)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:17:31,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE