./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8bc9de3d9f51bc5c6470e24c35cb3edba79759c76c5cfb6c2a32518b5b17fdc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:40:41,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:40:41,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:40:41,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:40:41,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:40:41,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:40:41,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:40:41,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:40:41,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:40:41,238 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:40:41,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:40:41,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:40:41,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:40:41,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:40:41,239 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:40:41,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:40:41,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:40:41,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:40:41,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:40:41,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:40:41,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:40:41,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:40:41,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:40:41,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:40:41,245 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:40:41,245 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:40:41,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:40:41,246 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:40:41,246 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:40:41,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:40:41,248 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:40:41,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:40:41,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:40:41,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:40:41,249 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:40:41,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:40:41,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:40:41,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:40:41,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:40:41,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:40:41,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:40:41,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:40:41,266 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b8bc9de3d9f51bc5c6470e24c35cb3edba79759c76c5cfb6c2a32518b5b17fdc [2024-11-08 23:40:41,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:40:41,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:40:41,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:40:41,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:40:41,583 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:40:41,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i [2024-11-08 23:40:43,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:40:43,242 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:40:43,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i [2024-11-08 23:40:43,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8b2f08fa/0b7038dee2024a58a388529ab6ba83b2/FLAGc6f54ebba [2024-11-08 23:40:43,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8b2f08fa/0b7038dee2024a58a388529ab6ba83b2 [2024-11-08 23:40:43,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:40:43,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:40:43,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:40:43,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:40:43,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:40:43,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f125c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43, skipping insertion in model container [2024-11-08 23:40:43,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,304 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:40:43,492 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i[915,928] [2024-11-08 23:40:43,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:40:43,568 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:40:43,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i[915,928] [2024-11-08 23:40:43,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:40:43,629 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:40:43,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43 WrapperNode [2024-11-08 23:40:43,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:40:43,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:40:43,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:40:43,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:40:43,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,677 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-08 23:40:43,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:40:43,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:40:43,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:40:43,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:40:43,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,710 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-11-08 23:40:43,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,715 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:40:43,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:40:43,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:40:43,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:40:43,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (1/1) ... [2024-11-08 23:40:43,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:40:43,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:40:43,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 23:40:43,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 23:40:43,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:40:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:40:43,860 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:40:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:40:43,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:40:43,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:40:44,002 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:40:44,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:40:44,247 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 23:40:44,248 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:40:44,259 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:40:44,260 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:40:44,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:40:44 BoogieIcfgContainer [2024-11-08 23:40:44,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:40:44,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:40:44,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:40:44,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:40:44,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:40:43" (1/3) ... [2024-11-08 23:40:44,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658d98ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:40:44, skipping insertion in model container [2024-11-08 23:40:44,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:40:43" (2/3) ... [2024-11-08 23:40:44,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658d98ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:40:44, skipping insertion in model container [2024-11-08 23:40:44,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:40:44" (3/3) ... [2024-11-08 23:40:44,267 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-33.i [2024-11-08 23:40:44,283 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:40:44,283 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:40:44,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:40:44,340 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;@382e4fbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:40:44,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:40:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 23:40:44,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 23:40:44,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:44,358 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:40:44,358 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:44,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:44,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1908333502, now seen corresponding path program 1 times [2024-11-08 23:40:44,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:44,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509647831] [2024-11-08 23:40:44,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:44,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:44,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:44,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:44,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:44,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:44,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:40:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:44,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:40:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:44,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:40:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:44,641 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 23:40:44,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:44,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509647831] [2024-11-08 23:40:44,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509647831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:44,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:44,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:40:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272010749] [2024-11-08 23:40:44,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:44,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:40:44,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:44,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:40:44,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:40:44,677 INFO L87 Difference]: Start difference. First operand has 52 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 23:40:44,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:44,704 INFO L93 Difference]: Finished difference Result 99 states and 151 transitions. [2024-11-08 23:40:44,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:40:44,707 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2024-11-08 23:40:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:44,714 INFO L225 Difference]: With dead ends: 99 [2024-11-08 23:40:44,714 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 23:40:44,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-11-08 23:40:44,724 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:44,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:40:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 23:40:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 23:40:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 23:40:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-11-08 23:40:44,759 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 65 [2024-11-08 23:40:44,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:44,759 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-11-08 23:40:44,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 23:40:44,760 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2024-11-08 23:40:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 23:40:44,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:44,762 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:40:44,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:40:44,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:44,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:44,764 INFO L85 PathProgramCache]: Analyzing trace with hash 964629886, now seen corresponding path program 1 times [2024-11-08 23:40:44,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:44,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665348894] [2024-11-08 23:40:44,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:44,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:44,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:40:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:40:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:40:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 23:40:45,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:45,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665348894] [2024-11-08 23:40:45,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665348894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:45,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:45,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:40:45,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425459224] [2024-11-08 23:40:45,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:45,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:40:45,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:45,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:40:45,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:40:45,149 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 23:40:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:45,322 INFO L93 Difference]: Finished difference Result 144 states and 194 transitions. [2024-11-08 23:40:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:40:45,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 65 [2024-11-08 23:40:45,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:45,326 INFO L225 Difference]: With dead ends: 144 [2024-11-08 23:40:45,326 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 23:40:45,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:40:45,329 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 83 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:45,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 157 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:40:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 23:40:45,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2024-11-08 23:40:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 71 states have internal predecessors, (87), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:40:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2024-11-08 23:40:45,349 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 65 [2024-11-08 23:40:45,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:45,350 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2024-11-08 23:40:45,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 23:40:45,350 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2024-11-08 23:40:45,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 23:40:45,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:45,353 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:40:45,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:40:45,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:45,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:45,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1961754744, now seen corresponding path program 1 times [2024-11-08 23:40:45,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:45,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535416748] [2024-11-08 23:40:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:45,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:40:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:40:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:40:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:45,632 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 23:40:45,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:45,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535416748] [2024-11-08 23:40:45,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535416748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:45,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:45,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:40:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659581713] [2024-11-08 23:40:45,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:45,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:40:45,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:45,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:40:45,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:40:45,638 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 23:40:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:45,809 INFO L93 Difference]: Finished difference Result 188 states and 245 transitions. [2024-11-08 23:40:45,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:40:45,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2024-11-08 23:40:45,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:45,813 INFO L225 Difference]: With dead ends: 188 [2024-11-08 23:40:45,813 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 23:40:45,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:40:45,817 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 78 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:45,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 237 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:40:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 23:40:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2024-11-08 23:40:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 71 states have internal predecessors, (86), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:40:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 118 transitions. [2024-11-08 23:40:45,842 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 118 transitions. Word has length 69 [2024-11-08 23:40:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:45,843 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 118 transitions. [2024-11-08 23:40:45,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 23:40:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 118 transitions. [2024-11-08 23:40:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 23:40:45,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:45,844 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:40:45,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:40:45,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:45,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1053348874, now seen corresponding path program 1 times [2024-11-08 23:40:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:45,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505583180] [2024-11-08 23:40:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:45,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:49,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:49,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:49,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:49,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:49,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:40:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:40:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:49,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:40:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 23:40:49,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:49,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505583180] [2024-11-08 23:40:49,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505583180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:49,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:49,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 23:40:49,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567609559] [2024-11-08 23:40:49,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:49,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 23:40:49,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:49,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 23:40:49,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-08 23:40:49,268 INFO L87 Difference]: Start difference. First operand 90 states and 118 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 23:40:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:50,553 INFO L93 Difference]: Finished difference Result 142 states and 172 transitions. [2024-11-08 23:40:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 23:40:50,554 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2024-11-08 23:40:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:50,555 INFO L225 Difference]: With dead ends: 142 [2024-11-08 23:40:50,555 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 23:40:50,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=156, Invalid=350, Unknown=0, NotChecked=0, Total=506 [2024-11-08 23:40:50,557 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 172 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:50,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 314 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:40:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 23:40:50,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2024-11-08 23:40:50,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.2) internal successors, (96), 80 states have internal predecessors, (96), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:40:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2024-11-08 23:40:50,576 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 69 [2024-11-08 23:40:50,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:50,576 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2024-11-08 23:40:50,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 23:40:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2024-11-08 23:40:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 23:40:50,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:50,578 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:40:50,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:40:50,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:50,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash 352284296, now seen corresponding path program 1 times [2024-11-08 23:40:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:50,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158350286] [2024-11-08 23:40:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:50,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:51,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:51,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:51,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:51,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:51,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:40:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:51,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:40:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:51,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:40:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 23:40:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158350286] [2024-11-08 23:40:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158350286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:51,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:51,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 23:40:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094558157] [2024-11-08 23:40:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:51,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:40:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:40:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:40:51,057 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 23:40:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:51,272 INFO L93 Difference]: Finished difference Result 256 states and 326 transitions. [2024-11-08 23:40:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:40:51,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 69 [2024-11-08 23:40:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:51,275 INFO L225 Difference]: With dead ends: 256 [2024-11-08 23:40:51,275 INFO L226 Difference]: Without dead ends: 160 [2024-11-08 23:40:51,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:40:51,279 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 65 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:51,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 244 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:40:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-08 23:40:51,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 127. [2024-11-08 23:40:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 99 states have (on average 1.1616161616161615) internal successors, (115), 99 states have internal predecessors, (115), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:40:51,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2024-11-08 23:40:51,312 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 69 [2024-11-08 23:40:51,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:51,313 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2024-11-08 23:40:51,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 23:40:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2024-11-08 23:40:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-08 23:40:51,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:51,316 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 23:40:51,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:40:51,317 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:51,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:51,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1135367853, now seen corresponding path program 1 times [2024-11-08 23:40:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:51,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073609506] [2024-11-08 23:40:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:40:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:40:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:40:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-08 23:40:53,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:53,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073609506] [2024-11-08 23:40:53,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073609506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:53,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:40:53,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 23:40:53,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679518458] [2024-11-08 23:40:53,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:53,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:40:53,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:53,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:40:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:40:53,243 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 23:40:54,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:54,350 INFO L93 Difference]: Finished difference Result 162 states and 200 transitions. [2024-11-08 23:40:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 23:40:54,351 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 70 [2024-11-08 23:40:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:54,352 INFO L225 Difference]: With dead ends: 162 [2024-11-08 23:40:54,352 INFO L226 Difference]: Without dead ends: 160 [2024-11-08 23:40:54,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2024-11-08 23:40:54,353 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 133 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:54,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 290 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:40:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-08 23:40:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2024-11-08 23:40:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 108 states have (on average 1.1666666666666667) internal successors, (126), 108 states have internal predecessors, (126), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:40:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 174 transitions. [2024-11-08 23:40:54,369 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 174 transitions. Word has length 70 [2024-11-08 23:40:54,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:54,370 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 174 transitions. [2024-11-08 23:40:54,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-08 23:40:54,370 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 174 transitions. [2024-11-08 23:40:54,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 23:40:54,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:54,373 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-08 23:40:54,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 23:40:54,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:54,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash -196562412, now seen corresponding path program 1 times [2024-11-08 23:40:54,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:54,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376835968] [2024-11-08 23:40:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:54,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:40:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:40:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:40:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 23:40:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:40:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:40:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:40:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:40:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 23:40:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 23:40:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 23:40:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:54,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:54,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376835968] [2024-11-08 23:40:54,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376835968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:40:54,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539623997] [2024-11-08 23:40:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:54,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:40:54,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:40:54,504 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:40:54,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 23:40:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:40:54,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:40:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2024-11-08 23:40:54,643 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:40:54,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539623997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:54,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:40:54,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-08 23:40:54,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578156777] [2024-11-08 23:40:54,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:54,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:40:54,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:54,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:40:54,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:40:54,646 INFO L87 Difference]: Start difference. First operand 136 states and 174 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:40:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:54,676 INFO L93 Difference]: Finished difference Result 140 states and 177 transitions. [2024-11-08 23:40:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:40:54,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 134 [2024-11-08 23:40:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:54,680 INFO L225 Difference]: With dead ends: 140 [2024-11-08 23:40:54,681 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 23:40:54,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:40:54,684 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:54,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:40:54,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 23:40:54,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-08 23:40:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 66 states have internal predecessors, (72), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-08 23:40:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2024-11-08 23:40:54,702 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 134 [2024-11-08 23:40:54,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:54,703 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2024-11-08 23:40:54,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:40:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2024-11-08 23:40:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-08 23:40:54,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:40:54,707 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-08 23:40:54,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 23:40:54,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:40:54,911 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:40:54,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:40:54,912 INFO L85 PathProgramCache]: Analyzing trace with hash 433843283, now seen corresponding path program 1 times [2024-11-08 23:40:54,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:40:54,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983217837] [2024-11-08 23:40:54,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:54,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:40:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:40:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:40:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:54,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:40:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:40:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:40:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 23:40:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:40:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 23:40:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:40:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 23:40:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:40:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 23:40:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:40:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:40:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 23:40:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:40:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-08 23:40:55,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:40:55,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983217837] [2024-11-08 23:40:55,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983217837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:40:55,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762331861] [2024-11-08 23:40:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:40:55,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:40:55,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:40:55,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:40:55,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 23:40:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:40:55,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:40:55,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:40:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-08 23:40:55,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:40:55,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762331861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:40:55,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:40:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-08 23:40:55,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169982834] [2024-11-08 23:40:55,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:40:55,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:40:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:40:55,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:40:55,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:40:55,210 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:40:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:40:55,237 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2024-11-08 23:40:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:40:55,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-11-08 23:40:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:40:55,240 INFO L225 Difference]: With dead ends: 99 [2024-11-08 23:40:55,240 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 23:40:55,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:40:55,241 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:40:55,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 92 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:40:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 23:40:55,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 23:40:55,242 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-11-08 23:40:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 23:40:55,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136 [2024-11-08 23:40:55,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:40:55,243 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 23:40:55,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 23:40:55,243 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 23:40:55,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 23:40:55,248 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:40:55,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:40:55,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 23:40:55,452 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:40:55,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 23:40:55,769 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:40:55,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:40:55 BoogieIcfgContainer [2024-11-08 23:40:55,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:40:55,803 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:40:55,803 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:40:55,804 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:40:55,805 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:40:44" (3/4) ... [2024-11-08 23:40:55,807 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 23:40:55,811 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 23:40:55,817 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-08 23:40:55,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 23:40:55,818 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 23:40:55,819 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 23:40:55,933 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 23:40:55,933 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 23:40:55,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:40:55,934 INFO L158 Benchmark]: Toolchain (without parser) took 12659.17ms. Allocated memory was 159.4MB in the beginning and 308.3MB in the end (delta: 148.9MB). Free memory was 121.5MB in the beginning and 110.6MB in the end (delta: 10.9MB). Peak memory consumption was 158.2MB. Max. memory is 16.1GB. [2024-11-08 23:40:55,934 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 159.4MB. Free memory was 127.2MB in the beginning and 127.1MB in the end (delta: 148.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:40:55,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.66ms. Allocated memory is still 159.4MB. Free memory was 121.5MB in the beginning and 107.7MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:40:55,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.79ms. Allocated memory is still 159.4MB. Free memory was 107.7MB in the beginning and 105.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:40:55,935 INFO L158 Benchmark]: Boogie Preprocessor took 48.36ms. Allocated memory is still 159.4MB. Free memory was 105.2MB in the beginning and 102.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:40:55,935 INFO L158 Benchmark]: RCFGBuilder took 532.43ms. Allocated memory is still 159.4MB. Free memory was 102.2MB in the beginning and 114.5MB in the end (delta: -12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 23:40:55,935 INFO L158 Benchmark]: TraceAbstraction took 11540.75ms. Allocated memory was 159.4MB in the beginning and 308.3MB in the end (delta: 148.9MB). Free memory was 113.8MB in the beginning and 116.9MB in the end (delta: -3.1MB). Peak memory consumption was 147.2MB. Max. memory is 16.1GB. [2024-11-08 23:40:55,935 INFO L158 Benchmark]: Witness Printer took 130.56ms. Allocated memory is still 308.3MB. Free memory was 116.9MB in the beginning and 110.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:40:55,938 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.21ms. Allocated memory is still 159.4MB. Free memory was 127.2MB in the beginning and 127.1MB in the end (delta: 148.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.66ms. Allocated memory is still 159.4MB. Free memory was 121.5MB in the beginning and 107.7MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.79ms. Allocated memory is still 159.4MB. Free memory was 107.7MB in the beginning and 105.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.36ms. Allocated memory is still 159.4MB. Free memory was 105.2MB in the beginning and 102.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 532.43ms. Allocated memory is still 159.4MB. Free memory was 102.2MB in the beginning and 114.5MB in the end (delta: -12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11540.75ms. Allocated memory was 159.4MB in the beginning and 308.3MB in the end (delta: 148.9MB). Free memory was 113.8MB in the beginning and 116.9MB in the end (delta: -3.1MB). Peak memory consumption was 147.2MB. Max. memory is 16.1GB. * Witness Printer took 130.56ms. Allocated memory is still 308.3MB. Free memory was 116.9MB in the beginning and 110.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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: 19]: 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 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 537 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 537 mSDsluCounter, 1499 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1077 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 726 IncrementalHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 422 mSDtfsCounter, 726 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 523 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=6, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 122 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 947 NumberOfCodeBlocks, 947 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 937 ConstructedInterpolants, 0 QuantifiedInterpolants, 4874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 619 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 2714/2716 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: 90]: Loop Invariant Derived loop invariant: ((((((((((0 <= 0) && (1 <= k_loop)) && (50 <= last_1_var_1_9)) && (var_1_8 == var_1_18)) && ((((128 + (65534 * last_1_var_1_7)) == (var_1_1 + (65536 * ((64 + (32767 * last_1_var_1_7)) / 32768)))) && ((((last_1_var_1_7 * 32767) + 64) % 32768) <= 16383)) || (((65534 * last_1_var_1_7) == ((65408 + var_1_1) + (65536 * ((64 + (32767 * last_1_var_1_7)) / 32768)))) && (16384 <= (((last_1_var_1_7 * 32767) + 64) % 32768))))) && (var_1_17 == var_1_16)) && (var_1_7 == var_1_8)) && (50 <= var_1_9)) && (var_1_8 <= ((short) var_1_8 + var_1_18))) || (((((200 == var_1_7) && (50 <= last_1_var_1_9)) && (0 <= k_loop)) && ((((64 + (32767 * last_1_var_1_7)) / 32768) + 1) <= last_1_var_1_7)) && (50 <= var_1_9))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((200 == var_1_7) && (50 <= last_1_var_1_9)) && ((((64 + (32767 * last_1_var_1_7)) / 32768) + 1) <= last_1_var_1_7)) && (50 <= var_1_9)) Ensures: (((((200 == var_1_7) && (50 <= last_1_var_1_9)) && ((((64 + (32767 * last_1_var_1_7)) / 32768) + 1) <= last_1_var_1_7)) && (50 <= var_1_9)) && ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_9 == \old(last_1_var_1_9)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 23:40:55,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE