./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_variablewrapping_normal_file-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d86a29590e516b56eb6eeb16b945b1182b90f7fb3c3ac4e2538897e0203b1d47 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:15:19,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:15:19,610 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:15:19,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:15:19,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:15:19,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:15:19,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:15:19,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:15:19,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:15:19,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:15:19,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:15:19,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:15:19,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:15:19,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:15:19,645 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:15:19,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:15:19,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:15:19,649 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:15:19,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:15:19,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:15:19,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:15:19,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:15:19,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:15:19,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:15:19,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:15:19,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:15:19,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:15:19,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:15:19,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:15:19,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:15:19,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:15:19,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:15:19,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:15:19,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:15:19,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:15:19,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:15:19,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:15:19,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:15:19,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:15:19,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:15:19,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:15:19,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:15:19,656 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d86a29590e516b56eb6eeb16b945b1182b90f7fb3c3ac4e2538897e0203b1d47 [2024-11-20 08:15:19,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:15:19,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:15:19,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:15:19,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:15:19,959 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:15:19,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-5.i [2024-11-20 08:15:21,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:15:21,620 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:15:21,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-5.i [2024-11-20 08:15:21,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a0e4fe7b/3ef836731085417a963f68df56e1b57f/FLAGff042fd0e [2024-11-20 08:15:21,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a0e4fe7b/3ef836731085417a963f68df56e1b57f [2024-11-20 08:15:21,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:15:21,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:15:21,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:15:21,646 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:15:21,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:15:21,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:21,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9560647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21, skipping insertion in model container [2024-11-20 08:15:21,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:21,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:15:21,868 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-5.i[912,925] [2024-11-20 08:15:21,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:15:21,933 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:15:21,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-5.i[912,925] [2024-11-20 08:15:21,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:15:21,991 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:15:21,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21 WrapperNode [2024-11-20 08:15:21,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:15:21,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:15:21,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:15:21,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:15:22,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,060 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-11-20 08:15:22,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:15:22,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:15:22,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:15:22,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:15:22,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,110 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 08:15:22,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:15:22,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:15:22,129 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:15:22,129 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:15:22,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (1/1) ... [2024-11-20 08:15:22,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:15:22,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:15:22,175 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 08:15:22,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 08:15:22,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:15:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:15:22,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:15:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:15:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:15:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:15:22,328 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:15:22,330 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:15:22,643 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 08:15:22,644 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:15:22,659 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:15:22,659 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:15:22,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:15:22 BoogieIcfgContainer [2024-11-20 08:15:22,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:15:22,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:15:22,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:15:22,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:15:22,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:15:21" (1/3) ... [2024-11-20 08:15:22,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f773d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:15:22, skipping insertion in model container [2024-11-20 08:15:22,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:15:21" (2/3) ... [2024-11-20 08:15:22,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f773d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:15:22, skipping insertion in model container [2024-11-20 08:15:22,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:15:22" (3/3) ... [2024-11-20 08:15:22,669 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-5.i [2024-11-20 08:15:22,686 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:15:22,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:15:22,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:15:22,746 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;@4142c476, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:15:22,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:15:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:15:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 08:15:22,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:22,761 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:22,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:22,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:22,766 INFO L85 PathProgramCache]: Analyzing trace with hash 929324851, now seen corresponding path program 1 times [2024-11-20 08:15:22,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:22,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150715383] [2024-11-20 08:15:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:22,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 08:15:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 08:15:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:15:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:15:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 08:15:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 08:15:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 08:15:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:15:23,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:23,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150715383] [2024-11-20 08:15:23,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150715383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:23,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:23,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:15:23,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398029374] [2024-11-20 08:15:23,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:23,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:15:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:23,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:15:23,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:15:23,265 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:15:23,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:23,293 INFO L93 Difference]: Finished difference Result 103 states and 178 transitions. [2024-11-20 08:15:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:15:23,297 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 123 [2024-11-20 08:15:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:23,304 INFO L225 Difference]: With dead ends: 103 [2024-11-20 08:15:23,304 INFO L226 Difference]: Without dead ends: 51 [2024-11-20 08:15:23,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:15:23,311 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:23,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:15:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-20 08:15:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-20 08:15:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 08:15:23,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2024-11-20 08:15:23,360 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 123 [2024-11-20 08:15:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:23,361 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2024-11-20 08:15:23,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-20 08:15:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2024-11-20 08:15:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 08:15:23,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:23,367 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:23,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:15:23,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:23,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:23,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1217728759, now seen corresponding path program 1 times [2024-11-20 08:15:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:23,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965483557] [2024-11-20 08:15:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 08:15:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 08:15:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:15:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:15:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 08:15:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 08:15:26,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 08:15:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:15:26,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965483557] [2024-11-20 08:15:26,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965483557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:26,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:26,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 08:15:26,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651333024] [2024-11-20 08:15:26,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:26,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:15:26,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:26,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:15:26,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:15:26,715 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:15:28,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:28,074 INFO L93 Difference]: Finished difference Result 92 states and 124 transitions. [2024-11-20 08:15:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 08:15:28,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2024-11-20 08:15:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:28,077 INFO L225 Difference]: With dead ends: 92 [2024-11-20 08:15:28,077 INFO L226 Difference]: Without dead ends: 90 [2024-11-20 08:15:28,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-20 08:15:28,079 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 59 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:28,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 399 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 08:15:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-20 08:15:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2024-11-20 08:15:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 08:15:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 104 transitions. [2024-11-20 08:15:28,104 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 104 transitions. Word has length 123 [2024-11-20 08:15:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:28,104 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 104 transitions. [2024-11-20 08:15:28,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:15:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 104 transitions. [2024-11-20 08:15:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-20 08:15:28,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:28,112 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:28,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 08:15:28,113 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:28,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1274987061, now seen corresponding path program 1 times [2024-11-20 08:15:28,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:28,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941035478] [2024-11-20 08:15:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 08:15:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 08:15:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:15:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:15:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 08:15:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 08:15:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 08:15:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:15:28,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:28,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941035478] [2024-11-20 08:15:28,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941035478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:28,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:28,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 08:15:28,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262158725] [2024-11-20 08:15:28,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:28,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 08:15:28,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:28,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 08:15:28,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:15:28,296 INFO L87 Difference]: Start difference. First operand 74 states and 104 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:15:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:28,320 INFO L93 Difference]: Finished difference Result 141 states and 200 transitions. [2024-11-20 08:15:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 08:15:28,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 123 [2024-11-20 08:15:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:28,324 INFO L225 Difference]: With dead ends: 141 [2024-11-20 08:15:28,325 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 08:15:28,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 08:15:28,329 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:28,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:15:28,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 08:15:28,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-20 08:15:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 44 states have internal predecessors, (49), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 08:15:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2024-11-20 08:15:28,362 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 123 [2024-11-20 08:15:28,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:28,363 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2024-11-20 08:15:28,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:15:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2024-11-20 08:15:28,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-20 08:15:28,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:15:28,368 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 08:15:28,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 08:15:28,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:15:28,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:15:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash 453110410, now seen corresponding path program 1 times [2024-11-20 08:15:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:15:28,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883830958] [2024-11-20 08:15:28,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:15:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:15:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:15:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 08:15:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 08:15:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 08:15:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 08:15:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 08:15:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 08:15:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 08:15:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 08:15:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 08:15:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 08:15:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 08:15:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 08:15:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 08:15:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 08:15:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 08:15:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 08:15:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 08:15:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 08:15:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 08:15:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:15:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-20 08:15:31,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:15:31,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883830958] [2024-11-20 08:15:31,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883830958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:15:31,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:15:31,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 08:15:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158735332] [2024-11-20 08:15:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:15:31,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:15:31,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:15:31,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:15:31,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:15:31,565 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:15:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:15:32,336 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2024-11-20 08:15:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 08:15:32,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 124 [2024-11-20 08:15:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:15:32,338 INFO L225 Difference]: With dead ends: 75 [2024-11-20 08:15:32,338 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 08:15:32,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-20 08:15:32,340 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 30 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 08:15:32,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 428 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 08:15:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 08:15:32,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 08:15:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 08:15:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 08:15:32,344 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2024-11-20 08:15:32,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:15:32,345 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 08:15:32,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 08:15:32,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 08:15:32,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 08:15:32,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:15:32,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 08:15:32,351 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 08:15:32,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 08:15:34,524 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:15:34,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:15:34 BoogieIcfgContainer [2024-11-20 08:15:34,568 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:15:34,569 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:15:34,569 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:15:34,569 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:15:34,569 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:15:22" (3/4) ... [2024-11-20 08:15:34,572 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 08:15:34,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 08:15:34,581 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-20 08:15:34,582 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 08:15:34,582 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 08:15:34,582 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 08:15:34,676 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 08:15:34,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 08:15:34,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:15:34,677 INFO L158 Benchmark]: Toolchain (without parser) took 13032.38ms. Allocated memory was 188.7MB in the beginning and 358.6MB in the end (delta: 169.9MB). Free memory was 158.6MB in the beginning and 186.5MB in the end (delta: -27.9MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. [2024-11-20 08:15:34,677 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:15:34,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.78ms. Allocated memory is still 188.7MB. Free memory was 158.6MB in the beginning and 143.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 08:15:34,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.15ms. Allocated memory is still 188.7MB. Free memory was 143.9MB in the beginning and 139.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:15:34,678 INFO L158 Benchmark]: Boogie Preprocessor took 66.52ms. Allocated memory is still 188.7MB. Free memory was 139.7MB in the beginning and 134.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 08:15:34,678 INFO L158 Benchmark]: RCFGBuilder took 531.19ms. Allocated memory is still 188.7MB. Free memory was 134.5MB in the beginning and 146.0MB in the end (delta: -11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 08:15:34,679 INFO L158 Benchmark]: TraceAbstraction took 11905.75ms. Allocated memory was 188.7MB in the beginning and 358.6MB in the end (delta: 169.9MB). Free memory was 145.0MB in the beginning and 191.7MB in the end (delta: -46.7MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. [2024-11-20 08:15:34,679 INFO L158 Benchmark]: Witness Printer took 107.94ms. Allocated memory is still 358.6MB. Free memory was 191.7MB in the beginning and 186.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:15:34,681 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.15ms. Allocated memory is still 109.1MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.78ms. Allocated memory is still 188.7MB. Free memory was 158.6MB in the beginning and 143.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.15ms. Allocated memory is still 188.7MB. Free memory was 143.9MB in the beginning and 139.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.52ms. Allocated memory is still 188.7MB. Free memory was 139.7MB in the beginning and 134.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 531.19ms. Allocated memory is still 188.7MB. Free memory was 134.5MB in the beginning and 146.0MB in the end (delta: -11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11905.75ms. Allocated memory was 188.7MB in the beginning and 358.6MB in the end (delta: 169.9MB). Free memory was 145.0MB in the beginning and 191.7MB in the end (delta: -46.7MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. * Witness Printer took 107.94ms. Allocated memory is still 358.6MB. Free memory was 191.7MB in the beginning and 186.5MB 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, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 1045 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 724 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 321 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, InterpolantAutomatonStates: 22, 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, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 489 ConstructedInterpolants, 0 QuantifiedInterpolants, 1586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3040/3040 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: 108]: Loop Invariant Derived loop invariant: ((((var_1_9 == 0) && (((((((var_1_15 * 65535) + var_1_8) + var_1_16) % 65536) == var_1_13) || (var_1_16 < (var_1_17 + 1))) || (((2 % var_1_15) * (var_1_8 / var_1_14)) < var_1_12))) && (((var_1_17 < var_1_16) || (((2 % var_1_15) * (var_1_8 / var_1_14)) < var_1_12)) || (((((var_1_15 * 65535) + var_1_8) + var_1_17) % 65536) == var_1_13))) || ((((((((((long long) var_1_18 + 4) == 0) && (var_1_1 == 0)) && (var_1_8 == var_1_19)) && (0 <= 0)) && (var_1_20 == var_1_12)) && (((((((var_1_15 * 65535) + var_1_8) + var_1_16) % 65536) == var_1_13) || (var_1_16 < (var_1_17 + 1))) || (((2 % var_1_15) * (var_1_8 / var_1_14)) < var_1_12))) && (var_1_8 == var_1_12)) && (((var_1_17 < var_1_16) || (((2 % var_1_15) * (var_1_8 / var_1_14)) < var_1_12)) || (((((var_1_15 * 65535) + var_1_8) + var_1_17) % 65536) == var_1_13)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (var_1_19 == \old(var_1_19))) && (var_1_20 == \old(var_1_20))) && (last_1_var_1_13 == \old(last_1_var_1_13))) && (last_1_var_1_20 == \old(last_1_var_1_20))) RESULT: Ultimate proved your program to be correct! [2024-11-20 08:15:34,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE