./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-31.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 6f4f6e7db9ac19be0fc2b1101302920059676e71fa85c2d0f9f06ce6daba9949 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:57:22,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:57:22,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:57:22,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:57:22,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:57:22,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:57:22,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:57:22,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:57:22,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:57:22,788 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:57:22,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:57:22,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:57:22,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:57:22,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:57:22,792 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:57:22,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:57:22,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:57:22,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:57:22,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:57:22,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:57:22,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:57:22,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:57:22,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:57:22,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:57:22,797 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:57:22,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:57:22,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:57:22,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:57:22,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:57:22,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:57:22,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:57:22,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:57:22,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:57:22,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:57:22,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:57:22,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:57:22,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:57:22,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:57:22,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:57:22,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:57:22,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:57:22,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:57:22,802 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 -> 6f4f6e7db9ac19be0fc2b1101302920059676e71fa85c2d0f9f06ce6daba9949 [2024-11-12 01:57:23,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:57:23,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:57:23,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:57:23,124 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:57:23,124 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:57:23,125 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-31.i [2024-11-12 01:57:24,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:57:24,888 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:57:24,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-31.i [2024-11-12 01:57:24,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6b4383f/2a7d8c2dc3b64279bc49a61cd3dc1ad9/FLAG8dbfdf746 [2024-11-12 01:57:24,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc6b4383f/2a7d8c2dc3b64279bc49a61cd3dc1ad9 [2024-11-12 01:57:24,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:57:24,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:57:24,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:57:24,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:57:24,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:57:24,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:57:24" (1/1) ... [2024-11-12 01:57:24,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11ffc7b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:24, skipping insertion in model container [2024-11-12 01:57:24,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:57:24" (1/1) ... [2024-11-12 01:57:24,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:57:25,180 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-10_file-31.i[915,928] [2024-11-12 01:57:25,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:57:25,295 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:57:25,308 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-10_file-31.i[915,928] [2024-11-12 01:57:25,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:57:25,358 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:57:25,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25 WrapperNode [2024-11-12 01:57:25,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:57:25,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:57:25,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:57:25,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:57:25,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,424 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-12 01:57:25,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:57:25,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:57:25,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:57:25,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:57:25,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,474 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-12 01:57:25,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,485 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:57:25,504 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:57:25,504 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:57:25,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:57:25,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (1/1) ... [2024-11-12 01:57:25,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:57:25,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:57:25,544 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-12 01:57:25,551 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-12 01:57:25,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:57:25,615 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:57:25,616 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:57:25,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:57:25,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:57:25,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:57:25,728 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:57:25,731 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:57:26,160 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 01:57:26,161 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:57:26,182 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:57:26,184 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:57:26,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:57:26 BoogieIcfgContainer [2024-11-12 01:57:26,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:57:26,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:57:26,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:57:26,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:57:26,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:57:24" (1/3) ... [2024-11-12 01:57:26,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e67c41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:57:26, skipping insertion in model container [2024-11-12 01:57:26,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:57:25" (2/3) ... [2024-11-12 01:57:26,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e67c41f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:57:26, skipping insertion in model container [2024-11-12 01:57:26,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:57:26" (3/3) ... [2024-11-12 01:57:26,193 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-31.i [2024-11-12 01:57:26,209 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:57:26,209 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:57:26,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:57:26,285 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;@f00c780, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:57:26,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:57:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 01:57:26,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-12 01:57:26,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:57:26,312 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:57:26,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:57:26,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:57:26,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1117992548, now seen corresponding path program 1 times [2024-11-12 01:57:26,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:57:26,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141503917] [2024-11-12 01:57:26,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:57:26,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:57:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:57:26,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:57:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:57:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:57:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:57:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:57:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:57:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:57:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:57:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:57:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:57:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:57:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:57:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:57:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:57:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:57:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:57:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:57:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:57:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:57:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:57:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:57:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:57:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:57:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:57:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 01:57:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 01:57:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:57:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 01:57:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:57:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 01:57:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:57:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 01:57:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 01:57:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 01:57:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 01:57:26,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:57:26,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141503917] [2024-11-12 01:57:26,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141503917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:57:26,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:57:26,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:57:26,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698225682] [2024-11-12 01:57:26,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:57:26,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:57:26,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:57:27,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:57:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:57:27,010 INFO L87 Difference]: Start difference. First operand has 85 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 01:57:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:57:27,055 INFO L93 Difference]: Finished difference Result 163 states and 293 transitions. [2024-11-12 01:57:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:57:27,057 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 211 [2024-11-12 01:57:27,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:57:27,067 INFO L225 Difference]: With dead ends: 163 [2024-11-12 01:57:27,068 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 01:57:27,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-12 01:57:27,080 INFO L435 NwaCegarLoop]: 125 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, 125 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-12 01:57:27,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:57:27,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 01:57:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 01:57:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 01:57:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 125 transitions. [2024-11-12 01:57:27,138 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 125 transitions. Word has length 211 [2024-11-12 01:57:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:57:27,139 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 125 transitions. [2024-11-12 01:57:27,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 01:57:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 125 transitions. [2024-11-12 01:57:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-12 01:57:27,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:57:27,144 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:57:27,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:57:27,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:57:27,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:57:27,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1960080418, now seen corresponding path program 1 times [2024-11-12 01:57:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:57:27,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042484809] [2024-11-12 01:57:27,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:57:27,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:57:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:57:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:57:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:57:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:57:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:57:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:57:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:57:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:57:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:57:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:57:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:57:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:57:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:57:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:57:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:57:27,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:57:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:57:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:57:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:57:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:57:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:57:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:57:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:57:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:57:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:57:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 01:57:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 01:57:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:57:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 01:57:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:57:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 01:57:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:57:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 01:57:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 01:57:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 01:57:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 01:57:27,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:57:27,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042484809] [2024-11-12 01:57:27,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042484809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:57:27,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:57:27,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:57:27,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530127146] [2024-11-12 01:57:27,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:57:27,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:57:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:57:27,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:57:27,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:57:27,690 INFO L87 Difference]: Start difference. First operand 81 states and 125 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 01:57:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:57:27,792 INFO L93 Difference]: Finished difference Result 236 states and 367 transitions. [2024-11-12 01:57:27,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:57:27,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 211 [2024-11-12 01:57:27,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:57:27,799 INFO L225 Difference]: With dead ends: 236 [2024-11-12 01:57:27,801 INFO L226 Difference]: Without dead ends: 158 [2024-11-12 01:57:27,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 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-12 01:57:27,806 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 113 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:57:27,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 347 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:57:27,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-12 01:57:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 85. [2024-11-12 01:57:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 01:57:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 130 transitions. [2024-11-12 01:57:27,836 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 130 transitions. Word has length 211 [2024-11-12 01:57:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:57:27,840 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 130 transitions. [2024-11-12 01:57:27,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 01:57:27,840 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 130 transitions. [2024-11-12 01:57:27,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-12 01:57:27,846 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:57:27,846 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:57:27,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:57:27,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:57:27,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:57:27,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1525540252, now seen corresponding path program 1 times [2024-11-12 01:57:27,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:57:27,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690066546] [2024-11-12 01:57:27,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:57:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:57:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:57:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:57:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:57:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:57:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:57:34,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:57:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:57:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:57:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:57:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:57:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:57:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:57:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:57:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:57:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:57:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:57:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:57:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:57:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:57:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:57:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:57:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:57:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:57:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:57:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:57:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 01:57:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 01:57:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:57:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 01:57:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:57:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 01:57:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:57:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 01:57:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 01:57:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 01:57:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:57:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 01:57:34,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:57:34,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690066546] [2024-11-12 01:57:34,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690066546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:57:34,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:57:34,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 01:57:34,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899210033] [2024-11-12 01:57:34,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:57:34,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 01:57:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:57:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 01:57:34,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-12 01:57:34,384 INFO L87 Difference]: Start difference. First operand 85 states and 130 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 01:57:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:57:35,355 INFO L93 Difference]: Finished difference Result 265 states and 379 transitions. [2024-11-12 01:57:35,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 01:57:35,356 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 211 [2024-11-12 01:57:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:57:35,358 INFO L225 Difference]: With dead ends: 265 [2024-11-12 01:57:35,358 INFO L226 Difference]: Without dead ends: 183 [2024-11-12 01:57:35,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-12 01:57:35,361 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 157 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 01:57:35,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 707 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 01:57:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-12 01:57:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 130. [2024-11-12 01:57:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 87 states have internal predecessors, (110), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 01:57:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 192 transitions. [2024-11-12 01:57:35,384 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 192 transitions. Word has length 211 [2024-11-12 01:57:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:57:35,385 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 192 transitions. [2024-11-12 01:57:35,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 01:57:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 192 transitions. [2024-11-12 01:57:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-12 01:57:35,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:57:35,388 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:57:35,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:57:35,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:57:35,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:57:35,389 INFO L85 PathProgramCache]: Analyzing trace with hash -868511058, now seen corresponding path program 1 times [2024-11-12 01:57:35,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:57:35,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838493764] [2024-11-12 01:57:35,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:57:35,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:57:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat