./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8bc9de3d9f51bc5c6470e24c35cb3edba79759c76c5cfb6c2a32518b5b17fdc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:26:37,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:26:37,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:26:37,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:26:37,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:26:37,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:26:37,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:26:37,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:26:37,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:26:37,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:26:37,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:26:37,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:26:37,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:26:37,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:26:37,656 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:26:37,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:26:37,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:26:37,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:26:37,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:26:37,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:26:37,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:26:37,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:26:37,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:26:37,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:26:37,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:26:37,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:26:37,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:26:37,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:26:37,660 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:26:37,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:26:37,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:26:37,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:26:37,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:26:37,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:26:37,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:26:37,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:26:37,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:26:37,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:26:37,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:26:37,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:26:37,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:26:37,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:26:37,664 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b8bc9de3d9f51bc5c6470e24c35cb3edba79759c76c5cfb6c2a32518b5b17fdc [2024-10-11 11:26:37,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:26:37,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:26:37,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:26:37,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:26:37,875 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:26:37,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i [2024-10-11 11:26:39,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:26:39,381 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:26:39,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i [2024-10-11 11:26:39,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/97903523c/c2602c1333a140e28c647fbd4d37662d/FLAG8fd01ed78 [2024-10-11 11:26:39,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/97903523c/c2602c1333a140e28c647fbd4d37662d [2024-10-11 11:26:39,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:26:39,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:26:39,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:26:39,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:26:39,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:26:39,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d109f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39, skipping insertion in model container [2024-10-11 11:26:39,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:26:39,601 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i[915,928] [2024-10-11 11:26:39,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:26:39,644 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:26:39,654 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-33.i[915,928] [2024-10-11 11:26:39,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:26:39,718 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:26:39,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39 WrapperNode [2024-10-11 11:26:39,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:26:39,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:26:39,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:26:39,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:26:39,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,786 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-11 11:26:39,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:26:39,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:26:39,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:26:39,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:26:39,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,823 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:26:39,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:26:39,846 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:26:39,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:26:39,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:26:39,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (1/1) ... [2024-10-11 11:26:39,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:26:39,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:26:39,872 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:26:39,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:26:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:26:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:26:39,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:26:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:26:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:26:39,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:26:39,979 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:26:39,982 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:26:40,211 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 11:26:40,211 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:26:40,240 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:26:40,240 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:26:40,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:26:40 BoogieIcfgContainer [2024-10-11 11:26:40,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:26:40,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:26:40,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:26:40,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:26:40,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:26:39" (1/3) ... [2024-10-11 11:26:40,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c70b535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:26:40, skipping insertion in model container [2024-10-11 11:26:40,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:26:39" (2/3) ... [2024-10-11 11:26:40,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c70b535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:26:40, skipping insertion in model container [2024-10-11 11:26:40,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:26:40" (3/3) ... [2024-10-11 11:26:40,248 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-33.i [2024-10-11 11:26:40,261 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:26:40,262 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:26:40,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:26:40,328 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;@559c3b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:26:40,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:26:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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-10-11 11:26:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 11:26:40,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:26:40,340 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] [2024-10-11 11:26:40,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:26:40,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:26:40,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1594351526, now seen corresponding path program 1 times [2024-10-11 11:26:40,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:26:40,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073555165] [2024-10-11 11:26:40,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:26:40,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:26:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:40,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:26:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:40,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:26:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:40,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:26:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:40,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:26:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:40,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:26:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:40,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:26:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:40,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:26:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:40,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:26:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:26:40,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:26:40,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073555165] [2024-10-11 11:26:40,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073555165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:26:40,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:26:40,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:26:40,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775038839] [2024-10-11 11:26:40,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:26:40,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:26:40,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:26:40,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:26:40,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:26:40,643 INFO L87 Difference]: Start difference. First operand has 45 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10-11 11:26:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:26:40,688 INFO L93 Difference]: Finished difference Result 87 states and 139 transitions. [2024-10-11 11:26:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:26:40,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 61 [2024-10-11 11:26:40,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:26:40,698 INFO L225 Difference]: With dead ends: 87 [2024-10-11 11:26:40,699 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 11:26:40,701 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-10-11 11:26:40,704 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:26:40,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:26:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 11:26:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 11:26:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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-10-11 11:26:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2024-10-11 11:26:40,740 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 61 [2024-10-11 11:26:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:26:40,740 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2024-10-11 11:26:40,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-10-11 11:26:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2024-10-11 11:26:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 11:26:40,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:26:40,745 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] [2024-10-11 11:26:40,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:26:40,745 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:26:40,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:26:40,746 INFO L85 PathProgramCache]: Analyzing trace with hash -806824214, now seen corresponding path program 1 times [2024-10-11 11:26:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:26:40,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16236240] [2024-10-11 11:26:40,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:26:40,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:26:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:26:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:26:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:26:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:26:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:26:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:26:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:26:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:26:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:26:41,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:26:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16236240] [2024-10-11 11:26:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16236240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:26:41,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:26:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:26:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871803817] [2024-10-11 11:26:41,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:26:41,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:26:41,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:26:41,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:26:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:26:41,113 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-11 11:26:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:26:41,227 INFO L93 Difference]: Finished difference Result 131 states and 181 transitions. [2024-10-11 11:26:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:26:41,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 61 [2024-10-11 11:26:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:26:41,229 INFO L225 Difference]: With dead ends: 131 [2024-10-11 11:26:41,229 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 11:26:41,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:26:41,232 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 74 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:26:41,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 142 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:26:41,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 11:26:41,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2024-10-11 11:26:41,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 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-10-11 11:26:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2024-10-11 11:26:41,251 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 111 transitions. Word has length 61 [2024-10-11 11:26:41,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:26:41,252 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 111 transitions. [2024-10-11 11:26:41,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-11 11:26:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 111 transitions. [2024-10-11 11:26:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 11:26:41,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:26:41,254 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-10-11 11:26:41,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:26:41,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:26:41,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:26:41,255 INFO L85 PathProgramCache]: Analyzing trace with hash 676524192, now seen corresponding path program 1 times [2024-10-11 11:26:41,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:26:41,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346775443] [2024-10-11 11:26:41,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:26:41,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:26:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:26:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:26:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:26:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:26:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:26:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:26:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:26:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:26:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:26:41,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:26:41,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346775443] [2024-10-11 11:26:41,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346775443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:26:41,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:26:41,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:26:41,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962598415] [2024-10-11 11:26:41,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:26:41,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:26:41,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:26:41,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:26:41,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:26:41,439 INFO L87 Difference]: Start difference. First operand 82 states and 111 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-11 11:26:41,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:26:41,595 INFO L93 Difference]: Finished difference Result 172 states and 229 transitions. [2024-10-11 11:26:41,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:26:41,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-11 11:26:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:26:41,597 INFO L225 Difference]: With dead ends: 172 [2024-10-11 11:26:41,598 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 11:26:41,599 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-10-11 11:26:41,600 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 69 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:26:41,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 208 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:26:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 11:26:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2024-10-11 11:26:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 63 states have internal predecessors, (78), 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-10-11 11:26:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 110 transitions. [2024-10-11 11:26:41,610 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 110 transitions. Word has length 65 [2024-10-11 11:26:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:26:41,610 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 110 transitions. [2024-10-11 11:26:41,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-11 11:26:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 110 transitions. [2024-10-11 11:26:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 11:26:41,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:26:41,612 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-10-11 11:26:41,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:26:41,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:26:41,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:26:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash -334593058, now seen corresponding path program 1 times [2024-10-11 11:26:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:26:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533601472] [2024-10-11 11:26:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:26:41,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:26:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:44,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:26:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:44,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:26:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:44,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:26:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:44,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:26:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:44,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:26:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:44,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:26:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:44,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:26:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:44,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:26:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:44,140 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:26:44,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:26:44,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533601472] [2024-10-11 11:26:44,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533601472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:26:44,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:26:44,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 11:26:44,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642337374] [2024-10-11 11:26:44,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:26:44,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 11:26:44,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:26:44,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 11:26:44,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:26:44,142 INFO L87 Difference]: Start difference. First operand 82 states and 110 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 11:26:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:26:45,136 INFO L93 Difference]: Finished difference Result 126 states and 156 transitions. [2024-10-11 11:26:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 11:26:45,137 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2024-10-11 11:26:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:26:45,138 INFO L225 Difference]: With dead ends: 126 [2024-10-11 11:26:45,138 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 11:26:45,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=197, Invalid=403, Unknown=0, NotChecked=0, Total=600 [2024-10-11 11:26:45,140 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 247 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:26:45,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 210 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:26:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 11:26:45,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 90. [2024-10-11 11:26:45,148 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-10-11 11:26:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2024-10-11 11:26:45,149 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 65 [2024-10-11 11:26:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:26:45,150 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2024-10-11 11:26:45,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 11:26:45,150 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2024-10-11 11:26:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 11:26:45,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:26:45,152 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-10-11 11:26:45,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:26:45,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:26:45,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:26:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash 58433952, now seen corresponding path program 1 times [2024-10-11 11:26:45,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:26:45,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092041410] [2024-10-11 11:26:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:26:45,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:26:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:26:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:45,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:26:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:45,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:26:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:45,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:26:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:45,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:26:45,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:26:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:45,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:26:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:45,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:26:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:26:45,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:26:45,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092041410] [2024-10-11 11:26:45,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092041410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:26:45,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:26:45,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:26:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701028915] [2024-10-11 11:26:45,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:26:45,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:26:45,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:26:45,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:26:45,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:26:45,582 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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-10-11 11:26:45,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:26:45,747 INFO L93 Difference]: Finished difference Result 234 states and 304 transitions. [2024-10-11 11:26:45,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:26:45,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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-10-11 11:26:45,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:26:45,748 INFO L225 Difference]: With dead ends: 234 [2024-10-11 11:26:45,748 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 11:26:45,749 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-10-11 11:26:45,750 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:26:45,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 201 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:26:45,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 11:26:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 117. [2024-10-11 11:26:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 89 states have internal predecessors, (105), 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-10-11 11:26:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 153 transitions. [2024-10-11 11:26:45,777 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 153 transitions. Word has length 65 [2024-10-11 11:26:45,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:26:45,777 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 153 transitions. [2024-10-11 11:26:45,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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-10-11 11:26:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 153 transitions. [2024-10-11 11:26:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 11:26:45,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:26:45,778 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] [2024-10-11 11:26:45,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:26:45,779 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:26:45,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:26:45,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1632838415, now seen corresponding path program 1 times [2024-10-11 11:26:45,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:26:45,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255850956] [2024-10-11 11:26:45,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:26:45,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:26:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:47,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:26:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:26:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:47,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:26:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:26:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:47,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:26:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:47,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:26:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:26:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:47,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:26:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:47,679 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 11:26:47,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:26:47,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255850956] [2024-10-11 11:26:47,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255850956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:26:47,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:26:47,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 11:26:47,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589797826] [2024-10-11 11:26:47,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:26:47,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:26:47,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:26:47,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:26:47,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:26:47,682 INFO L87 Difference]: Start difference. First operand 117 states and 153 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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-10-11 11:26:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:26:48,544 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2024-10-11 11:26:48,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 11:26:48,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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 66 [2024-10-11 11:26:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:26:48,546 INFO L225 Difference]: With dead ends: 146 [2024-10-11 11:26:48,546 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 11:26:48,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2024-10-11 11:26:48,547 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 138 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:26:48,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 204 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 11:26:48,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 11:26:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2024-10-11 11:26:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.1855670103092784) internal successors, (115), 97 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-10-11 11:26:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 163 transitions. [2024-10-11 11:26:48,558 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 163 transitions. Word has length 66 [2024-10-11 11:26:48,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:26:48,558 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 163 transitions. [2024-10-11 11:26:48,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 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-10-11 11:26:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2024-10-11 11:26:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 11:26:48,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:26:48,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:26:48,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:26:48,561 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:26:48,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:26:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash -773434210, now seen corresponding path program 1 times [2024-10-11 11:26:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:26:48,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807503386] [2024-10-11 11:26:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:26:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:26:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:26:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:26:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:26:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:26:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:26:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:26:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:26:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:26:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:26:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:26:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:26:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:26:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:26:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:26:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:26:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:26:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:26:48,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:26:48,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807503386] [2024-10-11 11:26:48,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807503386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:26:48,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089434647] [2024-10-11 11:26:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:26:48,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:26:48,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:26:48,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:26:48,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:26:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:48,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:26:48,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:26:48,775 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-10-11 11:26:48,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:26:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089434647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:26:48,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:26:48,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-11 11:26:48,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629642917] [2024-10-11 11:26:48,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:26:48,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:26:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:26:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:26:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:26:48,778 INFO L87 Difference]: Start difference. First operand 125 states and 163 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-10-11 11:26:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:26:48,802 INFO L93 Difference]: Finished difference Result 129 states and 166 transitions. [2024-10-11 11:26:48,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:26:48,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 127 [2024-10-11 11:26:48,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:26:48,804 INFO L225 Difference]: With dead ends: 129 [2024-10-11 11:26:48,804 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 11:26:48,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 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-10-11 11:26:48,805 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:26:48,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:26:48,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 11:26:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-10-11 11:26:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 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-10-11 11:26:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2024-10-11 11:26:48,814 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 97 transitions. Word has length 127 [2024-10-11 11:26:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:26:48,814 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 97 transitions. [2024-10-11 11:26:48,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-10-11 11:26:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 97 transitions. [2024-10-11 11:26:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 11:26:48,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:26:48,816 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:26:48,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:26:49,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:26:49,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:26:49,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:26:49,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1026973065, now seen corresponding path program 1 times [2024-10-11 11:26:49,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:26:49,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413476001] [2024-10-11 11:26:49,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:26:49,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:26:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:26:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:26:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:26:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:26:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:26:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:26:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:26:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:26:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 11:26:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 11:26:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 11:26:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 11:26:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:26:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:26:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:26:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 11:26:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:26:49,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:26:49,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413476001] [2024-10-11 11:26:49,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413476001] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:26:49,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499294820] [2024-10-11 11:26:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:26:49,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:26:49,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:26:49,132 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:26:49,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:26:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:26:49,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 11:26:49,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:26:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-10-11 11:26:49,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:26:49,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499294820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:26:49,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:26:49,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-10-11 11:26:49,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434548478] [2024-10-11 11:26:49,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:26:49,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:26:49,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:26:49,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:26:49,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:26:49,278 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 11:26:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:26:49,304 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2024-10-11 11:26:49,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:26:49,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 129 [2024-10-11 11:26:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:26:49,307 INFO L225 Difference]: With dead ends: 90 [2024-10-11 11:26:49,308 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 11:26:49,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:26:49,309 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:26:49,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:26:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 11:26:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 11:26:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 11:26:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 11:26:49,310 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2024-10-11 11:26:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:26:49,310 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 11:26:49,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-10-11 11:26:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 11:26:49,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 11:26:49,315 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:26:49,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 11:26:49,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:26:49,519 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:26:49,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 11:26:50,119 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:26:50,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:26:50 BoogieIcfgContainer [2024-10-11 11:26:50,140 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:26:50,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:26:50,141 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:26:50,141 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:26:50,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:26:40" (3/4) ... [2024-10-11 11:26:50,143 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 11:26:50,146 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 11:26:50,149 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-11 11:26:50,150 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 11:26:50,150 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 11:26:50,150 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 11:26:50,221 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 11:26:50,222 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 11:26:50,222 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:26:50,222 INFO L158 Benchmark]: Toolchain (without parser) took 10817.34ms. Allocated memory was 151.0MB in the beginning and 411.0MB in the end (delta: 260.0MB). Free memory was 80.3MB in the beginning and 172.0MB in the end (delta: -91.7MB). Peak memory consumption was 170.4MB. Max. memory is 16.1GB. [2024-10-11 11:26:50,222 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:26:50,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.52ms. Allocated memory is still 151.0MB. Free memory was 80.0MB in the beginning and 120.7MB in the end (delta: -40.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-10-11 11:26:50,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.20ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 120.7MB in the beginning and 190.7MB in the end (delta: -70.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-10-11 11:26:50,223 INFO L158 Benchmark]: Boogie Preprocessor took 55.97ms. Allocated memory is still 220.2MB. Free memory was 190.7MB in the beginning and 187.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:26:50,223 INFO L158 Benchmark]: RCFGBuilder took 394.50ms. Allocated memory is still 220.2MB. Free memory was 187.5MB in the beginning and 167.6MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:26:50,223 INFO L158 Benchmark]: TraceAbstraction took 9897.49ms. Allocated memory was 220.2MB in the beginning and 411.0MB in the end (delta: 190.8MB). Free memory was 166.6MB in the beginning and 177.3MB in the end (delta: -10.7MB). Peak memory consumption was 180.1MB. Max. memory is 16.1GB. [2024-10-11 11:26:50,224 INFO L158 Benchmark]: Witness Printer took 81.23ms. Allocated memory is still 411.0MB. Free memory was 177.3MB in the beginning and 172.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:26:50,225 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.52ms. Allocated memory is still 151.0MB. Free memory was 80.0MB in the beginning and 120.7MB in the end (delta: -40.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.20ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 120.7MB in the beginning and 190.7MB in the end (delta: -70.0MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.97ms. Allocated memory is still 220.2MB. Free memory was 190.7MB in the beginning and 187.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 394.50ms. Allocated memory is still 220.2MB. Free memory was 187.5MB in the beginning and 167.6MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9897.49ms. Allocated memory was 220.2MB in the beginning and 411.0MB in the end (delta: 190.8MB). Free memory was 166.6MB in the beginning and 177.3MB in the end (delta: -10.7MB). Peak memory consumption was 180.1MB. Max. memory is 16.1GB. * Witness Printer took 81.23ms. Allocated memory is still 411.0MB. Free memory was 177.3MB in the beginning and 172.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 8, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 610 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 610 mSDsluCounter, 1182 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 823 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 615 IncrementalHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 359 mSDtfsCounter, 615 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=6, InterpolantAutomatonStates: 53, 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, 101 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 895 NumberOfCodeBlocks, 895 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 885 ConstructedInterpolants, 0 QuantifiedInterpolants, 6328 SizeOfPredicates, 0 NumberOfNonLiveVariables, 587 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 2706/2708 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: (((((((((200 == var_1_7) && (0 <= 0)) && (50 <= last_1_var_1_9)) && (0 <= k_loop)) && (((((var_1_18 == var_1_8) && (var_1_8 == 200)) && (0 <= 0)) && ((((128 + (65534 * last_1_var_1_7)) == (var_1_1 + (65536 * ((64 + (32767 * last_1_var_1_7)) / 32768)))) && ((32767 * last_1_var_1_7) <= ((32768 * ((64 + (32767 * last_1_var_1_7)) / 32768)) + 16319))) || (((65534 * last_1_var_1_7) == ((65408 + var_1_1) + (65536 * ((64 + (32767 * last_1_var_1_7)) / 32768)))) && (((32768 * ((64 + (32767 * last_1_var_1_7)) / 32768)) + 16320) <= (32767 * last_1_var_1_7))))) || (0 < var_1_17))) && ((var_1_17 < 1) || (var_1_17 < (var_1_16 + 1)))) && ((((64 + (32767 * last_1_var_1_7)) / 32768) + 1) <= last_1_var_1_7)) && (50 <= var_1_9)) || (((((((((((((var_1_17 == var_1_16) && (var_1_8 <= var_1_7)) && ((0 == 0) || (0 < var_1_17))) && (0 <= 0)) && (0 <= 0)) && (1 <= k_loop)) && (var_1_18 == var_1_8)) && (50 <= last_1_var_1_9)) && ((var_1_17 < 1) || (var_1_17 < (var_1_16 + 1)))) && (0 == 0)) && (50 <= var_1_9)) && (var_1_7 <= var_1_8)) && ((((128 + (65534 * last_1_var_1_7)) == (var_1_1 + (65536 * ((64 + (32767 * last_1_var_1_7)) / 32768)))) && ((32767 * last_1_var_1_7) <= ((32768 * ((64 + (32767 * last_1_var_1_7)) / 32768)) + 16319))) || (((65534 * last_1_var_1_7) == ((65408 + var_1_1) + (65536 * ((64 + (32767 * last_1_var_1_7)) / 32768)))) && (((32768 * ((64 + (32767 * last_1_var_1_7)) / 32768)) + 16320) <= (32767 * last_1_var_1_7)))))) - 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)) RESULT: Ultimate proved your program to be correct! [2024-10-11 11:26:50,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE