./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-100_file-46.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 960f2718b3cbbcae784c1b54e042d1f18a4d837945b216fb70786424f0faaa2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 19:10:54,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 19:10:54,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 19:10:54,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 19:10:54,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 19:10:54,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 19:10:54,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 19:10:54,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 19:10:54,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 19:10:54,535 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 19:10:54,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 19:10:54,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 19:10:54,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 19:10:54,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 19:10:54,537 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 19:10:54,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 19:10:54,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 19:10:54,538 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 19:10:54,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 19:10:54,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 19:10:54,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 19:10:54,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 19:10:54,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 19:10:54,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 19:10:54,544 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 19:10:54,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 19:10:54,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 19:10:54,545 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 19:10:54,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 19:10:54,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 19:10:54,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 19:10:54,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 19:10:54,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 19:10:54,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 19:10:54,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 19:10:54,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 19:10:54,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 19:10:54,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 19:10:54,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 19:10:54,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 19:10:54,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 19:10:54,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 19:10:54,550 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 -> 960f2718b3cbbcae784c1b54e042d1f18a4d837945b216fb70786424f0faaa2b [2024-11-18 19:10:54,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 19:10:54,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 19:10:54,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 19:10:54,866 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 19:10:54,866 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 19:10:54,868 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-100_file-46.i [2024-11-18 19:10:56,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 19:10:56,631 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 19:10:56,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-46.i [2024-11-18 19:10:56,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5e1162a/2b550cafa8814f5e9ba70a969f6520ce/FLAGbbc3195b7 [2024-11-18 19:10:56,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e5e1162a/2b550cafa8814f5e9ba70a969f6520ce [2024-11-18 19:10:56,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 19:10:56,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 19:10:56,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 19:10:56,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 19:10:56,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 19:10:56,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:10:56" (1/1) ... [2024-11-18 19:10:56,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198d5670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:56, skipping insertion in model container [2024-11-18 19:10:56,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:10:56" (1/1) ... [2024-11-18 19:10:56,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 19:10:56,902 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-100_file-46.i[916,929] [2024-11-18 19:10:57,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 19:10:57,041 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 19:10:57,054 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-100_file-46.i[916,929] [2024-11-18 19:10:57,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 19:10:57,150 INFO L204 MainTranslator]: Completed translation [2024-11-18 19:10:57,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57 WrapperNode [2024-11-18 19:10:57,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 19:10:57,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 19:10:57,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 19:10:57,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 19:10:57,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,238 INFO L138 Inliner]: procedures = 26, calls = 66, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 371 [2024-11-18 19:10:57,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 19:10:57,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 19:10:57,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 19:10:57,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 19:10:57,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,262 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,307 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-18 19:10:57,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 19:10:57,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 19:10:57,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 19:10:57,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 19:10:57,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (1/1) ... [2024-11-18 19:10:57,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 19:10:57,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 19:10:57,420 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-18 19:10:57,425 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-18 19:10:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 19:10:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 19:10:57,479 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 19:10:57,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 19:10:57,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 19:10:57,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 19:10:57,611 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 19:10:57,613 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 19:10:58,328 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-18 19:10:58,350 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 19:10:58,384 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 19:10:58,386 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 19:10:58,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:10:58 BoogieIcfgContainer [2024-11-18 19:10:58,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 19:10:58,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 19:10:58,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 19:10:58,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 19:10:58,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:10:56" (1/3) ... [2024-11-18 19:10:58,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6691d4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:10:58, skipping insertion in model container [2024-11-18 19:10:58,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:10:57" (2/3) ... [2024-11-18 19:10:58,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6691d4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:10:58, skipping insertion in model container [2024-11-18 19:10:58,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:10:58" (3/3) ... [2024-11-18 19:10:58,399 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-46.i [2024-11-18 19:10:58,439 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 19:10:58,440 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 19:10:58,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 19:10:58,523 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;@27f53c8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 19:10:58,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 19:10:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 100 states have (on average 1.47) internal successors, (147), 101 states have internal predecessors, (147), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-18 19:10:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-18 19:10:58,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:10:58,548 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:10:58,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:10:58,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:10:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 925980030, now seen corresponding path program 1 times [2024-11-18 19:10:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:10:58,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032426562] [2024-11-18 19:10:58,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:58,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:10:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:10:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2024-11-18 19:10:59,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:10:59,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032426562] [2024-11-18 19:10:59,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032426562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 19:10:59,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408844273] [2024-11-18 19:10:59,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:59,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 19:10:59,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 19:10:59,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 19:10:59,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 19:10:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:10:59,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 19:10:59,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 19:10:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 5408 trivial. 0 not checked. [2024-11-18 19:10:59,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 19:10:59,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408844273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:10:59,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 19:10:59,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 19:10:59,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649603253] [2024-11-18 19:10:59,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:10:59,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 19:10:59,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:10:59,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 19:10:59,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 19:10:59,591 INFO L87 Difference]: Start difference. First operand has 156 states, 100 states have (on average 1.47) internal successors, (147), 101 states have internal predecessors, (147), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-18 19:10:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:10:59,637 INFO L93 Difference]: Finished difference Result 305 states and 553 transitions. [2024-11-18 19:10:59,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 19:10:59,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) Word has length 327 [2024-11-18 19:10:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:10:59,648 INFO L225 Difference]: With dead ends: 305 [2024-11-18 19:10:59,649 INFO L226 Difference]: Without dead ends: 152 [2024-11-18 19:10:59,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 328 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-18 19:10:59,656 INFO L432 NwaCegarLoop]: 241 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, 241 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-18 19:10:59,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 19:10:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-18 19:10:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-18 19:10:59,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-18 19:10:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 241 transitions. [2024-11-18 19:10:59,724 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 241 transitions. Word has length 327 [2024-11-18 19:10:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:10:59,725 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 241 transitions. [2024-11-18 19:10:59,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (53), 2 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-18 19:10:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 241 transitions. [2024-11-18 19:10:59,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-18 19:10:59,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:10:59,737 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:10:59,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 19:10:59,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 19:10:59,940 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:10:59,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:10:59,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1385141229, now seen corresponding path program 1 times [2024-11-18 19:10:59,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:10:59,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660920999] [2024-11-18 19:10:59,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:10:59,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:11:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:11:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2024-11-18 19:11:00,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:11:00,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660920999] [2024-11-18 19:11:00,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660920999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:11:00,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:11:00,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 19:11:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522507560] [2024-11-18 19:11:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:11:00,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 19:11:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:11:00,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 19:11:00,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 19:11:00,642 INFO L87 Difference]: Start difference. First operand 152 states and 241 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-18 19:11:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:11:00,739 INFO L93 Difference]: Finished difference Result 302 states and 481 transitions. [2024-11-18 19:11:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 19:11:00,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 328 [2024-11-18 19:11:00,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:11:00,745 INFO L225 Difference]: With dead ends: 302 [2024-11-18 19:11:00,748 INFO L226 Difference]: Without dead ends: 153 [2024-11-18 19:11:00,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-18 19:11:00,750 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 19:11:00,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 19:11:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-18 19:11:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-11-18 19:11:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-18 19:11:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 242 transitions. [2024-11-18 19:11:00,777 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 242 transitions. Word has length 328 [2024-11-18 19:11:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:11:00,782 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 242 transitions. [2024-11-18 19:11:00,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-18 19:11:00,783 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 242 transitions. [2024-11-18 19:11:00,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-18 19:11:00,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:11:00,788 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:11:00,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 19:11:00,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:11:00,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:11:00,791 INFO L85 PathProgramCache]: Analyzing trace with hash 398058667, now seen corresponding path program 1 times [2024-11-18 19:11:00,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:11:00,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719301091] [2024-11-18 19:11:00,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:11:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:11:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:11:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2024-11-18 19:11:01,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:11:01,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719301091] [2024-11-18 19:11:01,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719301091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:11:01,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:11:01,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 19:11:01,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361550491] [2024-11-18 19:11:01,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:11:01,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 19:11:01,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:11:01,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 19:11:01,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 19:11:01,133 INFO L87 Difference]: Start difference. First operand 153 states and 242 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-18 19:11:01,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:11:01,197 INFO L93 Difference]: Finished difference Result 309 states and 490 transitions. [2024-11-18 19:11:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 19:11:01,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 329 [2024-11-18 19:11:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:11:01,207 INFO L225 Difference]: With dead ends: 309 [2024-11-18 19:11:01,207 INFO L226 Difference]: Without dead ends: 159 [2024-11-18 19:11:01,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 19:11:01,209 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 5 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 19:11:01,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 708 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 19:11:01,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-18 19:11:01,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2024-11-18 19:11:01,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.39) internal successors, (139), 100 states have internal predecessors, (139), 53 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-18 19:11:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 245 transitions. [2024-11-18 19:11:01,234 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 245 transitions. Word has length 329 [2024-11-18 19:11:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:11:01,236 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 245 transitions. [2024-11-18 19:11:01,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-18 19:11:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 245 transitions. [2024-11-18 19:11:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-18 19:11:01,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:11:01,241 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:11:01,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 19:11:01,242 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:11:01,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:11:01,243 INFO L85 PathProgramCache]: Analyzing trace with hash 460098281, now seen corresponding path program 1 times [2024-11-18 19:11:01,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:11:01,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440950676] [2024-11-18 19:11:01,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:11:01,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:11:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:11:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2024-11-18 19:11:01,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:11:01,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440950676] [2024-11-18 19:11:01,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440950676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:11:01,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:11:01,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 19:11:01,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762475873] [2024-11-18 19:11:01,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:11:01,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 19:11:01,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:11:01,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 19:11:01,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 19:11:01,754 INFO L87 Difference]: Start difference. First operand 155 states and 245 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-18 19:11:01,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:11:01,839 INFO L93 Difference]: Finished difference Result 394 states and 623 transitions. [2024-11-18 19:11:01,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 19:11:01,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) Word has length 329 [2024-11-18 19:11:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:11:01,843 INFO L225 Difference]: With dead ends: 394 [2024-11-18 19:11:01,843 INFO L226 Difference]: Without dead ends: 242 [2024-11-18 19:11:01,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-18 19:11:01,847 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 134 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 19:11:01,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 445 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 19:11:01,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-18 19:11:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2024-11-18 19:11:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 156 states have (on average 1.3974358974358974) internal successors, (218), 157 states have internal predecessors, (218), 80 states have call successors, (80), 2 states have call predecessors, (80), 2 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-18 19:11:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 378 transitions. [2024-11-18 19:11:01,891 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 378 transitions. Word has length 329 [2024-11-18 19:11:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:11:01,892 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 378 transitions. [2024-11-18 19:11:01,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 1 states have call predecessors, (53), 1 states have call successors, (53) [2024-11-18 19:11:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 378 transitions. [2024-11-18 19:11:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-18 19:11:01,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:11:01,898 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:11:01,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 19:11:01,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:11:01,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:11:01,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1228845461, now seen corresponding path program 1 times [2024-11-18 19:11:01,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:11:01,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112856784] [2024-11-18 19:11:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:11:01,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:11:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:11:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5512 trivial. 0 not checked. [2024-11-18 19:11:58,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:11:58,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112856784] [2024-11-18 19:11:58,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112856784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 19:11:58,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 19:11:58,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-18 19:11:58,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047060235] [2024-11-18 19:11:58,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 19:11:58,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-18 19:11:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:11:58,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-18 19:11:58,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-18 19:11:58,617 INFO L87 Difference]: Start difference. First operand 239 states and 378 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-18 19:12:13,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 19:12:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 19:12:14,293 INFO L93 Difference]: Finished difference Result 707 states and 1085 transitions. [2024-11-18 19:12:14,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 19:12:14,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 329 [2024-11-18 19:12:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 19:12:14,303 INFO L225 Difference]: With dead ends: 707 [2024-11-18 19:12:14,304 INFO L226 Difference]: Without dead ends: 471 [2024-11-18 19:12:14,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-18 19:12:14,309 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 528 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-18 19:12:14,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 994 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-18 19:12:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-18 19:12:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 353. [2024-11-18 19:12:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 250 states have (on average 1.416) internal successors, (354), 253 states have internal predecessors, (354), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-18 19:12:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 546 transitions. [2024-11-18 19:12:14,358 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 546 transitions. Word has length 329 [2024-11-18 19:12:14,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 19:12:14,361 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 546 transitions. [2024-11-18 19:12:14,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (53), 1 states have call predecessors, (53), 1 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-18 19:12:14,363 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 546 transitions. [2024-11-18 19:12:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-18 19:12:14,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 19:12:14,366 INFO L215 NwaCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 19:12:14,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 19:12:14,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 19:12:14,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 19:12:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1786258157, now seen corresponding path program 1 times [2024-11-18 19:12:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 19:12:14,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904251243] [2024-11-18 19:12:14,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:12:14,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 19:12:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:12:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 144 proven. 12 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2024-11-18 19:12:14,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 19:12:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904251243] [2024-11-18 19:12:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904251243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 19:12:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657878666] [2024-11-18 19:12:14,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 19:12:14,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 19:12:14,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 19:12:14,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 19:12:14,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 19:12:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 19:12:14,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-18 19:12:14,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 19:12:15,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 916 proven. 12 refuted. 0 times theorem prover too weak. 4584 trivial. 0 not checked. [2024-11-18 19:12:15,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 19:12:15,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657878666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 19:12:15,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 19:12:15,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-18 19:12:15,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384075943] [2024-11-18 19:12:15,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 19:12:15,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 19:12:15,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 19:12:15,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 19:12:15,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-18 19:12:15,423 INFO L87 Difference]: Start difference. First operand 353 states and 546 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (57), 2 states have call predecessors, (57), 3 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57)