./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.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 dbe45afa86e2c578c058b9245371f9cd8d3f7cde9f82c7f7a0cfc33405a8ed29 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:20:34,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:20:34,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:20:34,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:20:34,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:20:34,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:20:34,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:20:34,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:20:34,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:20:35,000 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:20:35,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:20:35,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:20:35,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:20:35,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:20:35,002 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:20:35,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:20:35,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:20:35,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:20:35,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:20:35,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:20:35,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:20:35,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:20:35,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:20:35,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:20:35,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:20:35,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:20:35,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:20:35,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:20:35,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:20:35,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:20:35,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:20:35,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:20:35,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:20:35,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:20:35,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:20:35,008 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:20:35,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:20:35,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:20:35,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:20:35,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:20:35,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:20:35,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:20:35,010 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 -> dbe45afa86e2c578c058b9245371f9cd8d3f7cde9f82c7f7a0cfc33405a8ed29 [2024-11-22 10:20:35,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:20:35,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:20:35,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:20:35,265 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:20:35,265 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:20:35,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i [2024-11-22 10:20:36,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:20:36,923 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:20:36,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i [2024-11-22 10:20:36,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b0e5a122/da565321c9a74b029bcabe5743fc4728/FLAG63c95fe4f [2024-11-22 10:20:37,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b0e5a122/da565321c9a74b029bcabe5743fc4728 [2024-11-22 10:20:37,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:20:37,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:20:37,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:20:37,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:20:37,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:20:37,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a73e752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37, skipping insertion in model container [2024-11-22 10:20:37,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:20:37,501 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_loopvsstraightlinecode_100-1loop_file-61.i[916,929] [2024-11-22 10:20:37,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:20:37,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:20:37,628 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_loopvsstraightlinecode_100-1loop_file-61.i[916,929] [2024-11-22 10:20:37,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:20:37,694 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:20:37,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37 WrapperNode [2024-11-22 10:20:37,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:20:37,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:20:37,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:20:37,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:20:37,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,755 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-11-22 10:20:37,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:20:37,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:20:37,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:20:37,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:20:37,768 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,776 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,800 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-22 10:20:37,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:20:37,825 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:20:37,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:20:37,825 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:20:37,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (1/1) ... [2024-11-22 10:20:37,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:20:37,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:20:37,857 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-22 10:20:37,862 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-22 10:20:37,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:20:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:20:37,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:20:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:20:37,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:20:37,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:20:37,990 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:20:37,993 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:20:38,413 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-22 10:20:38,413 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:20:38,426 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:20:38,426 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:20:38,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:20:38 BoogieIcfgContainer [2024-11-22 10:20:38,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:20:38,429 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:20:38,429 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:20:38,432 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:20:38,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:20:37" (1/3) ... [2024-11-22 10:20:38,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616e9dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:20:38, skipping insertion in model container [2024-11-22 10:20:38,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:20:37" (2/3) ... [2024-11-22 10:20:38,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616e9dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:20:38, skipping insertion in model container [2024-11-22 10:20:38,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:20:38" (3/3) ... [2024-11-22 10:20:38,435 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-61.i [2024-11-22 10:20:38,450 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:20:38,451 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:20:38,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:20:38,521 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;@2ef58d40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:20:38,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:20:38,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 10:20:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-22 10:20:38,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:38,541 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:38,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:38,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1895177401, now seen corresponding path program 1 times [2024-11-22 10:20:38,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:38,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278858810] [2024-11-22 10:20:38,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:38,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-22 10:20:38,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:38,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278858810] [2024-11-22 10:20:38,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278858810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:20:38,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168302986] [2024-11-22 10:20:38,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:38,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:20:38,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:20:38,916 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-22 10:20:38,918 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-22 10:20:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:39,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:20:39,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:20:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-22 10:20:39,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:20:39,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168302986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:20:39,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:20:39,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:20:39,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230027184] [2024-11-22 10:20:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:20:39,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:20:39,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:39,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:20:39,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:20:39,230 INFO L87 Difference]: Start difference. First operand has 107 states, 78 states have (on average 1.4743589743589745) internal successors, (115), 79 states have internal predecessors, (115), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-22 10:20:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:39,275 INFO L93 Difference]: Finished difference Result 211 states and 357 transitions. [2024-11-22 10:20:39,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:20:39,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2024-11-22 10:20:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:39,286 INFO L225 Difference]: With dead ends: 211 [2024-11-22 10:20:39,286 INFO L226 Difference]: Without dead ends: 103 [2024-11-22 10:20:39,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 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-22 10:20:39,295 INFO L432 NwaCegarLoop]: 164 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, 164 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-22 10:20:39,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:20:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-22 10:20:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-22 10:20:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.44) internal successors, (108), 75 states have internal predecessors, (108), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 10:20:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 160 transitions. [2024-11-22 10:20:39,342 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 160 transitions. Word has length 175 [2024-11-22 10:20:39,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:39,343 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 160 transitions. [2024-11-22 10:20:39,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-22 10:20:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 160 transitions. [2024-11-22 10:20:39,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-22 10:20:39,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:39,347 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:39,357 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-22 10:20:39,548 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-22 10:20:39,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:39,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash -852836495, now seen corresponding path program 1 times [2024-11-22 10:20:39,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:39,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549186646] [2024-11-22 10:20:39,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:39,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 10:20:44,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:44,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549186646] [2024-11-22 10:20:44,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549186646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:20:44,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:20:44,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:20:44,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140308819] [2024-11-22 10:20:44,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:20:44,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:20:44,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:44,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:20:44,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:20:44,207 INFO L87 Difference]: Start difference. First operand 103 states and 160 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:46,366 INFO L93 Difference]: Finished difference Result 516 states and 800 transitions. [2024-11-22 10:20:46,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 10:20:46,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-22 10:20:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:46,370 INFO L225 Difference]: With dead ends: 516 [2024-11-22 10:20:46,371 INFO L226 Difference]: Without dead ends: 416 [2024-11-22 10:20:46,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-22 10:20:46,372 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 778 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-22 10:20:46,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 774 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-22 10:20:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-22 10:20:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 174. [2024-11-22 10:20:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:20:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 275 transitions. [2024-11-22 10:20:46,395 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 275 transitions. Word has length 175 [2024-11-22 10:20:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:46,395 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 275 transitions. [2024-11-22 10:20:46,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 275 transitions. [2024-11-22 10:20:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-22 10:20:46,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:46,398 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:46,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:20:46,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:46,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:46,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1873904849, now seen corresponding path program 1 times [2024-11-22 10:20:46,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:46,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857325364] [2024-11-22 10:20:46,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:46,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 10:20:46,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:46,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857325364] [2024-11-22 10:20:46,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857325364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:20:46,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:20:46,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:20:46,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288904010] [2024-11-22 10:20:46,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:20:46,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:20:46,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:46,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:20:46,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:20:46,582 INFO L87 Difference]: Start difference. First operand 174 states and 275 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:46,640 INFO L93 Difference]: Finished difference Result 288 states and 448 transitions. [2024-11-22 10:20:46,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:20:46,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-22 10:20:46,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:46,643 INFO L225 Difference]: With dead ends: 288 [2024-11-22 10:20:46,643 INFO L226 Difference]: Without dead ends: 182 [2024-11-22 10:20:46,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:20:46,644 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 95 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:20:46,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 181 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:20:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-22 10:20:46,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2024-11-22 10:20:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:20:46,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 272 transitions. [2024-11-22 10:20:46,659 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 272 transitions. Word has length 175 [2024-11-22 10:20:46,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:46,660 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 272 transitions. [2024-11-22 10:20:46,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:46,660 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 272 transitions. [2024-11-22 10:20:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-22 10:20:46,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:46,662 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:46,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:20:46,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:46,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:46,663 INFO L85 PathProgramCache]: Analyzing trace with hash 342217516, now seen corresponding path program 1 times [2024-11-22 10:20:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:46,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471185208] [2024-11-22 10:20:46,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:46,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:48,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 10:20:48,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:48,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471185208] [2024-11-22 10:20:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471185208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:20:48,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:20:48,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 10:20:48,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415237509] [2024-11-22 10:20:48,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:20:48,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:20:48,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:48,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:20:48,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:20:48,777 INFO L87 Difference]: Start difference. First operand 178 states and 272 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:50,522 INFO L93 Difference]: Finished difference Result 459 states and 699 transitions. [2024-11-22 10:20:50,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:20:50,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-22 10:20:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:50,526 INFO L225 Difference]: With dead ends: 459 [2024-11-22 10:20:50,526 INFO L226 Difference]: Without dead ends: 355 [2024-11-22 10:20:50,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-22 10:20:50,528 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 390 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:20:50,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 613 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 10:20:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-22 10:20:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 191. [2024-11-22 10:20:50,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 134 states have (on average 1.4104477611940298) internal successors, (189), 134 states have internal predecessors, (189), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:20:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 293 transitions. [2024-11-22 10:20:50,554 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 293 transitions. Word has length 176 [2024-11-22 10:20:50,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:50,555 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 293 transitions. [2024-11-22 10:20:50,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 293 transitions. [2024-11-22 10:20:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-22 10:20:50,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:50,558 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:50,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:20:50,558 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:50,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash -244588498, now seen corresponding path program 1 times [2024-11-22 10:20:50,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:50,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771429573] [2024-11-22 10:20:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 10:20:51,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:51,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771429573] [2024-11-22 10:20:51,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771429573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:20:51,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:20:51,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:20:51,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340107481] [2024-11-22 10:20:51,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:20:51,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:20:51,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:51,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:20:51,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:20:51,893 INFO L87 Difference]: Start difference. First operand 191 states and 293 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:52,229 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2024-11-22 10:20:52,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 10:20:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-22 10:20:52,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:52,232 INFO L225 Difference]: With dead ends: 355 [2024-11-22 10:20:52,232 INFO L226 Difference]: Without dead ends: 251 [2024-11-22 10:20:52,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:20:52,233 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 151 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:20:52,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 447 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:20:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-22 10:20:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 200. [2024-11-22 10:20:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 143 states have (on average 1.4195804195804196) internal successors, (203), 143 states have internal predecessors, (203), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:20:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 307 transitions. [2024-11-22 10:20:52,254 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 307 transitions. Word has length 176 [2024-11-22 10:20:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:52,256 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 307 transitions. [2024-11-22 10:20:52,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 307 transitions. [2024-11-22 10:20:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-22 10:20:52,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:52,258 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:52,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 10:20:52,259 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:52,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1810664726, now seen corresponding path program 1 times [2024-11-22 10:20:52,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:52,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473095651] [2024-11-22 10:20:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:53,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 10:20:53,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:53,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473095651] [2024-11-22 10:20:53,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473095651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:20:53,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:20:53,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:20:53,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138067102] [2024-11-22 10:20:53,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:20:53,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:20:53,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:53,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:20:53,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:20:53,265 INFO L87 Difference]: Start difference. First operand 200 states and 307 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:53,498 INFO L93 Difference]: Finished difference Result 343 states and 522 transitions. [2024-11-22 10:20:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:20:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-22 10:20:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:53,501 INFO L225 Difference]: With dead ends: 343 [2024-11-22 10:20:53,502 INFO L226 Difference]: Without dead ends: 230 [2024-11-22 10:20:53,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:20:53,503 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 96 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:20:53,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 441 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:20:53,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-22 10:20:53,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2024-11-22 10:20:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 143 states have (on average 1.4195804195804196) internal successors, (203), 143 states have internal predecessors, (203), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:20:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 307 transitions. [2024-11-22 10:20:53,525 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 307 transitions. Word has length 176 [2024-11-22 10:20:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:53,527 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 307 transitions. [2024-11-22 10:20:53,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 307 transitions. [2024-11-22 10:20:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-22 10:20:53,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:53,529 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:53,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 10:20:53,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:53,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1306376743, now seen corresponding path program 1 times [2024-11-22 10:20:53,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:53,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179187315] [2024-11-22 10:20:53,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:53,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 10:20:54,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:54,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179187315] [2024-11-22 10:20:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179187315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:20:54,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:20:54,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:20:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261595481] [2024-11-22 10:20:54,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:20:54,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:20:54,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:54,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:20:54,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:20:54,240 INFO L87 Difference]: Start difference. First operand 200 states and 307 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:54,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:54,601 INFO L93 Difference]: Finished difference Result 362 states and 544 transitions. [2024-11-22 10:20:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 10:20:54,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-22 10:20:54,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:54,608 INFO L225 Difference]: With dead ends: 362 [2024-11-22 10:20:54,608 INFO L226 Difference]: Without dead ends: 249 [2024-11-22 10:20:54,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:20:54,610 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 129 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:20:54,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 597 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:20:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-22 10:20:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 196. [2024-11-22 10:20:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 139 states have (on average 1.39568345323741) internal successors, (194), 139 states have internal predecessors, (194), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:20:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 298 transitions. [2024-11-22 10:20:54,633 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 298 transitions. Word has length 177 [2024-11-22 10:20:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:54,634 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 298 transitions. [2024-11-22 10:20:54,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 298 transitions. [2024-11-22 10:20:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-22 10:20:54,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:54,638 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:54,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 10:20:54,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:54,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:54,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1762387447, now seen corresponding path program 1 times [2024-11-22 10:20:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:54,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064146612] [2024-11-22 10:20:54,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:54,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 10:20:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:54,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064146612] [2024-11-22 10:20:54,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064146612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:20:54,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:20:54,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:20:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903840024] [2024-11-22 10:20:54,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:20:54,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:20:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:54,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:20:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:20:54,903 INFO L87 Difference]: Start difference. First operand 196 states and 298 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:55,028 INFO L93 Difference]: Finished difference Result 314 states and 478 transitions. [2024-11-22 10:20:55,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:20:55,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2024-11-22 10:20:55,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:55,030 INFO L225 Difference]: With dead ends: 314 [2024-11-22 10:20:55,030 INFO L226 Difference]: Without dead ends: 193 [2024-11-22 10:20:55,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:20:55,031 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 78 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:20:55,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 396 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:20:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-22 10:20:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-22 10:20:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 136 states have (on average 1.375) internal successors, (187), 136 states have internal predecessors, (187), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:20:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 291 transitions. [2024-11-22 10:20:55,049 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 291 transitions. Word has length 178 [2024-11-22 10:20:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:55,049 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 291 transitions. [2024-11-22 10:20:55,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 291 transitions. [2024-11-22 10:20:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 10:20:55,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:55,052 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:55,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 10:20:55,052 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:55,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:55,052 INFO L85 PathProgramCache]: Analyzing trace with hash 192520944, now seen corresponding path program 1 times [2024-11-22 10:20:55,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:55,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713511430] [2024-11-22 10:20:55,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:55,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 10:20:55,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:55,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713511430] [2024-11-22 10:20:55,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713511430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:20:55,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704136428] [2024-11-22 10:20:55,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:55,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:20:55,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:20:55,321 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-22 10:20:55,323 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-22 10:20:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:55,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 10:20:55,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:20:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-22 10:20:55,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:20:55,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 10:20:55,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704136428] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 10:20:55,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 10:20:55,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-22 10:20:55,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094189777] [2024-11-22 10:20:55,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 10:20:55,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:20:55,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:55,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:20:55,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:20:55,929 INFO L87 Difference]: Start difference. First operand 193 states and 291 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-22 10:20:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:56,084 INFO L93 Difference]: Finished difference Result 316 states and 464 transitions. [2024-11-22 10:20:56,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:20:56,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) Word has length 180 [2024-11-22 10:20:56,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:56,087 INFO L225 Difference]: With dead ends: 316 [2024-11-22 10:20:56,087 INFO L226 Difference]: Without dead ends: 198 [2024-11-22 10:20:56,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:20:56,089 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 135 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:20:56,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 286 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:20:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-22 10:20:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2024-11-22 10:20:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 131 states have (on average 1.3129770992366412) internal successors, (172), 131 states have internal predecessors, (172), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:20:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 276 transitions. [2024-11-22 10:20:56,102 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 276 transitions. Word has length 180 [2024-11-22 10:20:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:56,103 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 276 transitions. [2024-11-22 10:20:56,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-22 10:20:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 276 transitions. [2024-11-22 10:20:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 10:20:56,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:56,105 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:56,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 10:20:56,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-22 10:20:56,307 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:56,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash -896951336, now seen corresponding path program 1 times [2024-11-22 10:20:56,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:56,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050319423] [2024-11-22 10:20:56,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:56,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 10:20:56,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:56,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050319423] [2024-11-22 10:20:56,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050319423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:20:56,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:20:56,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:20:56,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653610640] [2024-11-22 10:20:56,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:20:56,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:20:56,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:56,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:20:56,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:20:56,396 INFO L87 Difference]: Start difference. First operand 190 states and 276 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:56,451 INFO L93 Difference]: Finished difference Result 350 states and 507 transitions. [2024-11-22 10:20:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:20:56,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-11-22 10:20:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:56,454 INFO L225 Difference]: With dead ends: 350 [2024-11-22 10:20:56,454 INFO L226 Difference]: Without dead ends: 239 [2024-11-22 10:20:56,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 10:20:56,455 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 49 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:20:56,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 294 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:20:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-22 10:20:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 222. [2024-11-22 10:20:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 163 states have (on average 1.3558282208588956) internal successors, (221), 163 states have internal predecessors, (221), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:20:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 325 transitions. [2024-11-22 10:20:56,470 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 325 transitions. Word has length 180 [2024-11-22 10:20:56,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:56,470 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 325 transitions. [2024-11-22 10:20:56,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:56,471 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 325 transitions. [2024-11-22 10:20:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 10:20:56,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:56,472 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:56,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 10:20:56,472 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:56,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:56,474 INFO L85 PathProgramCache]: Analyzing trace with hash -357697633, now seen corresponding path program 1 times [2024-11-22 10:20:56,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:56,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124709796] [2024-11-22 10:20:56,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:56,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 10:20:56,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:56,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124709796] [2024-11-22 10:20:56,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124709796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:20:56,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:20:56,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:20:56,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499794466] [2024-11-22 10:20:56,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:20:56,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:20:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:56,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:20:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:20:56,652 INFO L87 Difference]: Start difference. First operand 222 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:56,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:56,873 INFO L93 Difference]: Finished difference Result 489 states and 721 transitions. [2024-11-22 10:20:56,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 10:20:56,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-11-22 10:20:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:56,876 INFO L225 Difference]: With dead ends: 489 [2024-11-22 10:20:56,876 INFO L226 Difference]: Without dead ends: 346 [2024-11-22 10:20:56,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:20:56,877 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 262 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:20:56,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 519 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:20:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-22 10:20:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 223. [2024-11-22 10:20:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 164 states have (on average 1.353658536585366) internal successors, (222), 164 states have internal predecessors, (222), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:20:56,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 326 transitions. [2024-11-22 10:20:56,909 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 326 transitions. Word has length 180 [2024-11-22 10:20:56,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:56,910 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 326 transitions. [2024-11-22 10:20:56,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 10:20:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 326 transitions. [2024-11-22 10:20:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-22 10:20:56,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:56,913 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:56,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 10:20:56,913 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:56,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash -867170723, now seen corresponding path program 1 times [2024-11-22 10:20:56,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:56,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842147531] [2024-11-22 10:20:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:56,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 10:20:57,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:57,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842147531] [2024-11-22 10:20:57,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842147531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:20:57,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:20:57,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 10:20:57,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105305769] [2024-11-22 10:20:57,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:20:57,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 10:20:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:20:57,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 10:20:57,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:20:57,651 INFO L87 Difference]: Start difference. First operand 223 states and 326 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-22 10:20:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:20:58,819 INFO L93 Difference]: Finished difference Result 556 states and 792 transitions. [2024-11-22 10:20:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 10:20:58,820 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 180 [2024-11-22 10:20:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:20:58,822 INFO L225 Difference]: With dead ends: 556 [2024-11-22 10:20:58,822 INFO L226 Difference]: Without dead ends: 413 [2024-11-22 10:20:58,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-11-22 10:20:58,823 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 379 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 10:20:58,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1092 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 10:20:58,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-22 10:20:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 239. [2024-11-22 10:20:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 180 states have (on average 1.3833333333333333) internal successors, (249), 180 states have internal predecessors, (249), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:20:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 353 transitions. [2024-11-22 10:20:58,837 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 353 transitions. Word has length 180 [2024-11-22 10:20:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:20:58,838 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 353 transitions. [2024-11-22 10:20:58,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-22 10:20:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 353 transitions. [2024-11-22 10:20:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-22 10:20:58,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:20:58,839 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:20:58,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 10:20:58,839 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:20:58,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:20:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1203464344, now seen corresponding path program 1 times [2024-11-22 10:20:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:20:58,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197528957] [2024-11-22 10:20:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:58,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:20:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 10:20:59,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:20:59,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197528957] [2024-11-22 10:20:59,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197528957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:20:59,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840898229] [2024-11-22 10:20:59,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:20:59,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:20:59,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:20:59,170 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:20:59,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 10:20:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:20:59,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 10:20:59,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:20:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-22 10:20:59,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:21:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 10:21:00,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840898229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 10:21:00,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 10:21:00,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2024-11-22 10:21:00,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378730007] [2024-11-22 10:21:00,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 10:21:00,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 10:21:00,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:21:00,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 10:21:00,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-22 10:21:00,076 INFO L87 Difference]: Start difference. First operand 239 states and 353 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2024-11-22 10:21:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:21:00,990 INFO L93 Difference]: Finished difference Result 516 states and 728 transitions. [2024-11-22 10:21:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-22 10:21:00,991 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) Word has length 181 [2024-11-22 10:21:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:21:00,993 INFO L225 Difference]: With dead ends: 516 [2024-11-22 10:21:00,993 INFO L226 Difference]: Without dead ends: 325 [2024-11-22 10:21:00,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 356 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2024-11-22 10:21:00,995 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 639 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 10:21:00,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 674 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 10:21:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-22 10:21:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 215. [2024-11-22 10:21:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 154 states have internal predecessors, (195), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 10:21:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 299 transitions. [2024-11-22 10:21:01,018 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 299 transitions. Word has length 181 [2024-11-22 10:21:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:21:01,019 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 299 transitions. [2024-11-22 10:21:01,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2024-11-22 10:21:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 299 transitions. [2024-11-22 10:21:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-22 10:21:01,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:21:01,022 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:21:01,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 10:21:01,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:21:01,237 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:21:01,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:21:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash -425015518, now seen corresponding path program 1 times [2024-11-22 10:21:01,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:21:01,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039469587] [2024-11-22 10:21:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:21:01,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:21:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat