./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-52.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 860048a24abd15d6568a41ffd17ac25bbefe747caeaf9a3976a4e57ac9819130 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:53:07,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:53:07,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 03:53:07,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:53:07,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:53:07,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:53:07,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:53:07,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:53:07,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:53:07,571 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:53:07,572 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:53:07,572 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:53:07,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:53:07,573 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:53:07,573 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:53:07,573 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:53:07,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:53:07,574 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:53:07,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 03:53:07,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:53:07,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:53:07,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:53:07,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:53:07,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:53:07,576 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:53:07,577 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:53:07,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:53:07,577 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:53:07,577 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:53:07,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:53:07,578 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:53:07,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:53:07,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:53:07,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:53:07,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:53:07,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:53:07,579 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 03:53:07,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 03:53:07,579 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:53:07,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:53:07,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:53:07,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:53:07,581 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 -> 860048a24abd15d6568a41ffd17ac25bbefe747caeaf9a3976a4e57ac9819130 [2024-11-20 03:53:07,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:53:07,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:53:07,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:53:07,864 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:53:07,864 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:53:07,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-52.i [2024-11-20 03:53:09,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:53:09,294 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:53:09,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-52.i [2024-11-20 03:53:09,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e00c312b/3df33099ec7d454cb8758d9ff8ea3b3c/FLAG7edc1e915 [2024-11-20 03:53:09,678 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e00c312b/3df33099ec7d454cb8758d9ff8ea3b3c [2024-11-20 03:53:09,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:53:09,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:53:09,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:53:09,684 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:53:09,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:53:09,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:09,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e208962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09, skipping insertion in model container [2024-11-20 03:53:09,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:09,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:53:09,856 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_fillercodesize_ps-cn-50_file-52.i[915,928] [2024-11-20 03:53:09,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:53:09,913 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:53:09,921 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_fillercodesize_ps-cn-50_file-52.i[915,928] [2024-11-20 03:53:09,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:53:09,974 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:53:09,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09 WrapperNode [2024-11-20 03:53:09,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:53:09,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:53:09,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:53:09,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:53:09,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:09,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:10,024 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2024-11-20 03:53:10,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:53:10,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:53:10,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:53:10,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:53:10,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:10,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:10,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:10,053 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 03:53:10,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:10,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:10,062 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:10,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:10,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:10,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:10,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:53:10,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:53:10,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:53:10,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:53:10,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (1/1) ... [2024-11-20 03:53:10,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:53:10,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:53:10,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 03:53:10,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 03:53:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:53:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:53:10,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:53:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 03:53:10,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:53:10,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:53:10,224 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:53:10,226 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:53:10,573 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-20 03:53:10,573 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:53:10,584 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:53:10,585 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:53:10,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:53:10 BoogieIcfgContainer [2024-11-20 03:53:10,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:53:10,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:53:10,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:53:10,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:53:10,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:53:09" (1/3) ... [2024-11-20 03:53:10,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6d61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:53:10, skipping insertion in model container [2024-11-20 03:53:10,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:53:09" (2/3) ... [2024-11-20 03:53:10,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6d61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:53:10, skipping insertion in model container [2024-11-20 03:53:10,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:53:10" (3/3) ... [2024-11-20 03:53:10,592 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-52.i [2024-11-20 03:53:10,604 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:53:10,604 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:53:10,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:53:10,666 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;@2ca3add1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:53:10,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:53:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 70 states have internal predecessors, (98), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 03:53:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-20 03:53:10,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:53:10,689 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:53:10,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:53:10,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:53:10,695 INFO L85 PathProgramCache]: Analyzing trace with hash 134201802, now seen corresponding path program 1 times [2024-11-20 03:53:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:53:10,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487184891] [2024-11-20 03:53:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:53:10,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:53:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:53:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:53:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:53:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:53:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:53:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:53:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:53:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:53:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:53:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:53:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:53:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:53:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:53:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:53:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:53:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:53:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:53:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:53:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:53:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:53:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:53:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:53:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:53:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:53:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:53:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:53:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 03:53:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:53:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:53:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:53:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 03:53:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 03:53:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 03:53:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 03:53:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-20 03:53:11,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:53:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487184891] [2024-11-20 03:53:11,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487184891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:53:11,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:53:11,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:53:11,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868137597] [2024-11-20 03:53:11,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:53:11,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:53:11,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:53:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:53:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:53:11,232 INFO L87 Difference]: Start difference. First operand has 106 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 70 states have internal predecessors, (98), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-20 03:53:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:53:11,271 INFO L93 Difference]: Finished difference Result 205 states and 360 transitions. [2024-11-20 03:53:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:53:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 219 [2024-11-20 03:53:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:53:11,299 INFO L225 Difference]: With dead ends: 205 [2024-11-20 03:53:11,299 INFO L226 Difference]: Without dead ends: 102 [2024-11-20 03:53:11,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:53:11,307 INFO L432 NwaCegarLoop]: 159 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, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 03:53:11,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:53:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-20 03:53:11,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-20 03:53:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.378787878787879) internal successors, (91), 66 states have internal predecessors, (91), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 03:53:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 159 transitions. [2024-11-20 03:53:11,397 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 159 transitions. Word has length 219 [2024-11-20 03:53:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:53:11,397 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 159 transitions. [2024-11-20 03:53:11,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-20 03:53:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 159 transitions. [2024-11-20 03:53:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-20 03:53:11,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:53:11,405 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:53:11,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 03:53:11,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:53:11,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:53:11,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1719561166, now seen corresponding path program 1 times [2024-11-20 03:53:11,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:53:11,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624576019] [2024-11-20 03:53:11,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:53:11,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:53:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:53:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:53:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:53:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:53:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:53:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:53:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:53:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:53:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:53:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:53:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:53:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:53:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:53:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:53:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:53:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:53:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:53:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:53:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:53:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:53:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:53:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:53:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:53:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:53:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:53:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:53:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 03:53:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:53:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:53:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:53:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 03:53:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 03:53:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 03:53:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 03:53:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-20 03:53:11,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:53:11,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624576019] [2024-11-20 03:53:11,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624576019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:53:11,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:53:11,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 03:53:11,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982694855] [2024-11-20 03:53:11,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:53:11,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:53:11,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:53:11,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:53:11,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:53:11,838 INFO L87 Difference]: Start difference. First operand 102 states and 159 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-20 03:53:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:53:12,064 INFO L93 Difference]: Finished difference Result 201 states and 315 transitions. [2024-11-20 03:53:12,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:53:12,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2024-11-20 03:53:12,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:53:12,070 INFO L225 Difference]: With dead ends: 201 [2024-11-20 03:53:12,070 INFO L226 Difference]: Without dead ends: 102 [2024-11-20 03:53:12,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 03:53:12,074 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 145 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:53:12,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 229 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:53:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-20 03:53:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-20 03:53:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 03:53:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 158 transitions. [2024-11-20 03:53:12,092 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 158 transitions. Word has length 219 [2024-11-20 03:53:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:53:12,095 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 158 transitions. [2024-11-20 03:53:12,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-20 03:53:12,096 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 158 transitions. [2024-11-20 03:53:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-20 03:53:12,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:53:12,101 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:53:12,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 03:53:12,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:53:12,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:53:12,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1295542452, now seen corresponding path program 1 times [2024-11-20 03:53:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:53:12,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111262930] [2024-11-20 03:53:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:53:12,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:53:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:53:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:53:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:53:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:53:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:53:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:53:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:53:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:53:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:53:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:53:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:53:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:53:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:53:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:53:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:53:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:53:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:53:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:53:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:53:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:53:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:53:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:53:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:53:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:53:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:53:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:53:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 03:53:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:53:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:53:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:53:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 03:53:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 03:53:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 03:53:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 03:53:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-20 03:53:12,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:53:12,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111262930] [2024-11-20 03:53:12,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111262930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:53:12,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:53:12,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 03:53:12,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681713020] [2024-11-20 03:53:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:53:12,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:53:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:53:12,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:53:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:53:12,487 INFO L87 Difference]: Start difference. First operand 102 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-20 03:53:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:53:12,648 INFO L93 Difference]: Finished difference Result 272 states and 422 transitions. [2024-11-20 03:53:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 03:53:12,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2024-11-20 03:53:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:53:12,650 INFO L225 Difference]: With dead ends: 272 [2024-11-20 03:53:12,651 INFO L226 Difference]: Without dead ends: 173 [2024-11-20 03:53:12,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 03:53:12,652 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 106 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 03:53:12,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 634 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 03:53:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-20 03:53:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2024-11-20 03:53:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 118 states have internal predecessors, (164), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 03:53:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 264 transitions. [2024-11-20 03:53:12,675 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 264 transitions. Word has length 219 [2024-11-20 03:53:12,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:53:12,675 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 264 transitions. [2024-11-20 03:53:12,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-20 03:53:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 264 transitions. [2024-11-20 03:53:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-20 03:53:12,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:53:12,678 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:53:12,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 03:53:12,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:53:12,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:53:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1429555958, now seen corresponding path program 1 times [2024-11-20 03:53:12,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:53:12,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72720447] [2024-11-20 03:53:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:53:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:53:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:53:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:53:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:53:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:53:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:53:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:53:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:53:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:53:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:53:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:53:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:53:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:53:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:53:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:53:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:53:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:53:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:53:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:53:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:53:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:53:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:53:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:53:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:53:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:53:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:53:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:53:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 03:53:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:53:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:53:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:53:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 03:53:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 03:53:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 03:53:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 03:53:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-20 03:53:12,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:53:12,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72720447] [2024-11-20 03:53:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72720447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:53:12,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:53:12,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 03:53:12,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234673379] [2024-11-20 03:53:12,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:53:12,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 03:53:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:53:12,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 03:53:12,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:53:12,978 INFO L87 Difference]: Start difference. First operand 170 states and 264 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-20 03:53:13,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:53:13,024 INFO L93 Difference]: Finished difference Result 470 states and 731 transitions. [2024-11-20 03:53:13,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 03:53:13,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2024-11-20 03:53:13,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:53:13,031 INFO L225 Difference]: With dead ends: 470 [2024-11-20 03:53:13,031 INFO L226 Difference]: Without dead ends: 303 [2024-11-20 03:53:13,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:53:13,034 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 98 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 353 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-20 03:53:13,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 353 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:53:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-20 03:53:13,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 300. [2024-11-20 03:53:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 211 states have (on average 1.4123222748815165) internal successors, (298), 214 states have internal predecessors, (298), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-20 03:53:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 466 transitions. [2024-11-20 03:53:13,083 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 466 transitions. Word has length 219 [2024-11-20 03:53:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:53:13,084 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 466 transitions. [2024-11-20 03:53:13,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-20 03:53:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 466 transitions. [2024-11-20 03:53:13,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-20 03:53:13,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:53:13,087 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:53:13,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 03:53:13,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:53:13,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:53:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash -474742395, now seen corresponding path program 1 times [2024-11-20 03:53:13,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:53:13,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958105486] [2024-11-20 03:53:13,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:53:13,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:53:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:53:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:21,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:53:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:21,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:53:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:21,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:53:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:21,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:53:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:21,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:53:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:21,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:53:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:53:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:53:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:53:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:53:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:53:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:53:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:53:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:53:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:53:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:53:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:53:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:53:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 03:53:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 03:53:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 03:53:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 03:53:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 03:53:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 03:53:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 03:53:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-20 03:53:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:53:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:53:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:53:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-20 03:53:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 03:53:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-20 03:53:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-20 03:53:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:53:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-20 03:53:22,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:53:22,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958105486] [2024-11-20 03:53:22,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958105486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:53:22,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:53:22,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-20 03:53:22,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571241813] [2024-11-20 03:53:22,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:53:22,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 03:53:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:53:22,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 03:53:22,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-11-20 03:53:22,825 INFO L87 Difference]: Start difference. First operand 300 states and 466 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-11-20 03:53:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:53:30,937 INFO L93 Difference]: Finished difference Result 725 states and 1082 transitions. [2024-11-20 03:53:30,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-20 03:53:30,938 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 220 [2024-11-20 03:53:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:53:30,941 INFO L225 Difference]: With dead ends: 725 [2024-11-20 03:53:30,942 INFO L226 Difference]: Without dead ends: 723 [2024-11-20 03:53:30,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=500, Invalid=1570, Unknown=0, NotChecked=0, Total=2070 [2024-11-20 03:53:30,943 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 471 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 03:53:30,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1208 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 03:53:30,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-11-20 03:53:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 545. [2024-11-20 03:53:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 420 states have (on average 1.4619047619047618) internal successors, (614), 423 states have internal predecessors, (614), 118 states have call successors, (118), 6 states have call predecessors, (118), 6 states have return successors, (118), 115 states have call predecessors, (118), 118 states have call successors, (118) [2024-11-20 03:53:30,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 850 transitions. [2024-11-20 03:53:30,986 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 850 transitions. Word has length 220 [2024-11-20 03:53:30,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:53:30,987 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 850 transitions. [2024-11-20 03:53:30,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-11-20 03:53:30,987 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 850 transitions. [2024-11-20 03:53:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-20 03:53:30,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:53:30,990 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:53:30,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 03:53:30,991 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:53:30,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:53:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1789304699, now seen corresponding path program 1 times [2024-11-20 03:53:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:53:30,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971129344] [2024-11-20 03:53:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:53:30,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:53:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat