./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-56.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 7f5f1ca3146cd2019b0f547ef0aea9581be4eafb97b41143c289b9e58717caae --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:50:00,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:50:00,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:50:00,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:50:00,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:50:00,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:50:00,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:50:00,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:50:00,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:50:00,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:50:00,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:50:00,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:50:00,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:50:00,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:50:00,771 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:50:00,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:50:00,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:50:00,772 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:50:00,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:50:00,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:50:00,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:50:00,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:50:00,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:50:00,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:50:00,777 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:50:00,777 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:50:00,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:50:00,777 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:50:00,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:50:00,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:50:00,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:50:00,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:50:00,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:50:00,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:50:00,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:50:00,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:50:00,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:50:00,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:50:00,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:50:00,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:50:00,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:50:00,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:50:00,781 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 -> 7f5f1ca3146cd2019b0f547ef0aea9581be4eafb97b41143c289b9e58717caae [2024-11-08 22:50:01,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:50:01,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:50:01,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:50:01,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:50:01,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:50:01,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-56.i [2024-11-08 22:50:02,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:50:02,685 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:50:02,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-56.i [2024-11-08 22:50:02,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca546e7e/33ca715ed4aa4e7ca322189cfa2a7aca/FLAG89a3ce0dc [2024-11-08 22:50:03,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca546e7e/33ca715ed4aa4e7ca322189cfa2a7aca [2024-11-08 22:50:03,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:50:03,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:50:03,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:50:03,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:50:03,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:50:03,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cb1e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03, skipping insertion in model container [2024-11-08 22:50:03,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,110 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:50:03,296 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_fillercode_fillercodestructure_normal_file-56.i[913,926] [2024-11-08 22:50:03,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:50:03,390 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:50:03,400 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_fillercode_fillercodestructure_normal_file-56.i[913,926] [2024-11-08 22:50:03,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:50:03,448 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:50:03,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03 WrapperNode [2024-11-08 22:50:03,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:50:03,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:50:03,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:50:03,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:50:03,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,516 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-08 22:50:03,517 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:50:03,518 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:50:03,518 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:50:03,518 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:50:03,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,571 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:50:03,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:50:03,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:50:03,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:50:03,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:50:03,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (1/1) ... [2024-11-08 22:50:03,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:50:03,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:50:03,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:50:03,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:50:03,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:50:03,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:50:03,696 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:50:03,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:50:03,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:50:03,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:50:03,782 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:50:03,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:50:04,086 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 22:50:04,087 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:50:04,103 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:50:04,103 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:50:04,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:50:04 BoogieIcfgContainer [2024-11-08 22:50:04,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:50:04,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:50:04,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:50:04,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:50:04,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:50:03" (1/3) ... [2024-11-08 22:50:04,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f63081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:50:04, skipping insertion in model container [2024-11-08 22:50:04,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:50:03" (2/3) ... [2024-11-08 22:50:04,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51f63081 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:50:04, skipping insertion in model container [2024-11-08 22:50:04,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:50:04" (3/3) ... [2024-11-08 22:50:04,115 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-56.i [2024-11-08 22:50:04,130 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:50:04,130 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:50:04,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:50:04,258 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;@633b1d73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:50:04,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:50:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:50:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 22:50:04,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:50:04,284 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:50:04,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:50:04,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:50:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash -740184149, now seen corresponding path program 1 times [2024-11-08 22:50:04,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:50:04,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346316491] [2024-11-08 22:50:04,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:50:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:50:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:50:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:50:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:50:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:50:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:50:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:50:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:50:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:50:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:50:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:50:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:50:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:50:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:50:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:50:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:50:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:50:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:50:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:50:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:50:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:50:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:50:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:04,674 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:50:04,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:50:04,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346316491] [2024-11-08 22:50:04,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346316491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:50:04,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:50:04,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:50:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126493213] [2024-11-08 22:50:04,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:50:04,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:50:04,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:50:04,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:50:04,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:50:04,707 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:50:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:50:04,734 INFO L93 Difference]: Finished difference Result 117 states and 202 transitions. [2024-11-08 22:50:04,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:50:04,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-08 22:50:04,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:50:04,743 INFO L225 Difference]: With dead ends: 117 [2024-11-08 22:50:04,744 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 22:50:04,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:50:04,749 INFO L432 NwaCegarLoop]: 86 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, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:50:04,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:50:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 22:50:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 22:50:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:50:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-11-08 22:50:04,802 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 139 [2024-11-08 22:50:04,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:50:04,802 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-11-08 22:50:04,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 22:50:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-11-08 22:50:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 22:50:04,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:50:04,807 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:50:04,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:50:04,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:50:04,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:50:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1981958379, now seen corresponding path program 1 times [2024-11-08 22:50:04,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:50:04,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864381984] [2024-11-08 22:50:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:50:04,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:50:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:50:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:50:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:50:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:50:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:50:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:50:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:50:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:50:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:50:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:50:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:50:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:50:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:50:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:50:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:50:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:50:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:50:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:50:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:50:05,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:50:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:50:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:50:05,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:50:05,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864381984] [2024-11-08 22:50:05,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864381984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:50:05,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:50:05,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:50:05,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290580972] [2024-11-08 22:50:05,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:50:05,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:50:05,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:50:05,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:50:05,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:50:05,471 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:50:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:50:05,525 INFO L93 Difference]: Finished difference Result 113 states and 169 transitions. [2024-11-08 22:50:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:50:05,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-11-08 22:50:05,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:50:05,531 INFO L225 Difference]: With dead ends: 113 [2024-11-08 22:50:05,532 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 22:50:05,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:50:05,535 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:50:05,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:50:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 22:50:05,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 22:50:05,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 22:50:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2024-11-08 22:50:05,550 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 139 [2024-11-08 22:50:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:50:05,552 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2024-11-08 22:50:05,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:50:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2024-11-08 22:50:05,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 22:50:05,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:50:05,555 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:50:05,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:50:05,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:50:05,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:50:05,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1924700077, now seen corresponding path program 1 times [2024-11-08 22:50:05,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:50:05,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021658791] [2024-11-08 22:50:05,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:50:05,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:50:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:50:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:50:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:50:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:50:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:50:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:50:06,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:50:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:50:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:50:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:50:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:50:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:50:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:50:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:50:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:50:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:50:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:50:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:50:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:50:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:50:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:50:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:50:06,320 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 22:50:06,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:50:06,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021658791] [2024-11-08 22:50:06,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021658791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:50:06,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:50:06,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:50:06,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154472057] [2024-11-08 22:50:06,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:50:06,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:50:06,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:50:06,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:50:06,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:50:06,326 INFO L87 Difference]: Start difference. First operand 58 states and 85 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:50:06,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:50:06,436 INFO L93 Difference]: Finished difference Result 155 states and 221 transitions. [2024-11-08 22:50:06,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:50:06,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-11-08 22:50:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:50:06,441 INFO L225 Difference]: With dead ends: 155 [2024-11-08 22:50:06,441 INFO L226 Difference]: Without dead ends: 100 [2024-11-08 22:50:06,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:50:06,445 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:50:06,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 264 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:50:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-08 22:50:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2024-11-08 22:50:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.25) internal successors, (70), 57 states have internal predecessors, (70), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 22:50:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-11-08 22:50:06,466 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 139 [2024-11-08 22:50:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:50:06,467 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-11-08 22:50:06,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 22:50:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-11-08 22:50:06,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 22:50:06,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:50:06,471 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:50:06,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:50:06,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:50:06,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:50:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1115353451, now seen corresponding path program 1 times [2024-11-08 22:50:06,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:50:06,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868448841] [2024-11-08 22:50:06,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:50:06,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:50:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat