./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.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 3270c8118d1f3bdb2a198b4b5aa7f84c93b7a61bdca0993e970b844057a9b636 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:45:35,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:45:35,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:45:35,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:45:35,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:45:35,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:45:35,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:45:35,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:45:35,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:45:35,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:45:35,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:45:35,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:45:35,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:45:35,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:45:35,254 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:45:35,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:45:35,255 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:45:35,255 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:45:35,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:45:35,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:45:35,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:45:35,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:45:35,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:45:35,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:45:35,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:45:35,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:45:35,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:45:35,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:45:35,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:45:35,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:45:35,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:45:35,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:45:35,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:45:35,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:45:35,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:45:35,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:45:35,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:45:35,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:45:35,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:45:35,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:45:35,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:45:35,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:45:35,263 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 -> 3270c8118d1f3bdb2a198b4b5aa7f84c93b7a61bdca0993e970b844057a9b636 [2024-11-18 23:45:35,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:45:35,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:45:35,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:45:35,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:45:35,522 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:45:35,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i [2024-11-18 23:45:36,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:45:37,092 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:45:37,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-62.i [2024-11-18 23:45:37,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ec3d102/1851aa80ffd2461f8700e3c2a90e79b1/FLAG6df9acfca [2024-11-18 23:45:37,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50ec3d102/1851aa80ffd2461f8700e3c2a90e79b1 [2024-11-18 23:45:37,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:45:37,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:45:37,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:45:37,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:45:37,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:45:37,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a1363c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37, skipping insertion in model container [2024-11-18 23:45:37,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:45:37,339 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_operatoramount_amount250_file-62.i[916,929] [2024-11-18 23:45:37,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:45:37,533 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:45:37,543 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_operatoramount_amount250_file-62.i[916,929] [2024-11-18 23:45:37,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:45:37,703 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:45:37,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37 WrapperNode [2024-11-18 23:45:37,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:45:37,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:45:37,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:45:37,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:45:37,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,788 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2024-11-18 23:45:37,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:45:37,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:45:37,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:45:37,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:45:37,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,839 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 23:45:37,840 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:45:37,900 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:45:37,900 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:45:37,900 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:45:37,901 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (1/1) ... [2024-11-18 23:45:37,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:45:37,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:45:37,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 23:45:37,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 23:45:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:45:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:45:37,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:45:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:45:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:45:37,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:45:38,100 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:45:38,102 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:45:38,784 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-18 23:45:38,785 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:45:38,804 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:45:38,804 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:45:38,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:45:38 BoogieIcfgContainer [2024-11-18 23:45:38,805 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:45:38,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:45:38,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:45:38,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:45:38,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:45:37" (1/3) ... [2024-11-18 23:45:38,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8b565b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:45:38, skipping insertion in model container [2024-11-18 23:45:38,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:45:37" (2/3) ... [2024-11-18 23:45:38,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8b565b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:45:38, skipping insertion in model container [2024-11-18 23:45:38,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:45:38" (3/3) ... [2024-11-18 23:45:38,813 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-62.i [2024-11-18 23:45:38,829 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:45:38,829 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:45:38,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:45:38,908 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;@700ecd55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:45:38,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:45:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 128 states have (on average 1.46875) internal successors, (188), 129 states have internal predecessors, (188), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-18 23:45:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-18 23:45:38,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:45:38,937 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:45:38,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:45:38,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:45:38,942 INFO L85 PathProgramCache]: Analyzing trace with hash -2091883164, now seen corresponding path program 1 times [2024-11-18 23:45:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:45:38,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694358734] [2024-11-18 23:45:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:38,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:45:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2024-11-18 23:45:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:45:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694358734] [2024-11-18 23:45:39,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694358734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:45:39,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526577395] [2024-11-18 23:45:39,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:39,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:45:39,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:45:39,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:45:39,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 23:45:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:39,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:45:39,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:45:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2024-11-18 23:45:39,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:45:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526577395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:45:39,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:45:39,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:45:39,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868224] [2024-11-18 23:45:39,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:45:39,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:45:39,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:45:39,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:45:39,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:45:39,879 INFO L87 Difference]: Start difference. First operand has 187 states, 128 states have (on average 1.46875) internal successors, (188), 129 states have internal predecessors, (188), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-18 23:45:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:45:39,918 INFO L93 Difference]: Finished difference Result 365 states and 648 transitions. [2024-11-18 23:45:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:45:39,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 369 [2024-11-18 23:45:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:45:39,927 INFO L225 Difference]: With dead ends: 365 [2024-11-18 23:45:39,927 INFO L226 Difference]: Without dead ends: 181 [2024-11-18 23:45:39,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:45:39,933 INFO L432 NwaCegarLoop]: 289 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, 289 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:45:39,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:45:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-18 23:45:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-18 23:45:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 123 states have (on average 1.4390243902439024) internal successors, (177), 123 states have internal predecessors, (177), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-18 23:45:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 289 transitions. [2024-11-18 23:45:40,030 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 289 transitions. Word has length 369 [2024-11-18 23:45:40,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:45:40,031 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 289 transitions. [2024-11-18 23:45:40,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-18 23:45:40,032 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 289 transitions. [2024-11-18 23:45:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2024-11-18 23:45:40,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:45:40,043 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:45:40,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 23:45:40,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 23:45:40,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:45:40,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:45:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1237217312, now seen corresponding path program 1 times [2024-11-18 23:45:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:45:40,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225781201] [2024-11-18 23:45:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:40,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:45:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-18 23:45:40,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:45:40,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225781201] [2024-11-18 23:45:40,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225781201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:45:40,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:45:40,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:45:40,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889112984] [2024-11-18 23:45:40,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:45:40,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:45:40,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:45:40,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:45:40,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:45:40,536 INFO L87 Difference]: Start difference. First operand 181 states and 289 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:45:40,631 INFO L93 Difference]: Finished difference Result 520 states and 831 transitions. [2024-11-18 23:45:40,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:45:40,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 369 [2024-11-18 23:45:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:45:40,636 INFO L225 Difference]: With dead ends: 520 [2024-11-18 23:45:40,636 INFO L226 Difference]: Without dead ends: 342 [2024-11-18 23:45:40,637 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-18 23:45:40,638 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 254 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:45:40,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 756 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:45:40,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-18 23:45:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 199. [2024-11-18 23:45:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4680851063829787) internal successors, (207), 141 states have internal predecessors, (207), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-18 23:45:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 319 transitions. [2024-11-18 23:45:40,658 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 319 transitions. Word has length 369 [2024-11-18 23:45:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:45:40,660 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 319 transitions. [2024-11-18 23:45:40,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:40,660 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 319 transitions. [2024-11-18 23:45:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-18 23:45:40,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:45:40,664 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:45:40,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:45:40,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:45:40,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:45:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1618908762, now seen corresponding path program 1 times [2024-11-18 23:45:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:45:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923640105] [2024-11-18 23:45:40,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:40,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:45:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-18 23:45:41,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:45:41,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923640105] [2024-11-18 23:45:41,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923640105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:45:41,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:45:41,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 23:45:41,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903772716] [2024-11-18 23:45:41,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:45:41,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:45:41,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:45:41,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:45:41,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:45:41,122 INFO L87 Difference]: Start difference. First operand 199 states and 319 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:45:41,157 INFO L93 Difference]: Finished difference Result 395 states and 635 transitions. [2024-11-18 23:45:41,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 23:45:41,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 370 [2024-11-18 23:45:41,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:45:41,164 INFO L225 Difference]: With dead ends: 395 [2024-11-18 23:45:41,164 INFO L226 Difference]: Without dead ends: 199 [2024-11-18 23:45:41,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:45:41,167 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 0 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:45:41,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 848 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:45:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-18 23:45:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-18 23:45:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4609929078014185) internal successors, (206), 141 states have internal predecessors, (206), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-18 23:45:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 318 transitions. [2024-11-18 23:45:41,192 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 318 transitions. Word has length 370 [2024-11-18 23:45:41,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:45:41,193 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 318 transitions. [2024-11-18 23:45:41,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 318 transitions. [2024-11-18 23:45:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2024-11-18 23:45:41,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:45:41,198 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:45:41,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 23:45:41,199 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:45:41,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:45:41,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1646699236, now seen corresponding path program 1 times [2024-11-18 23:45:41,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:45:41,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409217341] [2024-11-18 23:45:41,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:41,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:45:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-18 23:45:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:45:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409217341] [2024-11-18 23:45:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409217341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:45:41,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:45:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 23:45:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964053057] [2024-11-18 23:45:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:45:41,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:45:41,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:45:41,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:45:41,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:45:41,600 INFO L87 Difference]: Start difference. First operand 199 states and 318 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:41,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:45:41,650 INFO L93 Difference]: Finished difference Result 395 states and 633 transitions. [2024-11-18 23:45:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 23:45:41,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 370 [2024-11-18 23:45:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:45:41,656 INFO L225 Difference]: With dead ends: 395 [2024-11-18 23:45:41,656 INFO L226 Difference]: Without dead ends: 199 [2024-11-18 23:45:41,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:45:41,657 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 163 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:45:41,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 557 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:45:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-18 23:45:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-18 23:45:41,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.4539007092198581) internal successors, (205), 141 states have internal predecessors, (205), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-18 23:45:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2024-11-18 23:45:41,681 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 370 [2024-11-18 23:45:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:45:41,681 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2024-11-18 23:45:41,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2024-11-18 23:45:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2024-11-18 23:45:41,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:45:41,685 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:45:41,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 23:45:41,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:45:41,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:45:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1847561755, now seen corresponding path program 1 times [2024-11-18 23:45:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:45:41,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950414065] [2024-11-18 23:45:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:41,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:45:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:42,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-18 23:45:42,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:45:42,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950414065] [2024-11-18 23:45:42,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950414065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:45:42,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:45:42,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 23:45:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821132901] [2024-11-18 23:45:42,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:45:42,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 23:45:42,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:45:42,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 23:45:42,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:45:42,433 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:45:42,736 INFO L93 Difference]: Finished difference Result 592 states and 946 transitions. [2024-11-18 23:45:42,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 23:45:42,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 371 [2024-11-18 23:45:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:45:42,740 INFO L225 Difference]: With dead ends: 592 [2024-11-18 23:45:42,741 INFO L226 Difference]: Without dead ends: 396 [2024-11-18 23:45:42,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-18 23:45:42,742 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 174 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 23:45:42,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 988 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 23:45:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-18 23:45:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 308. [2024-11-18 23:45:42,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 193 states have (on average 1.3730569948186528) internal successors, (265), 193 states have internal predecessors, (265), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-18 23:45:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 489 transitions. [2024-11-18 23:45:42,790 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 489 transitions. Word has length 371 [2024-11-18 23:45:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:45:42,791 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 489 transitions. [2024-11-18 23:45:42,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 489 transitions. [2024-11-18 23:45:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-18 23:45:42,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:45:42,796 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:45:42,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 23:45:42,796 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:45:42,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:45:42,797 INFO L85 PathProgramCache]: Analyzing trace with hash -466060414, now seen corresponding path program 1 times [2024-11-18 23:45:42,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:45:42,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691917076] [2024-11-18 23:45:42,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:42,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:45:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-18 23:45:43,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:45:43,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691917076] [2024-11-18 23:45:43,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691917076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:45:43,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155677877] [2024-11-18 23:45:43,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:43,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:45:43,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:45:43,967 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:45:43,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 23:45:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:44,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-18 23:45:44,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:45:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4194 proven. 327 refuted. 0 times theorem prover too weak. 1639 trivial. 0 not checked. [2024-11-18 23:45:45,441 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:45:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 411 proven. 231 refuted. 0 times theorem prover too weak. 5518 trivial. 0 not checked. [2024-11-18 23:45:46,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155677877] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:45:46,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:45:46,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 14] total 28 [2024-11-18 23:45:46,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55626476] [2024-11-18 23:45:46,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:45:46,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-18 23:45:46,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:45:46,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-18 23:45:46,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2024-11-18 23:45:46,141 INFO L87 Difference]: Start difference. First operand 308 states and 489 transitions. Second operand has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 28 states have internal predecessors, (254), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (149), 9 states have call predecessors, (149), 9 states have call successors, (149) [2024-11-18 23:45:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:45:47,662 INFO L93 Difference]: Finished difference Result 664 states and 1006 transitions. [2024-11-18 23:45:47,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-18 23:45:47,663 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 28 states have internal predecessors, (254), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (149), 9 states have call predecessors, (149), 9 states have call successors, (149) Word has length 372 [2024-11-18 23:45:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:45:47,666 INFO L225 Difference]: With dead ends: 664 [2024-11-18 23:45:47,666 INFO L226 Difference]: Without dead ends: 468 [2024-11-18 23:45:47,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=894, Invalid=2412, Unknown=0, NotChecked=0, Total=3306 [2024-11-18 23:45:47,669 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 817 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 23:45:47,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 936 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 23:45:47,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-18 23:45:47,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 445. [2024-11-18 23:45:47,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 313 states have (on average 1.376996805111821) internal successors, (431), 314 states have internal predecessors, (431), 117 states have call successors, (117), 14 states have call predecessors, (117), 14 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-18 23:45:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 665 transitions. [2024-11-18 23:45:47,711 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 665 transitions. Word has length 372 [2024-11-18 23:45:47,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:45:47,713 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 665 transitions. [2024-11-18 23:45:47,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.071428571428571) internal successors, (254), 28 states have internal predecessors, (254), 9 states have call successors, (146), 5 states have call predecessors, (146), 12 states have return successors, (149), 9 states have call predecessors, (149), 9 states have call successors, (149) [2024-11-18 23:45:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 665 transitions. [2024-11-18 23:45:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-18 23:45:47,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:45:47,720 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:45:47,735 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-18 23:45:47,920 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,SelfDestructingSolverStorable5 [2024-11-18 23:45:47,922 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:45:47,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:45:47,923 INFO L85 PathProgramCache]: Analyzing trace with hash -806301783, now seen corresponding path program 1 times [2024-11-18 23:45:47,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:45:47,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095782856] [2024-11-18 23:45:47,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:47,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:45:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 15 proven. 150 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-18 23:45:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:45:49,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095782856] [2024-11-18 23:45:49,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095782856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:45:49,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494310542] [2024-11-18 23:45:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:49,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:45:49,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:45:49,724 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-18 23:45:49,725 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-18 23:45:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:50,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-18 23:45:50,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:45:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3063 proven. 534 refuted. 0 times theorem prover too weak. 2563 trivial. 0 not checked. [2024-11-18 23:45:52,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:45:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 78 proven. 249 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2024-11-18 23:45:54,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494310542] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:45:54,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:45:54,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 13] total 31 [2024-11-18 23:45:54,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787400208] [2024-11-18 23:45:54,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:45:54,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-18 23:45:54,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:45:54,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-18 23:45:54,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2024-11-18 23:45:54,411 INFO L87 Difference]: Start difference. First operand 445 states and 665 transitions. Second operand has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 30 states have internal predecessors, (245), 8 states have call successors, (158), 5 states have call predecessors, (158), 10 states have return successors, (160), 8 states have call predecessors, (160), 8 states have call successors, (160) [2024-11-18 23:45:56,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:45:56,457 INFO L93 Difference]: Finished difference Result 897 states and 1307 transitions. [2024-11-18 23:45:56,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-18 23:45:56,458 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 30 states have internal predecessors, (245), 8 states have call successors, (158), 5 states have call predecessors, (158), 10 states have return successors, (160), 8 states have call predecessors, (160), 8 states have call successors, (160) Word has length 374 [2024-11-18 23:45:56,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:45:56,461 INFO L225 Difference]: With dead ends: 897 [2024-11-18 23:45:56,461 INFO L226 Difference]: Without dead ends: 588 [2024-11-18 23:45:56,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=853, Invalid=2117, Unknown=0, NotChecked=0, Total=2970 [2024-11-18 23:45:56,464 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 498 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:45:56,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 2075 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-18 23:45:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-18 23:45:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 491. [2024-11-18 23:45:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 351 states have (on average 1.3361823361823362) internal successors, (469), 352 states have internal predecessors, (469), 115 states have call successors, (115), 24 states have call predecessors, (115), 24 states have return successors, (115), 114 states have call predecessors, (115), 115 states have call successors, (115) [2024-11-18 23:45:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 699 transitions. [2024-11-18 23:45:56,523 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 699 transitions. Word has length 374 [2024-11-18 23:45:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:45:56,524 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 699 transitions. [2024-11-18 23:45:56,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.903225806451613) internal successors, (245), 30 states have internal predecessors, (245), 8 states have call successors, (158), 5 states have call predecessors, (158), 10 states have return successors, (160), 8 states have call predecessors, (160), 8 states have call successors, (160) [2024-11-18 23:45:56,524 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 699 transitions. [2024-11-18 23:45:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2024-11-18 23:45:56,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:45:56,528 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:45:56,543 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-18 23:45:56,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:45:56,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:45:56,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:45:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -721629915, now seen corresponding path program 1 times [2024-11-18 23:45:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:45:56,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261179104] [2024-11-18 23:45:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:45:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-18 23:45:57,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:45:57,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261179104] [2024-11-18 23:45:57,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261179104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:45:57,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:45:57,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 23:45:57,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138195138] [2024-11-18 23:45:57,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:45:57,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 23:45:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:45:57,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 23:45:57,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:45:57,043 INFO L87 Difference]: Start difference. First operand 491 states and 699 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:45:57,326 INFO L93 Difference]: Finished difference Result 1043 states and 1534 transitions. [2024-11-18 23:45:57,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 23:45:57,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 374 [2024-11-18 23:45:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:45:57,334 INFO L225 Difference]: With dead ends: 1043 [2024-11-18 23:45:57,334 INFO L226 Difference]: Without dead ends: 708 [2024-11-18 23:45:57,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-18 23:45:57,336 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 249 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:45:57,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1096 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:45:57,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2024-11-18 23:45:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 523. [2024-11-18 23:45:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 383 states have (on average 1.3524804177545693) internal successors, (518), 384 states have internal predecessors, (518), 115 states have call successors, (115), 24 states have call predecessors, (115), 24 states have return successors, (115), 114 states have call predecessors, (115), 115 states have call successors, (115) [2024-11-18 23:45:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 748 transitions. [2024-11-18 23:45:57,379 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 748 transitions. Word has length 374 [2024-11-18 23:45:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:45:57,379 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 748 transitions. [2024-11-18 23:45:57,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 748 transitions. [2024-11-18 23:45:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-18 23:45:57,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:45:57,381 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:45:57,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 23:45:57,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:45:57,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:45:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1242346514, now seen corresponding path program 1 times [2024-11-18 23:45:57,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:45:57,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044304094] [2024-11-18 23:45:57,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:57,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:45:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2024-11-18 23:45:57,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:45:57,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044304094] [2024-11-18 23:45:57,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044304094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:45:57,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:45:57,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:45:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707859553] [2024-11-18 23:45:57,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:45:57,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:45:57,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:45:57,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:45:57,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:45:57,495 INFO L87 Difference]: Start difference. First operand 523 states and 748 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:45:57,608 INFO L93 Difference]: Finished difference Result 1230 states and 1778 transitions. [2024-11-18 23:45:57,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:45:57,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 375 [2024-11-18 23:45:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:45:57,613 INFO L225 Difference]: With dead ends: 1230 [2024-11-18 23:45:57,613 INFO L226 Difference]: Without dead ends: 879 [2024-11-18 23:45:57,615 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-18 23:45:57,615 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 245 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:45:57,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 536 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:45:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-18 23:45:57,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 660. [2024-11-18 23:45:57,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 520 states have (on average 1.3903846153846153) internal successors, (723), 521 states have internal predecessors, (723), 115 states have call successors, (115), 24 states have call predecessors, (115), 24 states have return successors, (115), 114 states have call predecessors, (115), 115 states have call successors, (115) [2024-11-18 23:45:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 953 transitions. [2024-11-18 23:45:57,659 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 953 transitions. Word has length 375 [2024-11-18 23:45:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:45:57,659 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 953 transitions. [2024-11-18 23:45:57,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2024-11-18 23:45:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 953 transitions. [2024-11-18 23:45:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-18 23:45:57,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:45:57,661 INFO L215 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 23:45:57,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 23:45:57,662 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:45:57,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:45:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1751819604, now seen corresponding path program 1 times [2024-11-18 23:45:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:45:57,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777312916] [2024-11-18 23:45:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:57,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:45:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 23:45:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159963923] [2024-11-18 23:45:58,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:45:58,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:45:58,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:45:58,271 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 23:45:58,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 23:45:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:45:58,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-18 23:45:58,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:46:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4067 proven. 246 refuted. 0 times theorem prover too weak. 1847 trivial. 0 not checked. [2024-11-18 23:46:00,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:46:04,712 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_58~0 65536)) (.cse6 (mod c_~var_1_35~0 256))) (let ((.cse4 (< .cse3 .cse6)) (.cse2 (mod c_~var_1_7~0 4294967296)) (.cse5 (< .cse6 (+ .cse3 1)))) (and (or (forall ((v_y_35 Int) (v_z_40 Int)) (let ((.cse1 (div v_z_40 .cse3)) (.cse0 (* v_y_35 4294967296))) (or (< (+ .cse0 4294967295) .cse1) (< .cse2 v_z_40) (< .cse1 (+ .cse0 1)) (< v_z_40 0)))) .cse4) (or (and (or (< 4294967294 (mod (+ 4294967295 (div .cse2 .cse3)) 4294967296)) .cse4) (or .cse5 (< 4294967294 (mod (+ 4294967295 (div .cse2 .cse6)) 4294967296)))) (< 4294967294 .cse2)) (or (forall ((v_y_35 Int) (v_z_42 Int)) (let ((.cse8 (div v_z_42 .cse6)) (.cse7 (* v_y_35 4294967296))) (or (< .cse2 v_z_42) (< v_z_42 0) (< (+ .cse7 4294967295) .cse8) (< .cse8 (+ .cse7 1))))) .cse5)))) is different from false [2024-11-18 23:46:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 123 proven. 42 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2024-11-18 23:46:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:46:48,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777312916] [2024-11-18 23:46:48,911 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-18 23:46:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159963923] [2024-11-18 23:46:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159963923] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:46:48,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 23:46:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 27 [2024-11-18 23:46:48,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135240199] [2024-11-18 23:46:48,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 23:46:48,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-18 23:46:48,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:46:48,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-18 23:46:48,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=480, Unknown=7, NotChecked=48, Total=702 [2024-11-18 23:46:48,913 INFO L87 Difference]: Start difference. First operand 660 states and 953 transitions. Second operand has 27 states, 27 states have (on average 7.444444444444445) internal successors, (201), 26 states have internal predecessors, (201), 6 states have call successors, (112), 5 states have call predecessors, (112), 8 states have return successors, (112), 6 states have call predecessors, (112), 6 states have call successors, (112) [2024-11-18 23:46:59,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-18 23:47:04,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1]