./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-9.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-9.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 b3c86227bd3c166c2c8d2c3f7201460a37b3a8cc1b1724af153204475ecb73cc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 23:48:45,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 23:48:45,054 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 23:48:45,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 23:48:45,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 23:48:45,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 23:48:45,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 23:48:45,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 23:48:45,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 23:48:45,091 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 23:48:45,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 23:48:45,091 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 23:48:45,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 23:48:45,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 23:48:45,094 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 23:48:45,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 23:48:45,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 23:48:45,095 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 23:48:45,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 23:48:45,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 23:48:45,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 23:48:45,098 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 23:48:45,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 23:48:45,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 23:48:45,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 23:48:45,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 23:48:45,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 23:48:45,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 23:48:45,099 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 23:48:45,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 23:48:45,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 23:48:45,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 23:48:45,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:48:45,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 23:48:45,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 23:48:45,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 23:48:45,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 23:48:45,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 23:48:45,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 23:48:45,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 23:48:45,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 23:48:45,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 23:48:45,102 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 -> b3c86227bd3c166c2c8d2c3f7201460a37b3a8cc1b1724af153204475ecb73cc [2024-11-18 23:48:45,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 23:48:45,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 23:48:45,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 23:48:45,308 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 23:48:45,308 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 23:48:45,309 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-9.i [2024-11-18 23:48:46,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 23:48:46,680 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 23:48:46,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-9.i [2024-11-18 23:48:46,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bc9a2cf/1bc29fa1e8074453b6aecaae8f4a7176/FLAG2954100a5 [2024-11-18 23:48:47,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53bc9a2cf/1bc29fa1e8074453b6aecaae8f4a7176 [2024-11-18 23:48:47,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 23:48:47,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 23:48:47,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 23:48:47,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 23:48:47,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 23:48:47,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5130eca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47, skipping insertion in model container [2024-11-18 23:48:47,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 23:48:47,235 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-9.i[915,928] [2024-11-18 23:48:47,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:48:47,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 23:48:47,371 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-9.i[915,928] [2024-11-18 23:48:47,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 23:48:47,447 INFO L204 MainTranslator]: Completed translation [2024-11-18 23:48:47,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47 WrapperNode [2024-11-18 23:48:47,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 23:48:47,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 23:48:47,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 23:48:47,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 23:48:47,454 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:48:47" (1/1) ... [2024-11-18 23:48:47,474 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:48:47" (1/1) ... [2024-11-18 23:48:47,528 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2024-11-18 23:48:47,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 23:48:47,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 23:48:47,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 23:48:47,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 23:48:47,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,577 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:48:47,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,594 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 23:48:47,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 23:48:47,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 23:48:47,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 23:48:47,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47" (1/1) ... [2024-11-18 23:48:47,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 23:48:47,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:48:47,647 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:48:47,650 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:48:47,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 23:48:47,687 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 23:48:47,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 23:48:47,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 23:48:47,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 23:48:47,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 23:48:47,771 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 23:48:47,773 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 23:48:48,387 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-18 23:48:48,387 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 23:48:48,404 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 23:48:48,405 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 23:48:48,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:48:48 BoogieIcfgContainer [2024-11-18 23:48:48,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 23:48:48,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 23:48:48,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 23:48:48,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 23:48:48,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:48:47" (1/3) ... [2024-11-18 23:48:48,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495d3f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:48:48, skipping insertion in model container [2024-11-18 23:48:48,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:48:47" (2/3) ... [2024-11-18 23:48:48,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495d3f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:48:48, skipping insertion in model container [2024-11-18 23:48:48,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:48:48" (3/3) ... [2024-11-18 23:48:48,413 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-9.i [2024-11-18 23:48:48,425 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 23:48:48,425 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 23:48:48,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 23:48:48,488 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;@7f14c22e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 23:48:48,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 23:48:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 126 states have (on average 1.5158730158730158) internal successors, (191), 127 states have internal predecessors, (191), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 23:48:48,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-18 23:48:48,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:48:48,508 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:48,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:48:48,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:48:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash -361009679, now seen corresponding path program 1 times [2024-11-18 23:48:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:48:48,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628773387] [2024-11-18 23:48:48,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:48:48,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:48:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:48:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2024-11-18 23:48:48,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:48:48,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628773387] [2024-11-18 23:48:48,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628773387] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:48:48,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947038971] [2024-11-18 23:48:48,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:48:48,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:48:48,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:48:48,863 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:48:48,865 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:48:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:48:49,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 23:48:49,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:48:49,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2024-11-18 23:48:49,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 23:48:49,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947038971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:48:49,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 23:48:49,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 23:48:49,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119574045] [2024-11-18 23:48:49,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:48:49,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 23:48:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:48:49,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 23:48:49,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 23:48:49,154 INFO L87 Difference]: Start difference. First operand has 177 states, 126 states have (on average 1.5158730158730158) internal successors, (191), 127 states have internal predecessors, (191), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-18 23:48:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:48:49,190 INFO L93 Difference]: Finished difference Result 347 states and 616 transitions. [2024-11-18 23:48:49,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 23:48:49,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 312 [2024-11-18 23:48:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:48:49,199 INFO L225 Difference]: With dead ends: 347 [2024-11-18 23:48:49,199 INFO L226 Difference]: Without dead ends: 173 [2024-11-18 23:48:49,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 313 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:48:49,204 INFO L432 NwaCegarLoop]: 280 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, 280 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:48:49,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:48:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-18 23:48:49,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-18 23:48:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 123 states have (on average 1.4959349593495934) internal successors, (184), 123 states have internal predecessors, (184), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 23:48:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 280 transitions. [2024-11-18 23:48:49,251 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 280 transitions. Word has length 312 [2024-11-18 23:48:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:48:49,251 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 280 transitions. [2024-11-18 23:48:49,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-18 23:48:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 280 transitions. [2024-11-18 23:48:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-18 23:48:49,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:48:49,256 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:49,270 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:48:49,460 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:48:49,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:48:49,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:48:49,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1622792027, now seen corresponding path program 1 times [2024-11-18 23:48:49,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:48:49,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448423357] [2024-11-18 23:48:49,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:48:49,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:48:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:48:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-18 23:48:49,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:48:49,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448423357] [2024-11-18 23:48:49,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448423357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:48:49,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:48:49,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:48:49,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448245199] [2024-11-18 23:48:49,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:48:49,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:48:49,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:48:49,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:48:49,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:48:49,711 INFO L87 Difference]: Start difference. First operand 173 states and 280 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:48:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:48:49,781 INFO L93 Difference]: Finished difference Result 476 states and 771 transitions. [2024-11-18 23:48:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:48:49,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 312 [2024-11-18 23:48:49,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:48:49,788 INFO L225 Difference]: With dead ends: 476 [2024-11-18 23:48:49,788 INFO L226 Difference]: Without dead ends: 306 [2024-11-18 23:48:49,789 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:48:49,792 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 214 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:48:49,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 566 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:48:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-18 23:48:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 303. [2024-11-18 23:48:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 216 states have (on average 1.4907407407407407) internal successors, (322), 217 states have internal predecessors, (322), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-18 23:48:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 490 transitions. [2024-11-18 23:48:49,826 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 490 transitions. Word has length 312 [2024-11-18 23:48:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:48:49,828 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 490 transitions. [2024-11-18 23:48:49,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:48:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 490 transitions. [2024-11-18 23:48:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-18 23:48:49,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:48:49,831 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:49,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 23:48:49,832 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:48:49,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:48:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash -921192153, now seen corresponding path program 1 times [2024-11-18 23:48:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:48:49,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650550946] [2024-11-18 23:48:49,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:48:49,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:48:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:48:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-18 23:48:50,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:48:50,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650550946] [2024-11-18 23:48:50,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650550946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:48:50,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:48:50,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:48:50,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393255598] [2024-11-18 23:48:50,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:48:50,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:48:50,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:48:50,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:48:50,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:48:50,049 INFO L87 Difference]: Start difference. First operand 303 states and 490 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:48:50,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:48:50,104 INFO L93 Difference]: Finished difference Result 610 states and 982 transitions. [2024-11-18 23:48:50,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:48:50,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 312 [2024-11-18 23:48:50,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:48:50,108 INFO L225 Difference]: With dead ends: 610 [2024-11-18 23:48:50,108 INFO L226 Difference]: Without dead ends: 310 [2024-11-18 23:48:50,112 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:48:50,114 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 200 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:48:50,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 721 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:48:50,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-18 23:48:50,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 196. [2024-11-18 23:48:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 145 states have (on average 1.4827586206896552) internal successors, (215), 145 states have internal predecessors, (215), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 23:48:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 311 transitions. [2024-11-18 23:48:50,134 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 311 transitions. Word has length 312 [2024-11-18 23:48:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:48:50,136 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 311 transitions. [2024-11-18 23:48:50,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:48:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 311 transitions. [2024-11-18 23:48:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-18 23:48:50,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:48:50,140 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:50,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 23:48:50,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:48:50,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:48:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash -148858346, now seen corresponding path program 1 times [2024-11-18 23:48:50,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:48:50,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860105909] [2024-11-18 23:48:50,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:48:50,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:48:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:48:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-18 23:48:50,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:48:50,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860105909] [2024-11-18 23:48:50,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860105909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:48:50,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:48:50,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:48:50,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044335792] [2024-11-18 23:48:50,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:48:50,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:48:50,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:48:50,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:48:50,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:48:50,337 INFO L87 Difference]: Start difference. First operand 196 states and 311 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:48:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:48:50,400 INFO L93 Difference]: Finished difference Result 582 states and 927 transitions. [2024-11-18 23:48:50,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:48:50,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 313 [2024-11-18 23:48:50,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:48:50,405 INFO L225 Difference]: With dead ends: 582 [2024-11-18 23:48:50,406 INFO L226 Difference]: Without dead ends: 389 [2024-11-18 23:48:50,407 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:48:50,408 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 246 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:48:50,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 749 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:48:50,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-18 23:48:50,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 248. [2024-11-18 23:48:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 197 states have (on average 1.5076142131979695) internal successors, (297), 197 states have internal predecessors, (297), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 23:48:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 393 transitions. [2024-11-18 23:48:50,427 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 393 transitions. Word has length 313 [2024-11-18 23:48:50,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:48:50,427 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 393 transitions. [2024-11-18 23:48:50,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:48:50,428 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 393 transitions. [2024-11-18 23:48:50,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-18 23:48:50,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:48:50,430 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:50,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 23:48:50,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:48:50,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:48:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash 523430973, now seen corresponding path program 1 times [2024-11-18 23:48:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:48:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183673069] [2024-11-18 23:48:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:48:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:48:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:48:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-18 23:48:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:48:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183673069] [2024-11-18 23:48:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183673069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:48:50,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:48:50,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 23:48:50,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336646718] [2024-11-18 23:48:50,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:48:50,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:48:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:48:50,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:48:50,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:48:50,987 INFO L87 Difference]: Start difference. First operand 248 states and 393 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:48:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:48:51,250 INFO L93 Difference]: Finished difference Result 672 states and 1065 transitions. [2024-11-18 23:48:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 23:48:51,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 314 [2024-11-18 23:48:51,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:48:51,252 INFO L225 Difference]: With dead ends: 672 [2024-11-18 23:48:51,252 INFO L226 Difference]: Without dead ends: 427 [2024-11-18 23:48:51,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:48:51,254 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 324 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:48:51,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 907 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:48:51,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-18 23:48:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 260. [2024-11-18 23:48:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 209 states have (on average 1.492822966507177) internal successors, (312), 209 states have internal predecessors, (312), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 23:48:51,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 408 transitions. [2024-11-18 23:48:51,264 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 408 transitions. Word has length 314 [2024-11-18 23:48:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:48:51,265 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 408 transitions. [2024-11-18 23:48:51,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:48:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 408 transitions. [2024-11-18 23:48:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-18 23:48:51,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:48:51,267 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:51,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 23:48:51,268 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:48:51,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:48:51,268 INFO L85 PathProgramCache]: Analyzing trace with hash -898599897, now seen corresponding path program 1 times [2024-11-18 23:48:51,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:48:51,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835124884] [2024-11-18 23:48:51,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:48:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:48:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:48:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-18 23:48:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:48:52,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835124884] [2024-11-18 23:48:52,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835124884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:48:52,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:48:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 23:48:52,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880309427] [2024-11-18 23:48:52,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:48:52,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 23:48:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:48:52,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 23:48:52,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 23:48:52,168 INFO L87 Difference]: Start difference. First operand 260 states and 408 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:48:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:48:52,416 INFO L93 Difference]: Finished difference Result 705 states and 1110 transitions. [2024-11-18 23:48:52,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 23:48:52,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 314 [2024-11-18 23:48:52,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:48:52,419 INFO L225 Difference]: With dead ends: 705 [2024-11-18 23:48:52,419 INFO L226 Difference]: Without dead ends: 448 [2024-11-18 23:48:52,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 23:48:52,421 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 249 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:48:52,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1294 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:48:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-18 23:48:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 433. [2024-11-18 23:48:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 349 states have (on average 1.484240687679083) internal successors, (518), 350 states have internal predecessors, (518), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-18 23:48:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 678 transitions. [2024-11-18 23:48:52,437 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 678 transitions. Word has length 314 [2024-11-18 23:48:52,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:48:52,440 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 678 transitions. [2024-11-18 23:48:52,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:48:52,440 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 678 transitions. [2024-11-18 23:48:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2024-11-18 23:48:52,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:48:52,442 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:52,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 23:48:52,442 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:48:52,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:48:52,443 INFO L85 PathProgramCache]: Analyzing trace with hash 487603497, now seen corresponding path program 1 times [2024-11-18 23:48:52,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:48:52,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464695660] [2024-11-18 23:48:52,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:48:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:48:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:49:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-18 23:49:02,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:49:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464695660] [2024-11-18 23:49:02,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464695660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:49:02,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:49:02,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-18 23:49:02,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841075732] [2024-11-18 23:49:02,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:49:02,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:49:02,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:49:02,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:49:02,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-18 23:49:02,452 INFO L87 Difference]: Start difference. First operand 433 states and 678 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:49:03,604 INFO L93 Difference]: Finished difference Result 1267 states and 1962 transitions. [2024-11-18 23:49:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 23:49:03,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 314 [2024-11-18 23:49:03,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:49:03,610 INFO L225 Difference]: With dead ends: 1267 [2024-11-18 23:49:03,610 INFO L226 Difference]: Without dead ends: 837 [2024-11-18 23:49:03,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:49:03,611 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 627 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:49:03,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 1005 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-18 23:49:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-11-18 23:49:03,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 676. [2024-11-18 23:49:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 580 states have (on average 1.5034482758620689) internal successors, (872), 584 states have internal predecessors, (872), 88 states have call successors, (88), 7 states have call predecessors, (88), 7 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-18 23:49:03,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 1048 transitions. [2024-11-18 23:49:03,646 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 1048 transitions. Word has length 314 [2024-11-18 23:49:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:49:03,648 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 1048 transitions. [2024-11-18 23:49:03,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:03,648 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 1048 transitions. [2024-11-18 23:49:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-18 23:49:03,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:49:03,650 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:03,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 23:49:03,650 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:49:03,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:49:03,651 INFO L85 PathProgramCache]: Analyzing trace with hash -38841129, now seen corresponding path program 1 times [2024-11-18 23:49:03,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:49:03,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356866358] [2024-11-18 23:49:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:49:03,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:49:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:49:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-18 23:49:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:49:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356866358] [2024-11-18 23:49:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356866358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:49:14,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:49:14,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 23:49:14,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695006576] [2024-11-18 23:49:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:49:14,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 23:49:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:49:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 23:49:14,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:49:14,980 INFO L87 Difference]: Start difference. First operand 676 states and 1048 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:16,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:49:16,547 INFO L93 Difference]: Finished difference Result 1650 states and 2545 transitions. [2024-11-18 23:49:16,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 23:49:16,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 315 [2024-11-18 23:49:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:49:16,554 INFO L225 Difference]: With dead ends: 1650 [2024-11-18 23:49:16,554 INFO L226 Difference]: Without dead ends: 984 [2024-11-18 23:49:16,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-18 23:49:16,556 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 557 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-18 23:49:16,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 1131 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-18 23:49:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-18 23:49:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 822. [2024-11-18 23:49:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 714 states have (on average 1.5126050420168067) internal successors, (1080), 720 states have internal predecessors, (1080), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-18 23:49:16,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1272 transitions. [2024-11-18 23:49:16,603 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1272 transitions. Word has length 315 [2024-11-18 23:49:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:49:16,604 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1272 transitions. [2024-11-18 23:49:16,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1272 transitions. [2024-11-18 23:49:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-18 23:49:16,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:49:16,606 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:16,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 23:49:16,607 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:49:16,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:49:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1627908680, now seen corresponding path program 1 times [2024-11-18 23:49:16,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:49:16,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326484365] [2024-11-18 23:49:16,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:49:16,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:49:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:49:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-18 23:49:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:49:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326484365] [2024-11-18 23:49:16,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326484365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:49:16,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:49:16,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 23:49:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828106153] [2024-11-18 23:49:16,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:49:16,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 23:49:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:49:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 23:49:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 23:49:16,746 INFO L87 Difference]: Start difference. First operand 822 states and 1272 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:49:16,822 INFO L93 Difference]: Finished difference Result 1688 states and 2625 transitions. [2024-11-18 23:49:16,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:49:16,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 315 [2024-11-18 23:49:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:49:16,826 INFO L225 Difference]: With dead ends: 1688 [2024-11-18 23:49:16,826 INFO L226 Difference]: Without dead ends: 876 [2024-11-18 23:49:16,828 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:49:16,828 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 71 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 23:49:16,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 524 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 23:49:16,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-18 23:49:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 822. [2024-11-18 23:49:16,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 714 states have (on average 1.5014005602240896) internal successors, (1072), 720 states have internal predecessors, (1072), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-18 23:49:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1264 transitions. [2024-11-18 23:49:16,876 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1264 transitions. Word has length 315 [2024-11-18 23:49:16,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:49:16,876 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1264 transitions. [2024-11-18 23:49:16,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1264 transitions. [2024-11-18 23:49:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-18 23:49:16,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:49:16,878 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:16,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 23:49:16,879 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:49:16,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:49:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1768457290, now seen corresponding path program 1 times [2024-11-18 23:49:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:49:16,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293433203] [2024-11-18 23:49:16,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:49:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:49:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:49:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-18 23:49:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:49:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293433203] [2024-11-18 23:49:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293433203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:49:27,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:49:27,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 23:49:27,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282521963] [2024-11-18 23:49:27,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:49:27,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 23:49:27,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:49:27,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 23:49:27,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:49:27,098 INFO L87 Difference]: Start difference. First operand 822 states and 1264 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:49:28,398 INFO L93 Difference]: Finished difference Result 2046 states and 3137 transitions. [2024-11-18 23:49:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 23:49:28,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 315 [2024-11-18 23:49:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:49:28,404 INFO L225 Difference]: With dead ends: 2046 [2024-11-18 23:49:28,404 INFO L226 Difference]: Without dead ends: 1234 [2024-11-18 23:49:28,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-18 23:49:28,406 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 416 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:49:28,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1540 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-18 23:49:28,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2024-11-18 23:49:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 964. [2024-11-18 23:49:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 856 states have (on average 1.4988317757009346) internal successors, (1283), 862 states have internal predecessors, (1283), 96 states have call successors, (96), 11 states have call predecessors, (96), 11 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-18 23:49:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1475 transitions. [2024-11-18 23:49:28,453 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1475 transitions. Word has length 315 [2024-11-18 23:49:28,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:49:28,453 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1475 transitions. [2024-11-18 23:49:28,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1475 transitions. [2024-11-18 23:49:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-18 23:49:28,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:49:28,455 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:28,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 23:49:28,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:49:28,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:49:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash -482172735, now seen corresponding path program 1 times [2024-11-18 23:49:28,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:49:28,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141556439] [2024-11-18 23:49:28,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:49:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:49:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:49:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 84 proven. 57 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2024-11-18 23:49:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:49:28,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141556439] [2024-11-18 23:49:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141556439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:49:28,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258210124] [2024-11-18 23:49:28,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:49:28,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:49:28,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:49:28,946 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:49:28,947 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:49:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:49:29,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 23:49:29,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:49:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2231 proven. 57 refuted. 0 times theorem prover too weak. 2224 trivial. 0 not checked. [2024-11-18 23:49:29,240 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:49:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 84 proven. 57 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2024-11-18 23:49:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258210124] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:49:29,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:49:29,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-18 23:49:29,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403209851] [2024-11-18 23:49:29,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:49:29,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 23:49:29,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:49:29,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 23:49:29,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-18 23:49:29,418 INFO L87 Difference]: Start difference. First operand 964 states and 1475 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 3 states have call predecessors, (87), 3 states have call successors, (87) [2024-11-18 23:49:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:49:29,652 INFO L93 Difference]: Finished difference Result 1932 states and 2948 transitions. [2024-11-18 23:49:29,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 23:49:29,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 3 states have call predecessors, (87), 3 states have call successors, (87) Word has length 316 [2024-11-18 23:49:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:49:29,657 INFO L225 Difference]: With dead ends: 1932 [2024-11-18 23:49:29,657 INFO L226 Difference]: Without dead ends: 978 [2024-11-18 23:49:29,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 629 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-18 23:49:29,658 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 339 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 23:49:29,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 565 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 23:49:29,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-18 23:49:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 972. [2024-11-18 23:49:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 862 states have (on average 1.4930394431554523) internal successors, (1287), 868 states have internal predecessors, (1287), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-18 23:49:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1479 transitions. [2024-11-18 23:49:29,702 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1479 transitions. Word has length 316 [2024-11-18 23:49:29,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:49:29,703 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1479 transitions. [2024-11-18 23:49:29,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 3 states have call predecessors, (87), 3 states have call successors, (87) [2024-11-18 23:49:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1479 transitions. [2024-11-18 23:49:29,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-18 23:49:29,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:49:29,705 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:29,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 23:49:29,905 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,SelfDestructingSolverStorable10 [2024-11-18 23:49:29,906 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:49:29,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:49:29,906 INFO L85 PathProgramCache]: Analyzing trace with hash -207413121, now seen corresponding path program 1 times [2024-11-18 23:49:29,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:49:29,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927550573] [2024-11-18 23:49:29,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:49:29,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:49:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:49:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 21 proven. 255 refuted. 0 times theorem prover too weak. 4236 trivial. 0 not checked. [2024-11-18 23:49:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:49:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927550573] [2024-11-18 23:49:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927550573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:49:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036476204] [2024-11-18 23:49:31,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:49:31,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:49:31,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:49:31,051 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:49:31,052 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:49:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:49:31,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-18 23:49:31,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 23:49:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1002 proven. 369 refuted. 0 times theorem prover too weak. 3141 trivial. 0 not checked. [2024-11-18 23:49:32,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 23:49:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 18 proven. 123 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2024-11-18 23:49:33,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036476204] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 23:49:33,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 23:49:33,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 6] total 21 [2024-11-18 23:49:33,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121248008] [2024-11-18 23:49:33,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 23:49:33,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 23:49:33,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:49:33,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 23:49:33,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2024-11-18 23:49:33,267 INFO L87 Difference]: Start difference. First operand 972 states and 1479 transitions. Second operand has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 20 states have internal predecessors, (197), 7 states have call successors, (144), 5 states have call predecessors, (144), 9 states have return successors, (144), 7 states have call predecessors, (144), 7 states have call successors, (144) [2024-11-18 23:49:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:49:34,278 INFO L93 Difference]: Finished difference Result 2937 states and 4435 transitions. [2024-11-18 23:49:34,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-18 23:49:34,278 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 20 states have internal predecessors, (197), 7 states have call successors, (144), 5 states have call predecessors, (144), 9 states have return successors, (144), 7 states have call predecessors, (144), 7 states have call successors, (144) Word has length 316 [2024-11-18 23:49:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:49:34,285 INFO L225 Difference]: With dead ends: 2937 [2024-11-18 23:49:34,285 INFO L226 Difference]: Without dead ends: 1975 [2024-11-18 23:49:34,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=894, Unknown=0, NotChecked=0, Total=1190 [2024-11-18 23:49:34,289 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 843 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-18 23:49:34,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1381 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-18 23:49:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2024-11-18 23:49:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1853. [2024-11-18 23:49:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1623 states have (on average 1.4682686383240913) internal successors, (2383), 1634 states have internal predecessors, (2383), 192 states have call successors, (192), 37 states have call predecessors, (192), 37 states have return successors, (192), 181 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-18 23:49:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2767 transitions. [2024-11-18 23:49:34,414 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2767 transitions. Word has length 316 [2024-11-18 23:49:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:49:34,414 INFO L471 AbstractCegarLoop]: Abstraction has 1853 states and 2767 transitions. [2024-11-18 23:49:34,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.380952380952381) internal successors, (197), 20 states have internal predecessors, (197), 7 states have call successors, (144), 5 states have call predecessors, (144), 9 states have return successors, (144), 7 states have call predecessors, (144), 7 states have call successors, (144) [2024-11-18 23:49:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2767 transitions. [2024-11-18 23:49:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-18 23:49:34,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:49:34,417 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:34,432 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:49:34,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:49:34,617 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:49:34,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:49:34,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1012920790, now seen corresponding path program 1 times [2024-11-18 23:49:34,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:49:34,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53438429] [2024-11-18 23:49:34,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:49:34,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:49:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:49:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-18 23:49:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:49:34,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53438429] [2024-11-18 23:49:34,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53438429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:49:34,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:49:34,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 23:49:34,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164531913] [2024-11-18 23:49:34,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:49:34,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 23:49:34,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:49:34,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 23:49:34,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:49:34,748 INFO L87 Difference]: Start difference. First operand 1853 states and 2767 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:34,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:49:34,936 INFO L93 Difference]: Finished difference Result 4502 states and 6736 transitions. [2024-11-18 23:49:34,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 23:49:34,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 316 [2024-11-18 23:49:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:49:34,948 INFO L225 Difference]: With dead ends: 4502 [2024-11-18 23:49:34,948 INFO L226 Difference]: Without dead ends: 2663 [2024-11-18 23:49:34,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 23:49:34,952 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 281 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 23:49:34,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 534 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 23:49:34,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-11-18 23:49:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2661. [2024-11-18 23:49:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2322 states have (on average 1.462962962962963) internal successors, (3397), 2338 states have internal predecessors, (3397), 288 states have call successors, (288), 50 states have call predecessors, (288), 50 states have return successors, (288), 272 states have call predecessors, (288), 288 states have call successors, (288) [2024-11-18 23:49:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 3973 transitions. [2024-11-18 23:49:35,109 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 3973 transitions. Word has length 316 [2024-11-18 23:49:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:49:35,110 INFO L471 AbstractCegarLoop]: Abstraction has 2661 states and 3973 transitions. [2024-11-18 23:49:35,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 3973 transitions. [2024-11-18 23:49:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-18 23:49:35,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:49:35,112 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:35,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 23:49:35,112 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:49:35,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:49:35,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2113814216, now seen corresponding path program 1 times [2024-11-18 23:49:35,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:49:35,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755319867] [2024-11-18 23:49:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:49:35,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:49:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:49:45,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2024-11-18 23:49:45,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:49:45,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755319867] [2024-11-18 23:49:45,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755319867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 23:49:45,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 23:49:45,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 23:49:45,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916081847] [2024-11-18 23:49:45,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 23:49:45,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 23:49:45,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 23:49:45,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 23:49:45,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-18 23:49:45,283 INFO L87 Difference]: Start difference. First operand 2661 states and 3973 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:46,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 23:49:46,515 INFO L93 Difference]: Finished difference Result 5035 states and 7527 transitions. [2024-11-18 23:49:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 23:49:46,516 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 316 [2024-11-18 23:49:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 23:49:46,527 INFO L225 Difference]: With dead ends: 5035 [2024-11-18 23:49:46,527 INFO L226 Difference]: Without dead ends: 3094 [2024-11-18 23:49:46,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-18 23:49:46,530 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 397 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 23:49:46,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1230 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 23:49:46,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2024-11-18 23:49:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 2740. [2024-11-18 23:49:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2740 states, 2395 states have (on average 1.4705636743215031) internal successors, (3522), 2411 states have internal predecessors, (3522), 292 states have call successors, (292), 52 states have call predecessors, (292), 52 states have return successors, (292), 276 states have call predecessors, (292), 292 states have call successors, (292) [2024-11-18 23:49:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 4106 transitions. [2024-11-18 23:49:46,710 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 4106 transitions. Word has length 316 [2024-11-18 23:49:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 23:49:46,711 INFO L471 AbstractCegarLoop]: Abstraction has 2740 states and 4106 transitions. [2024-11-18 23:49:46,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2024-11-18 23:49:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 4106 transitions. [2024-11-18 23:49:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2024-11-18 23:49:46,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 23:49:46,713 INFO L215 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:46,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 23:49:46,713 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 23:49:46,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 23:49:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1841246820, now seen corresponding path program 1 times [2024-11-18 23:49:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 23:49:46,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965893941] [2024-11-18 23:49:46,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:49:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 23:49:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:50:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 141 proven. 264 refuted. 0 times theorem prover too weak. 4107 trivial. 0 not checked. [2024-11-18 23:50:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 23:50:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965893941] [2024-11-18 23:50:10,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965893941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 23:50:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769854565] [2024-11-18 23:50:10,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 23:50:10,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 23:50:10,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 23:50:10,648 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:50:10,649 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:50:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 23:50:10,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-18 23:50:10,908 INFO L278 TraceCheckSpWp]: Computing forward predicates...