./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.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_fillercodestructure_filler-ps-co_file-10.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 8880bc6b55ab6b26a36a9709c52577c78f4355aea8bee56c9643da00ec93f3ee --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 21:35:48,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 21:35:48,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 21:35:48,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 21:35:48,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 21:35:48,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 21:35:48,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 21:35:48,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 21:35:48,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 21:35:48,651 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 21:35:48,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 21:35:48,652 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 21:35:48,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 21:35:48,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 21:35:48,654 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 21:35:48,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 21:35:48,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 21:35:48,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 21:35:48,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 21:35:48,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 21:35:48,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 21:35:48,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 21:35:48,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 21:35:48,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 21:35:48,659 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 21:35:48,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 21:35:48,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 21:35:48,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 21:35:48,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 21:35:48,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 21:35:48,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 21:35:48,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 21:35:48,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:35:48,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 21:35:48,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 21:35:48,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 21:35:48,661 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 21:35:48,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 21:35:48,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 21:35:48,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 21:35:48,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 21:35:48,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 21:35:48,663 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 -> 8880bc6b55ab6b26a36a9709c52577c78f4355aea8bee56c9643da00ec93f3ee [2024-11-18 21:35:48,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 21:35:48,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 21:35:48,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 21:35:48,870 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 21:35:48,870 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 21:35:48,871 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2024-11-18 21:35:50,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 21:35:50,337 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 21:35:50,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2024-11-18 21:35:50,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6da88e1d/d97f18ab9a2a43ee99f9ea8309394c04/FLAG8fdb619fe [2024-11-18 21:35:50,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6da88e1d/d97f18ab9a2a43ee99f9ea8309394c04 [2024-11-18 21:35:50,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 21:35:50,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 21:35:50,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 21:35:50,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 21:35:50,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 21:35:50,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50203063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50, skipping insertion in model container [2024-11-18 21:35:50,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 21:35:50,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i[919,932] [2024-11-18 21:35:50,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:35:50,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 21:35:50,625 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i[919,932] [2024-11-18 21:35:50,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 21:35:50,703 INFO L204 MainTranslator]: Completed translation [2024-11-18 21:35:50,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50 WrapperNode [2024-11-18 21:35:50,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 21:35:50,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 21:35:50,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 21:35:50,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 21:35:50,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,770 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 318 [2024-11-18 21:35:50,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 21:35:50,772 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 21:35:50,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 21:35:50,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 21:35:50,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,824 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 21:35:50,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 21:35:50,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 21:35:50,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 21:35:50,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 21:35:50,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (1/1) ... [2024-11-18 21:35:50,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 21:35:50,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:35:50,931 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 21:35:50,935 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 21:35:50,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 21:35:50,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 21:35:50,984 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 21:35:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 21:35:50,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 21:35:50,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 21:35:51,060 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 21:35:51,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 21:35:51,507 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-18 21:35:51,507 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 21:35:51,526 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 21:35:51,528 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 21:35:51,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:35:51 BoogieIcfgContainer [2024-11-18 21:35:51,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 21:35:51,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 21:35:51,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 21:35:51,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 21:35:51,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:35:50" (1/3) ... [2024-11-18 21:35:51,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d68b413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:35:51, skipping insertion in model container [2024-11-18 21:35:51,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:35:50" (2/3) ... [2024-11-18 21:35:51,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d68b413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:35:51, skipping insertion in model container [2024-11-18 21:35:51,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:35:51" (3/3) ... [2024-11-18 21:35:51,539 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-10.i [2024-11-18 21:35:51,555 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 21:35:51,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 21:35:51,625 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 21:35:51,631 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;@248e0ccb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 21:35:51,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 21:35:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 94 states have (on average 1.425531914893617) internal successors, (134), 95 states have internal predecessors, (134), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 21:35:51,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-18 21:35:51,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:35:51,652 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:51,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:35:51,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:35:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash -540524557, now seen corresponding path program 1 times [2024-11-18 21:35:51,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:35:51,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085666799] [2024-11-18 21:35:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:35:51,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:35:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:35:52,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-11-18 21:35:52,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:35:52,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085666799] [2024-11-18 21:35:52,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085666799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 21:35:52,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955645051] [2024-11-18 21:35:52,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:35:52,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 21:35:52,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 21:35:52,045 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 21:35:52,046 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 21:35:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:35:52,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 21:35:52,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 21:35:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 3362 trivial. 0 not checked. [2024-11-18 21:35:52,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 21:35:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955645051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:35:52,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 21:35:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 21:35:52,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334602762] [2024-11-18 21:35:52,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:35:52,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 21:35:52,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:35:52,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 21:35:52,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 21:35:52,289 INFO L87 Difference]: Start difference. First operand has 139 states, 94 states have (on average 1.425531914893617) internal successors, (134), 95 states have internal predecessors, (134), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-18 21:35:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:35:52,320 INFO L93 Difference]: Finished difference Result 271 states and 472 transitions. [2024-11-18 21:35:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 21:35:52,323 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 263 [2024-11-18 21:35:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:35:52,329 INFO L225 Difference]: With dead ends: 271 [2024-11-18 21:35:52,330 INFO L226 Difference]: Without dead ends: 135 [2024-11-18 21:35:52,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 264 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 21:35:52,336 INFO L432 NwaCegarLoop]: 211 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, 211 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 21:35:52,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:35:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-18 21:35:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-18 21:35:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 21:35:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 211 transitions. [2024-11-18 21:35:52,385 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 211 transitions. Word has length 263 [2024-11-18 21:35:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:35:52,385 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 211 transitions. [2024-11-18 21:35:52,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (42), 2 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-18 21:35:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 211 transitions. [2024-11-18 21:35:52,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-18 21:35:52,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:35:52,395 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:52,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 21:35:52,595 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 21:35:52,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:35:52,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:35:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1472034875, now seen corresponding path program 1 times [2024-11-18 21:35:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:35:52,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215741352] [2024-11-18 21:35:52,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:35:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:35:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:35:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-18 21:35:53,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:35:53,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215741352] [2024-11-18 21:35:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215741352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:35:53,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:35:53,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 21:35:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138554398] [2024-11-18 21:35:53,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:35:53,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 21:35:53,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:35:53,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 21:35:53,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 21:35:53,066 INFO L87 Difference]: Start difference. First operand 135 states and 211 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-18 21:35:53,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:35:53,144 INFO L93 Difference]: Finished difference Result 368 states and 582 transitions. [2024-11-18 21:35:53,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 21:35:53,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2024-11-18 21:35:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:35:53,149 INFO L225 Difference]: With dead ends: 368 [2024-11-18 21:35:53,149 INFO L226 Difference]: Without dead ends: 236 [2024-11-18 21:35:53,150 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 21:35:53,151 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 91 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 21:35:53,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 401 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 21:35:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-18 21:35:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 216. [2024-11-18 21:35:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 129 states have (on average 1.3255813953488371) internal successors, (171), 129 states have internal predecessors, (171), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-18 21:35:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 339 transitions. [2024-11-18 21:35:53,196 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 339 transitions. Word has length 263 [2024-11-18 21:35:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:35:53,196 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 339 transitions. [2024-11-18 21:35:53,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-18 21:35:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 339 transitions. [2024-11-18 21:35:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-18 21:35:53,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:35:53,204 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:53,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 21:35:53,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:35:53,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:35:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash -467416965, now seen corresponding path program 1 times [2024-11-18 21:35:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:35:53,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664366123] [2024-11-18 21:35:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:35:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:35:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:35:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-18 21:35:53,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:35:53,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664366123] [2024-11-18 21:35:53,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664366123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:35:53,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:35:53,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 21:35:53,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024716826] [2024-11-18 21:35:53,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:35:53,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 21:35:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:35:53,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 21:35:53,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 21:35:53,558 INFO L87 Difference]: Start difference. First operand 216 states and 339 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-18 21:35:53,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:35:53,757 INFO L93 Difference]: Finished difference Result 400 states and 625 transitions. [2024-11-18 21:35:53,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 21:35:53,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 263 [2024-11-18 21:35:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:35:53,763 INFO L225 Difference]: With dead ends: 400 [2024-11-18 21:35:53,763 INFO L226 Difference]: Without dead ends: 268 [2024-11-18 21:35:53,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 21:35:53,766 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 164 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 21:35:53,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 601 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 21:35:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-18 21:35:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 234. [2024-11-18 21:35:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 147 states have (on average 1.3537414965986394) internal successors, (199), 147 states have internal predecessors, (199), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-18 21:35:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 367 transitions. [2024-11-18 21:35:53,801 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 367 transitions. Word has length 263 [2024-11-18 21:35:53,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:35:53,802 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 367 transitions. [2024-11-18 21:35:53,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-18 21:35:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 367 transitions. [2024-11-18 21:35:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-18 21:35:53,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:35:53,806 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:35:53,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 21:35:53,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:35:53,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:35:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1524347362, now seen corresponding path program 1 times [2024-11-18 21:35:53,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:35:53,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102119752] [2024-11-18 21:35:53,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:35:53,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:35:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:36:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-18 21:36:11,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:36:11,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102119752] [2024-11-18 21:36:11,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102119752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:36:11,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:36:11,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-18 21:36:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990885655] [2024-11-18 21:36:11,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:36:11,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 21:36:11,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:36:11,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 21:36:11,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-18 21:36:11,030 INFO L87 Difference]: Start difference. First operand 234 states and 367 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-18 21:36:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:36:12,535 INFO L93 Difference]: Finished difference Result 606 states and 923 transitions. [2024-11-18 21:36:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 21:36:12,536 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 264 [2024-11-18 21:36:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:36:12,543 INFO L225 Difference]: With dead ends: 606 [2024-11-18 21:36:12,543 INFO L226 Difference]: Without dead ends: 474 [2024-11-18 21:36:12,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2024-11-18 21:36:12,545 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 551 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 21:36:12,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1121 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 21:36:12,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-18 21:36:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 363. [2024-11-18 21:36:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 230 states have (on average 1.317391304347826) internal successors, (303), 231 states have internal predecessors, (303), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-18 21:36:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 555 transitions. [2024-11-18 21:36:12,578 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 555 transitions. Word has length 264 [2024-11-18 21:36:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:36:12,578 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 555 transitions. [2024-11-18 21:36:12,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-18 21:36:12,579 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 555 transitions. [2024-11-18 21:36:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-18 21:36:12,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:36:12,581 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:12,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 21:36:12,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:36:12,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:36:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1183337378, now seen corresponding path program 1 times [2024-11-18 21:36:12,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:36:12,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052713985] [2024-11-18 21:36:12,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:36:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:36:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:36:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-18 21:36:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:36:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052713985] [2024-11-18 21:36:31,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052713985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:36:31,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:36:31,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-18 21:36:31,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514676201] [2024-11-18 21:36:31,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:36:31,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-18 21:36:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:36:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-18 21:36:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-18 21:36:31,301 INFO L87 Difference]: Start difference. First operand 363 states and 555 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-18 21:36:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:36:32,644 INFO L93 Difference]: Finished difference Result 775 states and 1158 transitions. [2024-11-18 21:36:32,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-18 21:36:32,645 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2024-11-18 21:36:32,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:36:32,650 INFO L225 Difference]: With dead ends: 775 [2024-11-18 21:36:32,651 INFO L226 Difference]: Without dead ends: 489 [2024-11-18 21:36:32,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2024-11-18 21:36:32,652 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 518 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 21:36:32,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1123 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 21:36:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-18 21:36:32,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 376. [2024-11-18 21:36:32,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 243 states have (on average 1.3209876543209877) internal successors, (321), 244 states have internal predecessors, (321), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-18 21:36:32,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 573 transitions. [2024-11-18 21:36:32,680 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 573 transitions. Word has length 264 [2024-11-18 21:36:32,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:36:32,681 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 573 transitions. [2024-11-18 21:36:32,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-18 21:36:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 573 transitions. [2024-11-18 21:36:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-18 21:36:32,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:36:32,683 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:32,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 21:36:32,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:36:32,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:36:32,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1963504478, now seen corresponding path program 1 times [2024-11-18 21:36:32,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:36:32,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098060925] [2024-11-18 21:36:32,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:36:32,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:36:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 21:36:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-18 21:36:44,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 21:36:44,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098060925] [2024-11-18 21:36:44,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098060925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 21:36:44,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 21:36:44,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-18 21:36:44,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352753694] [2024-11-18 21:36:44,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 21:36:44,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-18 21:36:44,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 21:36:44,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-18 21:36:44,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-18 21:36:44,768 INFO L87 Difference]: Start difference. First operand 376 states and 573 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-18 21:36:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 21:36:45,591 INFO L93 Difference]: Finished difference Result 760 states and 1140 transitions. [2024-11-18 21:36:45,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-18 21:36:45,592 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 264 [2024-11-18 21:36:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 21:36:45,595 INFO L225 Difference]: With dead ends: 760 [2024-11-18 21:36:45,595 INFO L226 Difference]: Without dead ends: 461 [2024-11-18 21:36:45,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2024-11-18 21:36:45,596 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 470 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 21:36:45,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 1163 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 21:36:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-18 21:36:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 365. [2024-11-18 21:36:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 232 states have (on average 1.3146551724137931) internal successors, (305), 233 states have internal predecessors, (305), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-18 21:36:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 557 transitions. [2024-11-18 21:36:45,618 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 557 transitions. Word has length 264 [2024-11-18 21:36:45,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 21:36:45,618 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 557 transitions. [2024-11-18 21:36:45,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-18 21:36:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 557 transitions. [2024-11-18 21:36:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-18 21:36:45,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 21:36:45,622 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:36:45,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 21:36:45,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 21:36:45,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 21:36:45,623 INFO L85 PathProgramCache]: Analyzing trace with hash -469797344, now seen corresponding path program 1 times [2024-11-18 21:36:45,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 21:36:45,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931192895] [2024-11-18 21:36:45,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 21:36:45,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 21:36:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat