./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-59.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 d3b03823011e7472edac4d496fa9649145126d89af08fba6213c0cfdb5c29eb5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:06:26,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:06:26,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:06:26,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:06:26,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:06:26,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:06:26,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:06:26,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:06:26,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:06:26,926 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:06:26,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:06:26,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:06:26,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:06:26,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:06:26,929 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:06:26,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:06:26,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:06:26,930 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:06:26,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:06:26,931 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:06:26,931 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:06:26,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:06:26,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:06:26,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:06:26,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:06:26,932 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:06:26,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:06:26,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:06:26,933 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:06:26,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:06:26,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:06:26,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:06:26,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:06:26,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:06:26,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:06:26,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:06:26,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:06:26,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:06:26,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:06:26,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:06:26,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:06:26,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:06:26,938 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 -> d3b03823011e7472edac4d496fa9649145126d89af08fba6213c0cfdb5c29eb5 [2024-11-10 09:06:27,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:06:27,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:06:27,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:06:27,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:06:27,271 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:06:27,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-59.i [2024-11-10 09:06:28,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:06:29,020 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:06:29,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-59.i [2024-11-10 09:06:29,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab063ea5/f4380a8d0e414eb49dae1d03d8b1f8f6/FLAG8e334aa52 [2024-11-10 09:06:29,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ab063ea5/f4380a8d0e414eb49dae1d03d8b1f8f6 [2024-11-10 09:06:29,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:06:29,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:06:29,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:06:29,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:06:29,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:06:29,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ce255d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29, skipping insertion in model container [2024-11-10 09:06:29,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:06:29,640 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-59.i[913,926] [2024-11-10 09:06:29,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:06:29,714 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:06:29,727 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-59.i[913,926] [2024-11-10 09:06:29,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:06:29,768 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:06:29,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29 WrapperNode [2024-11-10 09:06:29,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:06:29,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:06:29,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:06:29,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:06:29,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,815 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-10 09:06:29,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:06:29,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:06:29,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:06:29,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:06:29,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,843 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-10 09:06:29,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,852 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:06:29,857 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:06:29,857 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:06:29,857 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:06:29,858 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (1/1) ... [2024-11-10 09:06:29,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:06:29,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:06:29,894 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-10 09:06:29,896 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-10 09:06:29,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:06:29,937 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:06:29,937 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:06:29,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:06:29,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:06:29,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:06:30,007 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:06:30,009 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:06:30,301 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 09:06:30,302 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:06:30,318 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:06:30,318 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:06:30,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:06:30 BoogieIcfgContainer [2024-11-10 09:06:30,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:06:30,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:06:30,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:06:30,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:06:30,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:06:29" (1/3) ... [2024-11-10 09:06:30,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428b42a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:06:30, skipping insertion in model container [2024-11-10 09:06:30,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:06:29" (2/3) ... [2024-11-10 09:06:30,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428b42a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:06:30, skipping insertion in model container [2024-11-10 09:06:30,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:06:30" (3/3) ... [2024-11-10 09:06:30,328 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-59.i [2024-11-10 09:06:30,347 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:06:30,348 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:06:30,411 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:06:30,417 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;@3510068e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:06:30,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:06:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:06:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:06:30,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:30,434 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:06:30,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:30,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:30,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2146883478, now seen corresponding path program 1 times [2024-11-10 09:06:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:06:30,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369674250] [2024-11-10 09:06:30,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:06:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:06:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:06:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:06:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:06:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:06:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:06:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:06:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:06:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:06:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:06:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:06:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:06:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:06:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 09:06:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 09:06:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 09:06:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 09:06:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:06:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 09:06:30,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:06:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369674250] [2024-11-10 09:06:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369674250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:30,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:30,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:06:30,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885539927] [2024-11-10 09:06:30,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:30,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:06:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:06:30,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:06:30,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:06:30,885 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 35 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:06:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:30,909 INFO L93 Difference]: Finished difference Result 102 states and 173 transitions. [2024-11-10 09:06:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:06:30,912 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-10 09:06:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:30,922 INFO L225 Difference]: With dead ends: 102 [2024-11-10 09:06:30,922 INFO L226 Difference]: Without dead ends: 50 [2024-11-10 09:06:30,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-10 09:06:30,931 INFO L432 NwaCegarLoop]: 73 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, 73 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-10 09:06:30,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:06:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-10 09:06:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-10 09:06:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 09:06:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2024-11-10 09:06:30,974 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 113 [2024-11-10 09:06:30,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:30,975 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2024-11-10 09:06:30,975 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 09:06:30,976 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2024-11-10 09:06:30,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-10 09:06:30,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:30,979 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:06:30,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:06:30,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:30,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash -186377270, now seen corresponding path program 1 times [2024-11-10 09:06:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:06:30,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017766989] [2024-11-10 09:06:30,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:06:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:06:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:06:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:06:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:06:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:06:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:06:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:06:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:06:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:06:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:06:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:06:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:06:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:06:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 09:06:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 09:06:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 09:06:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 09:06:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:06:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 09:06:31,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:06:31,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017766989] [2024-11-10 09:06:31,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017766989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:31,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:31,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:06:31,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660953351] [2024-11-10 09:06:31,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:31,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:06:31,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:06:31,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:06:31,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:06:31,596 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:31,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:31,852 INFO L93 Difference]: Finished difference Result 146 states and 215 transitions. [2024-11-10 09:06:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:06:31,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-10 09:06:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:31,856 INFO L225 Difference]: With dead ends: 146 [2024-11-10 09:06:31,856 INFO L226 Difference]: Without dead ends: 99 [2024-11-10 09:06:31,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:06:31,859 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 43 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:06:31,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 184 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:06:31,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-10 09:06:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2024-11-10 09:06:31,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:06:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 128 transitions. [2024-11-10 09:06:31,897 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 128 transitions. Word has length 113 [2024-11-10 09:06:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:31,898 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 128 transitions. [2024-11-10 09:06:31,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:31,901 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 128 transitions. [2024-11-10 09:06:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-10 09:06:31,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:31,904 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:06:31,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:06:31,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:31,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:31,905 INFO L85 PathProgramCache]: Analyzing trace with hash -777554177, now seen corresponding path program 1 times [2024-11-10 09:06:31,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:06:31,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273225775] [2024-11-10 09:06:31,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:31,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:06:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:06:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:06:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:06:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:06:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:06:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:06:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:06:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:06:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:06:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:06:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:06:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:06:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:06:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 09:06:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 09:06:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 09:06:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 09:06:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:06:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 09:06:39,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:06:39,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273225775] [2024-11-10 09:06:39,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273225775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:39,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:39,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:06:39,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959998117] [2024-11-10 09:06:39,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:39,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:06:39,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:06:39,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:06:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:06:39,780 INFO L87 Difference]: Start difference. First operand 87 states and 128 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:40,287 INFO L93 Difference]: Finished difference Result 109 states and 154 transitions. [2024-11-10 09:06:40,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:06:40,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-10 09:06:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:40,290 INFO L225 Difference]: With dead ends: 109 [2024-11-10 09:06:40,290 INFO L226 Difference]: Without dead ends: 106 [2024-11-10 09:06:40,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:06:40,291 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 37 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:06:40,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 300 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:06:40,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-10 09:06:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2024-11-10 09:06:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:06:40,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-11-10 09:06:40,312 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 114 [2024-11-10 09:06:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:40,312 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-11-10 09:06:40,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-11-10 09:06:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 09:06:40,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:40,315 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:06:40,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:06:40,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:40,317 INFO L85 PathProgramCache]: Analyzing trace with hash 919011464, now seen corresponding path program 1 times [2024-11-10 09:06:40,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:06:40,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817588215] [2024-11-10 09:06:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:40,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:06:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:06:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:06:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:06:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:06:42,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:06:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:06:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:06:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:06:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:06:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:06:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:06:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:06:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:06:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 09:06:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 09:06:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 09:06:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 09:06:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:06:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:42,422 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 09:06:42,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:06:42,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817588215] [2024-11-10 09:06:42,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817588215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:42,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:42,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:06:42,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966560666] [2024-11-10 09:06:42,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:42,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:06:42,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:06:42,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:06:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:06:42,425 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:43,027 INFO L93 Difference]: Finished difference Result 127 states and 178 transitions. [2024-11-10 09:06:43,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 09:06:43,027 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-10 09:06:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:43,029 INFO L225 Difference]: With dead ends: 127 [2024-11-10 09:06:43,029 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 09:06:43,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-10 09:06:43,031 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 49 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:06:43,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 311 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:06:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 09:06:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2024-11-10 09:06:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:06:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2024-11-10 09:06:43,048 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 115 [2024-11-10 09:06:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:43,049 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2024-11-10 09:06:43,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2024-11-10 09:06:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 09:06:43,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:43,051 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:06:43,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 09:06:43,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:43,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:43,052 INFO L85 PathProgramCache]: Analyzing trace with hash 232709569, now seen corresponding path program 1 times [2024-11-10 09:06:43,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:06:43,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559228049] [2024-11-10 09:06:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:06:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:06:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:06:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:06:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:06:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:06:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:06:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:06:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:06:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:06:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:06:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:06:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:06:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:06:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 09:06:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 09:06:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 09:06:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 09:06:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:06:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 09:06:45,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:06:45,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559228049] [2024-11-10 09:06:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559228049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:45,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:45,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:06:45,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342722014] [2024-11-10 09:06:45,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:45,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:06:45,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:06:45,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:06:45,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:06:45,234 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:45,869 INFO L93 Difference]: Finished difference Result 131 states and 183 transitions. [2024-11-10 09:06:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 09:06:45,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-10 09:06:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:45,871 INFO L225 Difference]: With dead ends: 131 [2024-11-10 09:06:45,872 INFO L226 Difference]: Without dead ends: 128 [2024-11-10 09:06:45,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:06:45,874 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 61 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 09:06:45,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 282 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 09:06:45,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-10 09:06:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 94. [2024-11-10 09:06:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:06:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2024-11-10 09:06:45,896 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 116 [2024-11-10 09:06:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:45,896 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2024-11-10 09:06:45,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2024-11-10 09:06:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-10 09:06:45,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:45,903 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:06:45,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 09:06:45,903 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:45,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:45,904 INFO L85 PathProgramCache]: Analyzing trace with hash 770481911, now seen corresponding path program 1 times [2024-11-10 09:06:45,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:06:45,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445879513] [2024-11-10 09:06:45,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:45,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:06:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:06:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:06:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:06:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:06:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:06:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:06:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:06:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:06:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:06:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:06:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:06:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:06:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:06:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 09:06:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 09:06:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 09:06:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 09:06:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:06:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 09:06:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 09:06:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 09:06:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:06:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 09:06:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 09:06:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 09:06:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 09:06:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 09:06:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 09:06:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 09:06:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 09:06:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 09:06:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 09:06:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 09:06:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-10 09:06:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-10 09:06:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-10 09:06:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2551 trivial. 0 not checked. [2024-11-10 09:06:51,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:06:51,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445879513] [2024-11-10 09:06:51,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445879513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:51,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:51,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 09:06:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288757925] [2024-11-10 09:06:51,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:51,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 09:06:51,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:06:51,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 09:06:51,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 09:06:51,580 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:52,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:52,383 INFO L93 Difference]: Finished difference Result 112 states and 160 transitions. [2024-11-10 09:06:52,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 09:06:52,384 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 224 [2024-11-10 09:06:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:52,385 INFO L225 Difference]: With dead ends: 112 [2024-11-10 09:06:52,386 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 09:06:52,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 09:06:52,387 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 19 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 09:06:52,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 307 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 09:06:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 09:06:52,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2024-11-10 09:06:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:06:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-11-10 09:06:52,398 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 224 [2024-11-10 09:06:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:52,399 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-11-10 09:06:52,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-11-10 09:06:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-10 09:06:52,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:52,402 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:06:52,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 09:06:52,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:52,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:52,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2097614035, now seen corresponding path program 1 times [2024-11-10 09:06:52,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:06:52,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636263087] [2024-11-10 09:06:52,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:52,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:06:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:06:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:06:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:06:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:06:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:06:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:06:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:06:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:06:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:06:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:06:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:06:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:06:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:06:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 09:06:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 09:06:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 09:06:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 09:06:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:06:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 09:06:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 09:06:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 09:06:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:06:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 09:06:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 09:06:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 09:06:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 09:06:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 09:06:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 09:06:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 09:06:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 09:06:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 09:06:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 09:06:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 09:06:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-10 09:06:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-10 09:06:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-10 09:06:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2551 trivial. 0 not checked. [2024-11-10 09:06:54,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:06:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636263087] [2024-11-10 09:06:54,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636263087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:54,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:54,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:06:54,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012839995] [2024-11-10 09:06:54,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:54,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:06:54,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:06:54,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:06:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:06:54,370 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:54,789 INFO L93 Difference]: Finished difference Result 124 states and 175 transitions. [2024-11-10 09:06:54,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 09:06:54,790 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 225 [2024-11-10 09:06:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:54,792 INFO L225 Difference]: With dead ends: 124 [2024-11-10 09:06:54,792 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 09:06:54,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-10 09:06:54,793 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 53 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:06:54,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 325 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:06:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 09:06:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 93. [2024-11-10 09:06:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.2037037037037037) internal successors, (65), 54 states have internal predecessors, (65), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 09:06:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 137 transitions. [2024-11-10 09:06:54,804 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 137 transitions. Word has length 225 [2024-11-10 09:06:54,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:54,805 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 137 transitions. [2024-11-10 09:06:54,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 137 transitions. [2024-11-10 09:06:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-10 09:06:54,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:06:54,808 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:06:54,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 09:06:54,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:06:54,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:06:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1348138470, now seen corresponding path program 1 times [2024-11-10 09:06:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:06:54,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338706255] [2024-11-10 09:06:54,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:06:54,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:06:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:06:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:06:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:06:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 09:06:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 09:06:56,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 09:06:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 09:06:56,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 09:06:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 09:06:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 09:06:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 09:06:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:06:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:06:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 09:06:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 09:06:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 09:06:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 09:06:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:06:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 09:06:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 09:06:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 09:06:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 09:06:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 09:06:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 09:06:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 09:06:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 09:06:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 09:06:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-10 09:06:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 09:06:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:56,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-10 09:06:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:57,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 09:06:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:57,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-10 09:06:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 09:06:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:57,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-10 09:06:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:57,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-10 09:06:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-10 09:06:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:06:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2551 trivial. 0 not checked. [2024-11-10 09:06:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:06:57,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338706255] [2024-11-10 09:06:57,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338706255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:06:57,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:06:57,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 09:06:57,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367963659] [2024-11-10 09:06:57,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:06:57,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 09:06:57,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:06:57,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 09:06:57,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:06:57,011 INFO L87 Difference]: Start difference. First operand 93 states and 137 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:57,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:06:57,591 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2024-11-10 09:06:57,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 09:06:57,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 226 [2024-11-10 09:06:57,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:06:57,592 INFO L225 Difference]: With dead ends: 121 [2024-11-10 09:06:57,592 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 09:06:57,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-10 09:06:57,594 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 46 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 09:06:57,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 363 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 09:06:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 09:06:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 09:06:57,595 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-10 09:06:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 09:06:57,595 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2024-11-10 09:06:57,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:06:57,595 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 09:06:57,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 09:06:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 09:06:57,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 09:06:57,599 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:06:57,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 09:06:57,602 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:06:57,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 09:06:57,642 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:06:57,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:06:57 BoogieIcfgContainer [2024-11-10 09:06:57,670 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:06:57,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:06:57,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:06:57,672 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:06:57,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:06:30" (3/4) ... [2024-11-10 09:06:57,675 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 09:06:57,679 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-10 09:06:57,686 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2024-11-10 09:06:57,686 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 09:06:57,687 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 09:06:57,687 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 09:06:57,782 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 09:06:57,782 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 09:06:57,782 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:06:57,783 INFO L158 Benchmark]: Toolchain (without parser) took 28388.35ms. Allocated memory was 176.2MB in the beginning and 851.4MB in the end (delta: 675.3MB). Free memory was 120.3MB in the beginning and 462.5MB in the end (delta: -342.1MB). Peak memory consumption was 335.1MB. Max. memory is 16.1GB. [2024-11-10 09:06:57,783 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:06:57,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.41ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 106.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 09:06:57,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.08ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:06:57,784 INFO L158 Benchmark]: Boogie Preprocessor took 40.16ms. Allocated memory is still 176.2MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:06:57,784 INFO L158 Benchmark]: IcfgBuilder took 462.12ms. Allocated memory is still 176.2MB. Free memory was 101.9MB in the beginning and 85.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 09:06:57,784 INFO L158 Benchmark]: TraceAbstraction took 27349.18ms. Allocated memory was 176.2MB in the beginning and 851.4MB in the end (delta: 675.3MB). Free memory was 84.7MB in the beginning and 468.8MB in the end (delta: -384.1MB). Peak memory consumption was 293.1MB. Max. memory is 16.1GB. [2024-11-10 09:06:57,785 INFO L158 Benchmark]: Witness Printer took 110.86ms. Allocated memory is still 851.4MB. Free memory was 468.8MB in the beginning and 462.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 09:06:57,786 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 176.2MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.41ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 106.1MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.08ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.16ms. Allocated memory is still 176.2MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 462.12ms. Allocated memory is still 176.2MB. Free memory was 101.9MB in the beginning and 85.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 27349.18ms. Allocated memory was 176.2MB in the beginning and 851.4MB in the end (delta: 675.3MB). Free memory was 84.7MB in the beginning and 468.8MB in the end (delta: -384.1MB). Peak memory consumption was 293.1MB. Max. memory is 16.1GB. * Witness Printer took 110.86ms. Allocated memory is still 851.4MB. Free memory was 468.8MB in the beginning and 462.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 8, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 308 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 308 mSDsluCounter, 2145 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1594 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 900 IncrementalHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 551 mSDtfsCounter, 900 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 507 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=4, InterpolantAutomatonStates: 76, 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, 134 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 1246 NumberOfCodeBlocks, 1246 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1238 ConstructedInterpolants, 0 QuantifiedInterpolants, 4353 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 10730/10730 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: 105]: Location Invariant Derived location invariant: null - 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_4 == \old(var_1_4))) && (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_11 == \old(var_1_11))) && (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))) && (last_1_var_1_1 == \old(last_1_var_1_1))) && (last_1_var_1_7 == \old(last_1_var_1_7))) && (last_1_var_1_12 == \old(last_1_var_1_12))) RESULT: Ultimate proved your program to be correct! [2024-11-10 09:06:57,844 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