./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/systemc/bist_cell.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/systemc/bist_cell.cil.c -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 de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 19:02:45,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 19:02:45,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 19:02:45,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 19:02:45,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 19:02:45,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 19:02:45,496 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 19:02:45,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 19:02:45,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 19:02:45,501 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 19:02:45,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 19:02:45,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 19:02:45,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 19:02:45,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 19:02:45,505 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 19:02:45,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 19:02:45,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 19:02:45,506 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 19:02:45,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 19:02:45,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 19:02:45,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 19:02:45,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 19:02:45,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 19:02:45,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 19:02:45,508 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 19:02:45,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 19:02:45,508 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 19:02:45,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 19:02:45,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 19:02:45,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 19:02:45,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 19:02:45,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 19:02:45,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 19:02:45,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 19:02:45,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 19:02:45,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 19:02:45,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 19:02:45,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 19:02:45,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 19:02:45,513 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 19:02:45,513 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 19:02:45,513 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 19:02:45,514 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 -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 [2023-11-22 19:02:45,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 19:02:45,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 19:02:45,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 19:02:45,819 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 19:02:45,820 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 19:02:45,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/bist_cell.cil.c [2023-11-22 19:02:47,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 19:02:47,192 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 19:02:47,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2023-11-22 19:02:47,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd8a0e26/73f029d75b2746ce9e0792700ce3a25c/FLAG7a372feb8 [2023-11-22 19:02:47,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd8a0e26/73f029d75b2746ce9e0792700ce3a25c [2023-11-22 19:02:47,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 19:02:47,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 19:02:47,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 19:02:47,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 19:02:47,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 19:02:47,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e57a815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47, skipping insertion in model container [2023-11-22 19:02:47,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,275 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 19:02:47,401 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2023-11-22 19:02:47,445 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 19:02:47,455 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 19:02:47,464 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c[639,652] [2023-11-22 19:02:47,484 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 19:02:47,500 INFO L206 MainTranslator]: Completed translation [2023-11-22 19:02:47,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47 WrapperNode [2023-11-22 19:02:47,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 19:02:47,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 19:02:47,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 19:02:47,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 19:02:47,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,537 INFO L138 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 229 [2023-11-22 19:02:47,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 19:02:47,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 19:02:47,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 19:02:47,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 19:02:47,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,550 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,559 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 19:02:47,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 19:02:47,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 19:02:47,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 19:02:47,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 19:02:47,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (1/1) ... [2023-11-22 19:02:47,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 19:02:47,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:47,623 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 19:02:47,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 19:02:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 19:02:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-22 19:02:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-22 19:02:47,663 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-22 19:02:47,663 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-22 19:02:47,664 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-22 19:02:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-22 19:02:47,664 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-22 19:02:47,664 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-22 19:02:47,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 19:02:47,665 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-22 19:02:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-22 19:02:47,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 19:02:47,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 19:02:47,726 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 19:02:47,728 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 19:02:48,007 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 19:02:48,052 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 19:02:48,053 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 19:02:48,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:02:48 BoogieIcfgContainer [2023-11-22 19:02:48,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 19:02:48,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 19:02:48,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 19:02:48,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 19:02:48,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:02:47" (1/3) ... [2023-11-22 19:02:48,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80e4190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:02:48, skipping insertion in model container [2023-11-22 19:02:48,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:02:47" (2/3) ... [2023-11-22 19:02:48,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@80e4190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:02:48, skipping insertion in model container [2023-11-22 19:02:48,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:02:48" (3/3) ... [2023-11-22 19:02:48,063 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2023-11-22 19:02:48,078 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 19:02:48,078 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 19:02:48,117 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 19:02:48,123 INFO L357 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, mHoare=true, 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;@5f2cceb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 19:02:48,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 19:02:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.676056338028169) internal successors, (119), 73 states have internal predecessors, (119), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-22 19:02:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-22 19:02:48,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:48,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:48,136 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:48,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:48,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1929751186, now seen corresponding path program 1 times [2023-11-22 19:02:48,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:48,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505278781] [2023-11-22 19:02:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:48,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:48,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:48,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-22 19:02:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:48,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:02:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:48,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-22 19:02:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:02:48,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:48,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505278781] [2023-11-22 19:02:48,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505278781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:48,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:02:48,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-22 19:02:48,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962020541] [2023-11-22 19:02:48,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:48,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-22 19:02:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-22 19:02:48,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 19:02:48,778 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.676056338028169) internal successors, (119), 73 states have internal predecessors, (119), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 19:02:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:49,609 INFO L93 Difference]: Finished difference Result 246 states and 393 transitions. [2023-11-22 19:02:49,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-22 19:02:49,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-11-22 19:02:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:49,620 INFO L225 Difference]: With dead ends: 246 [2023-11-22 19:02:49,621 INFO L226 Difference]: Without dead ends: 158 [2023-11-22 19:02:49,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-11-22 19:02:49,627 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 303 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:49,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 295 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 19:02:49,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-11-22 19:02:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2023-11-22 19:02:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.5952380952380953) internal successors, (134), 85 states have internal predecessors, (134), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-22 19:02:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2023-11-22 19:02:49,676 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 39 [2023-11-22 19:02:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:49,677 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2023-11-22 19:02:49,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 19:02:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2023-11-22 19:02:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 19:02:49,681 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:49,681 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:49,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 19:02:49,682 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:49,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:49,683 INFO L85 PathProgramCache]: Analyzing trace with hash -609134686, now seen corresponding path program 1 times [2023-11-22 19:02:49,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:49,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156002685] [2023-11-22 19:02:49,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:49,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:49,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:49,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 19:02:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 19:02:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:49,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 19:02:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:49,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 19:02:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 19:02:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:02:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 19:02:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:02:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 19:02:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 19:02:50,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:50,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156002685] [2023-11-22 19:02:50,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156002685] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:50,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037520623] [2023-11-22 19:02:50,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:50,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:50,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:50,032 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) [2023-11-22 19:02:50,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 19:02:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 19:02:50,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 19:02:50,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:50,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037520623] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:50,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:50,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-22 19:02:50,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567995573] [2023-11-22 19:02:50,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:50,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:02:50,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:50,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:02:50,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:02:50,215 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:50,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:50,244 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2023-11-22 19:02:50,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:02:50,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-11-22 19:02:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:50,246 INFO L225 Difference]: With dead ends: 194 [2023-11-22 19:02:50,246 INFO L226 Difference]: Without dead ends: 101 [2023-11-22 19:02:50,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:02:50,248 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:50,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 119 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:02:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-22 19:02:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-11-22 19:02:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.5833333333333333) internal successors, (133), 85 states have internal predecessors, (133), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2023-11-22 19:02:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 154 transitions. [2023-11-22 19:02:50,262 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 154 transitions. Word has length 92 [2023-11-22 19:02:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:50,263 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 154 transitions. [2023-11-22 19:02:50,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 154 transitions. [2023-11-22 19:02:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 19:02:50,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:50,266 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:50,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:50,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:50,488 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:50,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:50,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1751637152, now seen corresponding path program 1 times [2023-11-22 19:02:50,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:50,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802320862] [2023-11-22 19:02:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:50,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 19:02:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 19:02:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 19:02:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 19:02:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 19:02:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:02:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 19:02:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:02:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 19:02:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 19:02:50,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:50,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802320862] [2023-11-22 19:02:50,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802320862] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:50,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671362527] [2023-11-22 19:02:50,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:50,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:50,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:50,690 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) [2023-11-22 19:02:50,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 19:02:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:50,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:02:50,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-22 19:02:50,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:50,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671362527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:50,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:50,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 19:02:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712499242] [2023-11-22 19:02:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:50,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:02:50,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:50,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:02:50,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:02:50,902 INFO L87 Difference]: Start difference. First operand 101 states and 154 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:51,065 INFO L93 Difference]: Finished difference Result 302 states and 471 transitions. [2023-11-22 19:02:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:02:51,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-11-22 19:02:51,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:51,068 INFO L225 Difference]: With dead ends: 302 [2023-11-22 19:02:51,068 INFO L226 Difference]: Without dead ends: 211 [2023-11-22 19:02:51,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:02:51,070 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 218 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:51,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 322 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:02:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-11-22 19:02:51,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 198. [2023-11-22 19:02:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 165 states have (on average 1.5757575757575757) internal successors, (260), 168 states have internal predecessors, (260), 19 states have call successors, (19), 11 states have call predecessors, (19), 13 states have return successors, (27), 20 states have call predecessors, (27), 19 states have call successors, (27) [2023-11-22 19:02:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 306 transitions. [2023-11-22 19:02:51,110 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 306 transitions. Word has length 92 [2023-11-22 19:02:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:51,111 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 306 transitions. [2023-11-22 19:02:51,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:51,112 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 306 transitions. [2023-11-22 19:02:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 19:02:51,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:51,119 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:51,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:51,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-22 19:02:51,324 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:51,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:51,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1617302816, now seen corresponding path program 1 times [2023-11-22 19:02:51,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:51,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480807849] [2023-11-22 19:02:51,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:51,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 19:02:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 19:02:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 19:02:51,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 19:02:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 19:02:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:02:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 19:02:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:02:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 19:02:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 19:02:51,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:51,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480807849] [2023-11-22 19:02:51,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480807849] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:51,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242094398] [2023-11-22 19:02:51,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:51,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:51,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:51,470 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) [2023-11-22 19:02:51,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 19:02:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:51,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:02:51,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-22 19:02:51,625 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:51,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242094398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:51,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:51,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 19:02:51,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244659437] [2023-11-22 19:02:51,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:51,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:02:51,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:51,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:02:51,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:02:51,628 INFO L87 Difference]: Start difference. First operand 198 states and 306 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:51,782 INFO L93 Difference]: Finished difference Result 593 states and 936 transitions. [2023-11-22 19:02:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:02:51,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-11-22 19:02:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:51,786 INFO L225 Difference]: With dead ends: 593 [2023-11-22 19:02:51,786 INFO L226 Difference]: Without dead ends: 409 [2023-11-22 19:02:51,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:02:51,788 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 215 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:51,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 314 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:02:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-11-22 19:02:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 395. [2023-11-22 19:02:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 328 states have (on average 1.5609756097560976) internal successors, (512), 337 states have internal predecessors, (512), 37 states have call successors, (37), 21 states have call predecessors, (37), 29 states have return successors, (71), 40 states have call predecessors, (71), 37 states have call successors, (71) [2023-11-22 19:02:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 620 transitions. [2023-11-22 19:02:51,825 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 620 transitions. Word has length 92 [2023-11-22 19:02:51,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:51,825 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 620 transitions. [2023-11-22 19:02:51,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 620 transitions. [2023-11-22 19:02:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-22 19:02:51,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:51,829 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:51,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:52,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:52,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:52,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:52,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1468221796, now seen corresponding path program 1 times [2023-11-22 19:02:52,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:52,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548787419] [2023-11-22 19:02:52,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:52,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 19:02:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 19:02:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 19:02:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-22 19:02:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 19:02:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:02:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 19:02:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:02:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 19:02:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 19:02:52,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:52,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548787419] [2023-11-22 19:02:52,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548787419] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:52,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955465004] [2023-11-22 19:02:52,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:52,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:52,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:52,204 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) [2023-11-22 19:02:52,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 19:02:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:02:52,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-22 19:02:52,377 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:52,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955465004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:52,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:52,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 19:02:52,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038682563] [2023-11-22 19:02:52,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:52,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:02:52,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:52,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:02:52,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:02:52,379 INFO L87 Difference]: Start difference. First operand 395 states and 620 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:52,563 INFO L93 Difference]: Finished difference Result 1308 states and 2136 transitions. [2023-11-22 19:02:52,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:02:52,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2023-11-22 19:02:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:52,569 INFO L225 Difference]: With dead ends: 1308 [2023-11-22 19:02:52,569 INFO L226 Difference]: Without dead ends: 935 [2023-11-22 19:02:52,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:02:52,571 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 233 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:52,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 355 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:02:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2023-11-22 19:02:52,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 863. [2023-11-22 19:02:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 722 states have (on average 1.5401662049861495) internal successors, (1112), 749 states have internal predecessors, (1112), 73 states have call successors, (73), 41 states have call predecessors, (73), 67 states have return successors, (201), 80 states have call predecessors, (201), 73 states have call successors, (201) [2023-11-22 19:02:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1386 transitions. [2023-11-22 19:02:52,629 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1386 transitions. Word has length 92 [2023-11-22 19:02:52,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:52,629 INFO L495 AbstractCegarLoop]: Abstraction has 863 states and 1386 transitions. [2023-11-22 19:02:52,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1386 transitions. [2023-11-22 19:02:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 19:02:52,633 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:52,633 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:52,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:52,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:52,849 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:52,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2131635018, now seen corresponding path program 1 times [2023-11-22 19:02:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:52,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969348522] [2023-11-22 19:02:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:52,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 19:02:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 19:02:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:02:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:52,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 19:02:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 19:02:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 19:02:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:02:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 19:02:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 19:02:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 19:02:53,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:53,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969348522] [2023-11-22 19:02:53,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969348522] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:53,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794980324] [2023-11-22 19:02:53,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:53,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:53,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:53,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:02:53,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 19:02:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:02:53,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:53,197 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-22 19:02:53,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:53,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794980324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 19:02:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507437288] [2023-11-22 19:02:53,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:53,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:02:53,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:53,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:02:53,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:02:53,201 INFO L87 Difference]: Start difference. First operand 863 states and 1386 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:53,410 INFO L93 Difference]: Finished difference Result 2816 states and 4760 transitions. [2023-11-22 19:02:53,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:02:53,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-11-22 19:02:53,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:53,422 INFO L225 Difference]: With dead ends: 2816 [2023-11-22 19:02:53,422 INFO L226 Difference]: Without dead ends: 1993 [2023-11-22 19:02:53,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:02:53,426 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 223 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:53,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 332 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:02:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2023-11-22 19:02:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1885. [2023-11-22 19:02:53,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1578 states have (on average 1.5158428390367553) internal successors, (2392), 1659 states have internal predecessors, (2392), 145 states have call successors, (145), 81 states have call predecessors, (145), 161 states have return successors, (611), 160 states have call predecessors, (611), 145 states have call successors, (611) [2023-11-22 19:02:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 3148 transitions. [2023-11-22 19:02:53,551 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 3148 transitions. Word has length 94 [2023-11-22 19:02:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:53,551 INFO L495 AbstractCegarLoop]: Abstraction has 1885 states and 3148 transitions. [2023-11-22 19:02:53,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 3148 transitions. [2023-11-22 19:02:53,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 19:02:53,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:53,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:53,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:53,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:53,778 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:53,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:53,778 INFO L85 PathProgramCache]: Analyzing trace with hash -86155466, now seen corresponding path program 1 times [2023-11-22 19:02:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:53,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123293917] [2023-11-22 19:02:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:53,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 19:02:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 19:02:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:02:53,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 19:02:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 19:02:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 19:02:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:02:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 19:02:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 19:02:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:53,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 19:02:53,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123293917] [2023-11-22 19:02:53,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123293917] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:53,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641588774] [2023-11-22 19:02:53,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:53,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:53,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:53,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:02:53,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-22 19:02:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 19:02:54,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:02:54,067 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:54,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641588774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:54,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:54,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-22 19:02:54,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226933262] [2023-11-22 19:02:54,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:54,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 19:02:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:54,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 19:02:54,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-22 19:02:54,069 INFO L87 Difference]: Start difference. First operand 1885 states and 3148 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:54,185 INFO L93 Difference]: Finished difference Result 4002 states and 6653 transitions. [2023-11-22 19:02:54,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:02:54,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-11-22 19:02:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:54,197 INFO L225 Difference]: With dead ends: 4002 [2023-11-22 19:02:54,197 INFO L226 Difference]: Without dead ends: 2221 [2023-11-22 19:02:54,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-22 19:02:54,204 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 28 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:54,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 597 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:02:54,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2023-11-22 19:02:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 1949. [2023-11-22 19:02:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1626 states have (on average 1.5006150061500616) internal successors, (2440), 1707 states have internal predecessors, (2440), 145 states have call successors, (145), 81 states have call predecessors, (145), 177 states have return successors, (643), 176 states have call predecessors, (643), 145 states have call successors, (643) [2023-11-22 19:02:54,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 3228 transitions. [2023-11-22 19:02:54,322 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 3228 transitions. Word has length 94 [2023-11-22 19:02:54,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:54,323 INFO L495 AbstractCegarLoop]: Abstraction has 1949 states and 3228 transitions. [2023-11-22 19:02:54,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 3228 transitions. [2023-11-22 19:02:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 19:02:54,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:54,331 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:54,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:54,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:54,551 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:54,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1452184564, now seen corresponding path program 1 times [2023-11-22 19:02:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:54,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940374497] [2023-11-22 19:02:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 19:02:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 19:02:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:02:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 19:02:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 19:02:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 19:02:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:02:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 19:02:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 19:02:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 19:02:54,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940374497] [2023-11-22 19:02:54,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940374497] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041609910] [2023-11-22 19:02:54,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:54,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:54,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:54,685 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:02:54,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-22 19:02:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:54,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:02:54,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-22 19:02:54,823 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:54,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041609910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:54,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:54,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 19:02:54,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44563211] [2023-11-22 19:02:54,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:54,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:02:54,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:54,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:02:54,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:02:54,826 INFO L87 Difference]: Start difference. First operand 1949 states and 3228 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:02:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:54,935 INFO L93 Difference]: Finished difference Result 4258 states and 7036 transitions. [2023-11-22 19:02:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:02:54,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2023-11-22 19:02:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:54,947 INFO L225 Difference]: With dead ends: 4258 [2023-11-22 19:02:54,948 INFO L226 Difference]: Without dead ends: 2413 [2023-11-22 19:02:54,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:02:54,953 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 56 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:54,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 228 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:02:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2413 states. [2023-11-22 19:02:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2413 to 2233. [2023-11-22 19:02:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2233 states, 1814 states have (on average 1.456449834619625) internal successors, (2642), 1895 states have internal predecessors, (2642), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2023-11-22 19:02:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2233 states to 2233 states and 3639 transitions. [2023-11-22 19:02:55,099 INFO L78 Accepts]: Start accepts. Automaton has 2233 states and 3639 transitions. Word has length 94 [2023-11-22 19:02:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:55,099 INFO L495 AbstractCegarLoop]: Abstraction has 2233 states and 3639 transitions. [2023-11-22 19:02:55,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:02:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2233 states and 3639 transitions. [2023-11-22 19:02:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-22 19:02:55,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:55,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:55,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:55,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:55,322 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:55,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash 236030838, now seen corresponding path program 1 times [2023-11-22 19:02:55,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:55,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844003311] [2023-11-22 19:02:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 19:02:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 19:02:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-22 19:02:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 19:02:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 19:02:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 19:02:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:02:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 19:02:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 19:02:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,453 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 19:02:55,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:55,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844003311] [2023-11-22 19:02:55,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844003311] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:55,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173077684] [2023-11-22 19:02:55,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:55,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:55,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:55,455 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:02:55,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-22 19:02:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:55,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 19:02:55,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-22 19:02:55,565 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:55,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173077684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:55,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:55,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-22 19:02:55,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327017124] [2023-11-22 19:02:55,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:55,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 19:02:55,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:55,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 19:02:55,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:02:55,568 INFO L87 Difference]: Start difference. First operand 2233 states and 3639 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:55,694 INFO L93 Difference]: Finished difference Result 4334 states and 7049 transitions. [2023-11-22 19:02:55,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 19:02:55,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2023-11-22 19:02:55,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:55,707 INFO L225 Difference]: With dead ends: 4334 [2023-11-22 19:02:55,707 INFO L226 Difference]: Without dead ends: 2297 [2023-11-22 19:02:55,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:02:55,714 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:55,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:02:55,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2023-11-22 19:02:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2265. [2023-11-22 19:02:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 1846 states have (on average 1.448537378114843) internal successors, (2674), 1927 states have internal predecessors, (2674), 209 states have call successors, (209), 113 states have call predecessors, (209), 209 states have return successors, (788), 256 states have call predecessors, (788), 209 states have call successors, (788) [2023-11-22 19:02:55,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3671 transitions. [2023-11-22 19:02:55,831 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3671 transitions. Word has length 94 [2023-11-22 19:02:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:55,832 INFO L495 AbstractCegarLoop]: Abstraction has 2265 states and 3671 transitions. [2023-11-22 19:02:55,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3671 transitions. [2023-11-22 19:02:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-22 19:02:55,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:55,842 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:55,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:56,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-22 19:02:56,057 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:56,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1971241955, now seen corresponding path program 1 times [2023-11-22 19:02:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:56,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23593067] [2023-11-22 19:02:56,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 19:02:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 19:02:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 19:02:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 19:02:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-22 19:02:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-22 19:02:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 19:02:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 19:02:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 19:02:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 19:02:56,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:56,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23593067] [2023-11-22 19:02:56,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23593067] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:56,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998257813] [2023-11-22 19:02:56,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:56,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:56,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:56,197 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:02:56,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-22 19:02:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:02:56,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 19:02:56,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:56,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998257813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:56,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:56,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 19:02:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708682390] [2023-11-22 19:02:56,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:56,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:02:56,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:02:56,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:02:56,313 INFO L87 Difference]: Start difference. First operand 2265 states and 3671 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:02:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:56,421 INFO L93 Difference]: Finished difference Result 4634 states and 7890 transitions. [2023-11-22 19:02:56,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:02:56,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2023-11-22 19:02:56,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:56,434 INFO L225 Difference]: With dead ends: 4634 [2023-11-22 19:02:56,434 INFO L226 Difference]: Without dead ends: 2549 [2023-11-22 19:02:56,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:02:56,441 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 18 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:56,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 231 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:02:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2023-11-22 19:02:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2549. [2023-11-22 19:02:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2549 states, 2034 states have (on average 1.4267453294001966) internal successors, (2902), 2115 states have internal predecessors, (2902), 273 states have call successors, (273), 145 states have call predecessors, (273), 241 states have return successors, (1046), 320 states have call predecessors, (1046), 273 states have call successors, (1046) [2023-11-22 19:02:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2549 states to 2549 states and 4221 transitions. [2023-11-22 19:02:56,608 INFO L78 Accepts]: Start accepts. Automaton has 2549 states and 4221 transitions. Word has length 96 [2023-11-22 19:02:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:56,608 INFO L495 AbstractCegarLoop]: Abstraction has 2549 states and 4221 transitions. [2023-11-22 19:02:56,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:02:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2549 states and 4221 transitions. [2023-11-22 19:02:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-22 19:02:56,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:56,619 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:56,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:56,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-22 19:02:56,834 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:56,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:56,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1181222875, now seen corresponding path program 1 times [2023-11-22 19:02:56,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:56,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054648632] [2023-11-22 19:02:56,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:56,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 19:02:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 19:02:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 19:02:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 19:02:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-22 19:02:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-22 19:02:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 19:02:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 19:02:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 19:02:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 19:02:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054648632] [2023-11-22 19:02:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054648632] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262678087] [2023-11-22 19:02:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:56,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:56,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:56,959 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:02:56,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-22 19:02:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:57,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:02:57,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:02:57,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:57,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262678087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:57,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:57,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-22 19:02:57,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418948462] [2023-11-22 19:02:57,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:57,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:02:57,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:57,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:02:57,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:02:57,114 INFO L87 Difference]: Start difference. First operand 2549 states and 4221 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:02:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:57,447 INFO L93 Difference]: Finished difference Result 7898 states and 13749 transitions. [2023-11-22 19:02:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:02:57,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2023-11-22 19:02:57,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:57,479 INFO L225 Difference]: With dead ends: 7898 [2023-11-22 19:02:57,479 INFO L226 Difference]: Without dead ends: 5577 [2023-11-22 19:02:57,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:02:57,491 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 183 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:57,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 576 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:02:57,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2023-11-22 19:02:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 5493. [2023-11-22 19:02:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5493 states, 4456 states have (on average 1.4254937163375225) internal successors, (6352), 4723 states have internal predecessors, (6352), 481 states have call successors, (481), 257 states have call predecessors, (481), 555 states have return successors, (2556), 576 states have call predecessors, (2556), 481 states have call successors, (2556) [2023-11-22 19:02:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 9389 transitions. [2023-11-22 19:02:57,866 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 9389 transitions. Word has length 96 [2023-11-22 19:02:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:57,866 INFO L495 AbstractCegarLoop]: Abstraction has 5493 states and 9389 transitions. [2023-11-22 19:02:57,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:02:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 9389 transitions. [2023-11-22 19:02:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-22 19:02:57,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:57,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:57,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:58,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-22 19:02:58,104 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:58,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1860495129, now seen corresponding path program 1 times [2023-11-22 19:02:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:58,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393843108] [2023-11-22 19:02:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:58,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-22 19:02:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 19:02:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 19:02:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-22 19:02:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-22 19:02:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-22 19:02:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 19:02:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 19:02:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 19:02:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-22 19:02:58,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:58,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393843108] [2023-11-22 19:02:58,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393843108] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:58,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196533096] [2023-11-22 19:02:58,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:58,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:58,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:58,275 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:02:58,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-22 19:02:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:58,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 19:02:58,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 19:02:58,421 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196533096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:58,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:58,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 19:02:58,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852386129] [2023-11-22 19:02:58,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:58,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:02:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:58,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:02:58,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:02:58,423 INFO L87 Difference]: Start difference. First operand 5493 states and 9389 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:58,759 INFO L93 Difference]: Finished difference Result 11994 states and 20213 transitions. [2023-11-22 19:02:58,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:02:58,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2023-11-22 19:02:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:58,795 INFO L225 Difference]: With dead ends: 11994 [2023-11-22 19:02:58,795 INFO L226 Difference]: Without dead ends: 6727 [2023-11-22 19:02:58,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-22 19:02:58,812 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 61 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:58,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 304 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:02:58,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6727 states. [2023-11-22 19:02:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6727 to 5493. [2023-11-22 19:02:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5493 states, 4456 states have (on average 1.4252692998204668) internal successors, (6351), 4723 states have internal predecessors, (6351), 481 states have call successors, (481), 257 states have call predecessors, (481), 555 states have return successors, (2556), 576 states have call predecessors, (2556), 481 states have call successors, (2556) [2023-11-22 19:02:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5493 states to 5493 states and 9388 transitions. [2023-11-22 19:02:59,201 INFO L78 Accepts]: Start accepts. Automaton has 5493 states and 9388 transitions. Word has length 96 [2023-11-22 19:02:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:59,201 INFO L495 AbstractCegarLoop]: Abstraction has 5493 states and 9388 transitions. [2023-11-22 19:02:59,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:02:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 5493 states and 9388 transitions. [2023-11-22 19:02:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-22 19:02:59,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:59,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:59,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:59,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-22 19:02:59,454 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:59,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash -315091207, now seen corresponding path program 1 times [2023-11-22 19:02:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:02:59,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89507235] [2023-11-22 19:02:59,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:59,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:02:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:02:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 19:02:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 19:02:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 19:02:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-22 19:02:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 19:02:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-22 19:02:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 19:02:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-22 19:02:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 19:02:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 19:02:59,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:02:59,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89507235] [2023-11-22 19:02:59,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89507235] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:02:59,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397608841] [2023-11-22 19:02:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:02:59,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:02:59,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:02:59,588 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:02:59,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-22 19:02:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:02:59,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:02:59,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 19:02:59,695 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:02:59,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397608841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:02:59,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:02:59,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 19:02:59,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020799999] [2023-11-22 19:02:59,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:02:59,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:02:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:02:59,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:02:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:02:59,697 INFO L87 Difference]: Start difference. First operand 5493 states and 9388 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:02:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:59,900 INFO L93 Difference]: Finished difference Result 10940 states and 19073 transitions. [2023-11-22 19:02:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:02:59,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2023-11-22 19:02:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:59,928 INFO L225 Difference]: With dead ends: 10940 [2023-11-22 19:02:59,928 INFO L226 Difference]: Without dead ends: 5853 [2023-11-22 19:02:59,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:02:59,946 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 15 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:59,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 236 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:02:59,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2023-11-22 19:03:00,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 5853. [2023-11-22 19:03:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4680 states have (on average 1.416025641025641) internal successors, (6627), 4939 states have internal predecessors, (6627), 577 states have call successors, (577), 305 states have call predecessors, (577), 595 states have return successors, (2916), 672 states have call predecessors, (2916), 577 states have call successors, (2916) [2023-11-22 19:03:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 10120 transitions. [2023-11-22 19:03:00,294 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 10120 transitions. Word has length 97 [2023-11-22 19:03:00,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:00,294 INFO L495 AbstractCegarLoop]: Abstraction has 5853 states and 10120 transitions. [2023-11-22 19:03:00,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:03:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 10120 transitions. [2023-11-22 19:03:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-22 19:03:00,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:00,320 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:00,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-22 19:03:00,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-22 19:03:00,535 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:00,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1457593673, now seen corresponding path program 1 times [2023-11-22 19:03:00,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:00,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368676255] [2023-11-22 19:03:00,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:00,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-22 19:03:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 19:03:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-22 19:03:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-22 19:03:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 19:03:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-22 19:03:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 19:03:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-22 19:03:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 19:03:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 19:03:00,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:00,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368676255] [2023-11-22 19:03:00,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368676255] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:00,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384983796] [2023-11-22 19:03:00,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:00,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:00,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:00,683 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:00,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-22 19:03:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:00,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 19:03:00,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 19:03:00,830 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:00,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384983796] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:00,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:00,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-11-22 19:03:00,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869277190] [2023-11-22 19:03:00,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:00,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:00,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:00,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:03:00,832 INFO L87 Difference]: Start difference. First operand 5853 states and 10120 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:03:01,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:01,205 INFO L93 Difference]: Finished difference Result 12398 states and 21091 transitions. [2023-11-22 19:03:01,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:03:01,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2023-11-22 19:03:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:01,237 INFO L225 Difference]: With dead ends: 12398 [2023-11-22 19:03:01,238 INFO L226 Difference]: Without dead ends: 6807 [2023-11-22 19:03:01,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-22 19:03:01,258 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 77 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:01,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 230 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:03:01,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states. [2023-11-22 19:03:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 5853. [2023-11-22 19:03:01,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4680 states have (on average 1.4151709401709403) internal successors, (6623), 4939 states have internal predecessors, (6623), 577 states have call successors, (577), 305 states have call predecessors, (577), 595 states have return successors, (2916), 672 states have call predecessors, (2916), 577 states have call successors, (2916) [2023-11-22 19:03:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 10116 transitions. [2023-11-22 19:03:01,663 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 10116 transitions. Word has length 97 [2023-11-22 19:03:01,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:01,663 INFO L495 AbstractCegarLoop]: Abstraction has 5853 states and 10116 transitions. [2023-11-22 19:03:01,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:03:01,663 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 10116 transitions. [2023-11-22 19:03:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 19:03:01,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:01,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:01,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-22 19:03:01,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-22 19:03:01,900 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:01,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:01,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1091145433, now seen corresponding path program 1 times [2023-11-22 19:03:01,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:01,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554423917] [2023-11-22 19:03:01,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:01,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:01,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:02,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 19:03:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:02,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 19:03:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:02,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 19:03:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:02,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:02,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 19:03:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:02,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 19:03:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:02,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:02,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 19:03:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 19:03:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 19:03:02,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:02,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554423917] [2023-11-22 19:03:02,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554423917] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:02,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057523295] [2023-11-22 19:03:02,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:02,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:02,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:02,036 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:02,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-22 19:03:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:02,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:02,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:02,144 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 19:03:02,144 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:02,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057523295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:02,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:02,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-22 19:03:02,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867608655] [2023-11-22 19:03:02,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:02,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:02,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:02,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:02,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:03:02,146 INFO L87 Difference]: Start difference. First operand 5853 states and 10116 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:03:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:02,474 INFO L93 Difference]: Finished difference Result 11856 states and 20687 transitions. [2023-11-22 19:03:02,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:02,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2023-11-22 19:03:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:02,499 INFO L225 Difference]: With dead ends: 11856 [2023-11-22 19:03:02,500 INFO L226 Difference]: Without dead ends: 6465 [2023-11-22 19:03:02,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:03:02,512 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:02,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 235 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:03:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6465 states. [2023-11-22 19:03:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6465 to 6465. [2023-11-22 19:03:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6465 states, 5076 states have (on average 1.3977541371158393) internal successors, (7095), 5335 states have internal predecessors, (7095), 721 states have call successors, (721), 377 states have call predecessors, (721), 667 states have return successors, (3444), 816 states have call predecessors, (3444), 721 states have call successors, (3444) [2023-11-22 19:03:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6465 states to 6465 states and 11260 transitions. [2023-11-22 19:03:02,882 INFO L78 Accepts]: Start accepts. Automaton has 6465 states and 11260 transitions. Word has length 99 [2023-11-22 19:03:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:02,884 INFO L495 AbstractCegarLoop]: Abstraction has 6465 states and 11260 transitions. [2023-11-22 19:03:02,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:03:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 6465 states and 11260 transitions. [2023-11-22 19:03:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 19:03:02,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:02,910 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:02,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-22 19:03:03,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:03,124 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:03,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1930179095, now seen corresponding path program 1 times [2023-11-22 19:03:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:03,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758275234] [2023-11-22 19:03:03,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:03,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 19:03:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 19:03:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 19:03:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 19:03:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 19:03:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 19:03:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 19:03:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 19:03:03,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:03,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758275234] [2023-11-22 19:03:03,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758275234] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:03,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368508616] [2023-11-22 19:03:03,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:03,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:03,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:03,247 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:03,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-22 19:03:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:03,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:03:03,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:03:03,400 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:03,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368508616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:03,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-22 19:03:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758941066] [2023-11-22 19:03:03,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:03,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:03,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:03,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:03,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:03:03,402 INFO L87 Difference]: Start difference. First operand 6465 states and 11260 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:03:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:03,852 INFO L93 Difference]: Finished difference Result 12480 states and 20997 transitions. [2023-11-22 19:03:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:03:03,853 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), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2023-11-22 19:03:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:03,883 INFO L225 Difference]: With dead ends: 12480 [2023-11-22 19:03:03,883 INFO L226 Difference]: Without dead ends: 6565 [2023-11-22 19:03:03,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:03:03,900 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 178 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:03,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 547 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:03:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6565 states. [2023-11-22 19:03:04,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6565 to 6561. [2023-11-22 19:03:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6561 states, 5148 states have (on average 1.385975135975136) internal successors, (7135), 5431 states have internal predecessors, (7135), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-11-22 19:03:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6561 states to 6561 states and 10872 transitions. [2023-11-22 19:03:04,386 INFO L78 Accepts]: Start accepts. Automaton has 6561 states and 10872 transitions. Word has length 99 [2023-11-22 19:03:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:04,387 INFO L495 AbstractCegarLoop]: Abstraction has 6561 states and 10872 transitions. [2023-11-22 19:03:04,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:03:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 6561 states and 10872 transitions. [2023-11-22 19:03:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 19:03:04,412 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:04,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:04,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-22 19:03:04,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-22 19:03:04,626 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:04,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:04,626 INFO L85 PathProgramCache]: Analyzing trace with hash -96433003, now seen corresponding path program 2 times [2023-11-22 19:03:04,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:04,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886185991] [2023-11-22 19:03:04,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:04,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:04,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:04,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 19:03:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:04,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 19:03:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 19:03:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:04,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:04,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 19:03:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 19:03:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:04,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:04,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 19:03:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 19:03:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 19:03:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886185991] [2023-11-22 19:03:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886185991] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:04,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580132861] [2023-11-22 19:03:04,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 19:03:04,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:04,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:04,756 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:04,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-22 19:03:04,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-22 19:03:04,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 19:03:04,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 19:03:04,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-22 19:03:04,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:04,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580132861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:04,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:04,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-22 19:03:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908370292] [2023-11-22 19:03:04,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:04,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 19:03:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:04,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 19:03:04,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:03:04,852 INFO L87 Difference]: Start difference. First operand 6561 states and 10872 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 19:03:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:05,204 INFO L93 Difference]: Finished difference Result 8221 states and 15175 transitions. [2023-11-22 19:03:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 19:03:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 99 [2023-11-22 19:03:05,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:05,251 INFO L225 Difference]: With dead ends: 8221 [2023-11-22 19:03:05,251 INFO L226 Difference]: Without dead ends: 8217 [2023-11-22 19:03:05,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:03:05,260 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 37 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:05,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 447 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:03:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2023-11-22 19:03:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 6689. [2023-11-22 19:03:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6689 states, 5276 states have (on average 1.3766110689916604) internal successors, (7263), 5559 states have internal predecessors, (7263), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-11-22 19:03:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 11000 transitions. [2023-11-22 19:03:05,801 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 11000 transitions. Word has length 99 [2023-11-22 19:03:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:05,801 INFO L495 AbstractCegarLoop]: Abstraction has 6689 states and 11000 transitions. [2023-11-22 19:03:05,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 19:03:05,801 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 11000 transitions. [2023-11-22 19:03:05,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-11-22 19:03:05,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:05,823 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:05,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-22 19:03:06,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-22 19:03:06,042 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:06,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:06,043 INFO L85 PathProgramCache]: Analyzing trace with hash -39174701, now seen corresponding path program 1 times [2023-11-22 19:03:06,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:06,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916870734] [2023-11-22 19:03:06,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:06,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 19:03:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 19:03:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 19:03:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 19:03:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 19:03:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-22 19:03:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-22 19:03:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 19:03:06,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:06,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916870734] [2023-11-22 19:03:06,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916870734] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:06,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431025408] [2023-11-22 19:03:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:06,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:06,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:06,160 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:06,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-22 19:03:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:06,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 19:03:06,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-22 19:03:06,290 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:06,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431025408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:06,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:06,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-11-22 19:03:06,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968907358] [2023-11-22 19:03:06,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:06,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 19:03:06,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:06,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 19:03:06,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-22 19:03:06,292 INFO L87 Difference]: Start difference. First operand 6689 states and 11000 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 19:03:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:06,554 INFO L93 Difference]: Finished difference Result 12748 states and 20399 transitions. [2023-11-22 19:03:06,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:03:06,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 99 [2023-11-22 19:03:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:06,577 INFO L225 Difference]: With dead ends: 12748 [2023-11-22 19:03:06,578 INFO L226 Difference]: Without dead ends: 6625 [2023-11-22 19:03:06,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:03:06,592 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:06,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 584 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:03:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2023-11-22 19:03:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 6625. [2023-11-22 19:03:06,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6625 states, 5212 states have (on average 1.3689562547966232) internal successors, (7135), 5495 states have internal predecessors, (7135), 721 states have call successors, (721), 377 states have call predecessors, (721), 691 states have return successors, (3016), 816 states have call predecessors, (3016), 721 states have call successors, (3016) [2023-11-22 19:03:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 10872 transitions. [2023-11-22 19:03:06,979 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 10872 transitions. Word has length 99 [2023-11-22 19:03:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:06,980 INFO L495 AbstractCegarLoop]: Abstraction has 6625 states and 10872 transitions. [2023-11-22 19:03:06,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 19:03:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10872 transitions. [2023-11-22 19:03:07,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-22 19:03:07,005 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:07,005 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:07,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-22 19:03:07,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-22 19:03:07,220 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:07,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:07,221 INFO L85 PathProgramCache]: Analyzing trace with hash 871855670, now seen corresponding path program 1 times [2023-11-22 19:03:07,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:07,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190741944] [2023-11-22 19:03:07,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:07,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 19:03:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 19:03:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 19:03:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 19:03:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 19:03:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 19:03:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 19:03:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 19:03:07,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:07,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190741944] [2023-11-22 19:03:07,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190741944] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:07,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412796279] [2023-11-22 19:03:07,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:07,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:07,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:07,327 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:07,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-22 19:03:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:07,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:03:07,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:07,486 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:03:07,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:07,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412796279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:07,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:07,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2023-11-22 19:03:07,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683291682] [2023-11-22 19:03:07,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:07,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:07,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:07,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:03:07,489 INFO L87 Difference]: Start difference. First operand 6625 states and 10872 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:03:07,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:07,919 INFO L93 Difference]: Finished difference Result 12940 states and 20614 transitions. [2023-11-22 19:03:07,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:03:07,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2023-11-22 19:03:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:07,942 INFO L225 Difference]: With dead ends: 12940 [2023-11-22 19:03:07,942 INFO L226 Difference]: Without dead ends: 6845 [2023-11-22 19:03:07,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:03:07,957 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 192 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:07,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 570 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:03:07,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2023-11-22 19:03:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 6841. [2023-11-22 19:03:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6841 states, 5392 states have (on average 1.3492210682492582) internal successors, (7275), 5711 states have internal predecessors, (7275), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2656), 816 states have call predecessors, (2656), 721 states have call successors, (2656) [2023-11-22 19:03:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 10652 transitions. [2023-11-22 19:03:08,318 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 10652 transitions. Word has length 102 [2023-11-22 19:03:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:08,319 INFO L495 AbstractCegarLoop]: Abstraction has 6841 states and 10652 transitions. [2023-11-22 19:03:08,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:03:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 10652 transitions. [2023-11-22 19:03:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-22 19:03:08,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:08,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:08,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-22 19:03:08,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:08,556 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:08,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash -814324168, now seen corresponding path program 1 times [2023-11-22 19:03:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:08,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658927624] [2023-11-22 19:03:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:08,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 19:03:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-22 19:03:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-22 19:03:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 19:03:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-22 19:03:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 19:03:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 19:03:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 19:03:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-22 19:03:08,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:08,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658927624] [2023-11-22 19:03:08,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658927624] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:08,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942974433] [2023-11-22 19:03:08,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:08,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:08,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:08,657 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:08,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-22 19:03:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:08,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 19:03:08,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-22 19:03:08,775 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:08,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942974433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:08,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-11-22 19:03:08,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768138015] [2023-11-22 19:03:08,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:08,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:08,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:08,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:03:08,777 INFO L87 Difference]: Start difference. First operand 6841 states and 10652 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:03:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:09,180 INFO L93 Difference]: Finished difference Result 14070 states and 21801 transitions. [2023-11-22 19:03:09,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:03:09,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2023-11-22 19:03:09,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:09,199 INFO L225 Difference]: With dead ends: 14070 [2023-11-22 19:03:09,200 INFO L226 Difference]: Without dead ends: 7543 [2023-11-22 19:03:09,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:03:09,209 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 76 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:09,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 222 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:03:09,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7543 states. [2023-11-22 19:03:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7543 to 6841. [2023-11-22 19:03:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6841 states, 5392 states have (on average 1.3477373887240356) internal successors, (7267), 5711 states have internal predecessors, (7267), 721 states have call successors, (721), 377 states have call predecessors, (721), 727 states have return successors, (2656), 816 states have call predecessors, (2656), 721 states have call successors, (2656) [2023-11-22 19:03:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6841 states to 6841 states and 10644 transitions. [2023-11-22 19:03:09,580 INFO L78 Accepts]: Start accepts. Automaton has 6841 states and 10644 transitions. Word has length 102 [2023-11-22 19:03:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:09,581 INFO L495 AbstractCegarLoop]: Abstraction has 6841 states and 10644 transitions. [2023-11-22 19:03:09,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:03:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 6841 states and 10644 transitions. [2023-11-22 19:03:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 19:03:09,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:09,602 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:09,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-22 19:03:09,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:09,817 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:09,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:09,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1864122538, now seen corresponding path program 1 times [2023-11-22 19:03:09,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:09,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070124862] [2023-11-22 19:03:09,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:09,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:09,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:09,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:09,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:09,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:09,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 19:03:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:09,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 19:03:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:09,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:03:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:09,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:03:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:09,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 19:03:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 19:03:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 19:03:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 19:03:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070124862] [2023-11-22 19:03:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070124862] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405347798] [2023-11-22 19:03:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:09,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:09,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:09,929 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:09,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-22 19:03:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:10,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:10,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 19:03:10,040 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:10,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405347798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:10,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:10,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-22 19:03:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108430037] [2023-11-22 19:03:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:10,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:10,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:10,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-22 19:03:10,042 INFO L87 Difference]: Start difference. First operand 6841 states and 10644 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:03:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:10,334 INFO L93 Difference]: Finished difference Result 14110 states and 21908 transitions. [2023-11-22 19:03:10,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:10,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2023-11-22 19:03:10,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:10,361 INFO L225 Difference]: With dead ends: 14110 [2023-11-22 19:03:10,361 INFO L226 Difference]: Without dead ends: 7803 [2023-11-22 19:03:10,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-22 19:03:10,376 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 22 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:10,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 237 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:03:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7803 states. [2023-11-22 19:03:10,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7803 to 7803. [2023-11-22 19:03:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7803 states, 6030 states have (on average 1.3203980099502488) internal successors, (7962), 6349 states have internal predecessors, (7962), 937 states have call successors, (937), 485 states have call predecessors, (937), 835 states have return successors, (3180), 1032 states have call predecessors, (3180), 937 states have call successors, (3180) [2023-11-22 19:03:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7803 states to 7803 states and 12079 transitions. [2023-11-22 19:03:11,002 INFO L78 Accepts]: Start accepts. Automaton has 7803 states and 12079 transitions. Word has length 104 [2023-11-22 19:03:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:11,003 INFO L495 AbstractCegarLoop]: Abstraction has 7803 states and 12079 transitions. [2023-11-22 19:03:11,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:03:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 7803 states and 12079 transitions. [2023-11-22 19:03:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 19:03:11,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:11,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:11,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-22 19:03:11,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-22 19:03:11,244 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:11,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:11,244 INFO L85 PathProgramCache]: Analyzing trace with hash 721620072, now seen corresponding path program 1 times [2023-11-22 19:03:11,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:11,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71876916] [2023-11-22 19:03:11,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:11,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 19:03:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 19:03:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:03:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:03:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 19:03:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 19:03:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 19:03:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 19:03:11,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:11,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71876916] [2023-11-22 19:03:11,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71876916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:11,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881428051] [2023-11-22 19:03:11,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:11,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:11,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:11,370 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:11,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-22 19:03:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:11,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:03:11,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:03:11,526 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881428051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:11,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:11,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-11-22 19:03:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574189426] [2023-11-22 19:03:11,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:11,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:11,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:03:11,529 INFO L87 Difference]: Start difference. First operand 7803 states and 12079 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:03:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:12,081 INFO L93 Difference]: Finished difference Result 15114 states and 22661 transitions. [2023-11-22 19:03:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:03:12,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 104 [2023-11-22 19:03:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:12,111 INFO L225 Difference]: With dead ends: 15114 [2023-11-22 19:03:12,111 INFO L226 Difference]: Without dead ends: 7969 [2023-11-22 19:03:12,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-11-22 19:03:12,131 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 173 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:12,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 508 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:03:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7969 states. [2023-11-22 19:03:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7969 to 7965. [2023-11-22 19:03:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 6138 states have (on average 1.30514825676116) internal successors, (8011), 6511 states have internal predecessors, (8011), 937 states have call successors, (937), 485 states have call predecessors, (937), 889 states have return successors, (2884), 1032 states have call predecessors, (2884), 937 states have call successors, (2884) [2023-11-22 19:03:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 11832 transitions. [2023-11-22 19:03:12,702 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 11832 transitions. Word has length 104 [2023-11-22 19:03:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:12,703 INFO L495 AbstractCegarLoop]: Abstraction has 7965 states and 11832 transitions. [2023-11-22 19:03:12,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-22 19:03:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 11832 transitions. [2023-11-22 19:03:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-22 19:03:12,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:12,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:12,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-22 19:03:12,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-22 19:03:12,943 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:12,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1400892326, now seen corresponding path program 1 times [2023-11-22 19:03:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:12,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474714872] [2023-11-22 19:03:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:12,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:13,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 19:03:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 19:03:13,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:03:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:03:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 19:03:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 19:03:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 19:03:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 19:03:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:13,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474714872] [2023-11-22 19:03:13,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474714872] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766487454] [2023-11-22 19:03:13,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:13,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:13,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:13,107 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:13,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-22 19:03:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:13,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-22 19:03:13,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-22 19:03:13,312 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:13,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766487454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:13,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:13,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-11-22 19:03:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217319153] [2023-11-22 19:03:13,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:13,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 19:03:13,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:13,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 19:03:13,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:03:13,314 INFO L87 Difference]: Start difference. First operand 7965 states and 11832 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 19:03:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:13,817 INFO L93 Difference]: Finished difference Result 11491 states and 16748 transitions. [2023-11-22 19:03:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 19:03:13,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 104 [2023-11-22 19:03:13,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:13,851 INFO L225 Difference]: With dead ends: 11491 [2023-11-22 19:03:13,851 INFO L226 Difference]: Without dead ends: 11487 [2023-11-22 19:03:13,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:03:13,857 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 159 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:13,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 206 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:03:13,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11487 states. [2023-11-22 19:03:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11487 to 11455. [2023-11-22 19:03:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11455 states, 8966 states have (on average 1.299018514387687) internal successors, (11647), 9469 states have internal predecessors, (11647), 1211 states have call successors, (1211), 727 states have call predecessors, (1211), 1277 states have return successors, (3839), 1354 states have call predecessors, (3839), 1211 states have call successors, (3839) [2023-11-22 19:03:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11455 states to 11455 states and 16697 transitions. [2023-11-22 19:03:14,422 INFO L78 Accepts]: Start accepts. Automaton has 11455 states and 16697 transitions. Word has length 104 [2023-11-22 19:03:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:14,422 INFO L495 AbstractCegarLoop]: Abstraction has 11455 states and 16697 transitions. [2023-11-22 19:03:14,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-22 19:03:14,423 INFO L276 IsEmpty]: Start isEmpty. Operand 11455 states and 16697 transitions. [2023-11-22 19:03:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-22 19:03:14,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:14,444 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:14,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-11-22 19:03:14,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:14,644 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:14,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:14,645 INFO L85 PathProgramCache]: Analyzing trace with hash 529672484, now seen corresponding path program 1 times [2023-11-22 19:03:14,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:14,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939751825] [2023-11-22 19:03:14,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:14,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-22 19:03:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-22 19:03:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-22 19:03:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 19:03:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-22 19:03:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-22 19:03:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-22 19:03:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 19:03:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:14,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939751825] [2023-11-22 19:03:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939751825] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:14,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658239699] [2023-11-22 19:03:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:14,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:14,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:14,759 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:14,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-22 19:03:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:14,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:03:14,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-22 19:03:14,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:03:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-22 19:03:15,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658239699] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:15,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:03:15,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 4] total 11 [2023-11-22 19:03:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744572272] [2023-11-22 19:03:15,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:15,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:15,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:15,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:03:15,106 INFO L87 Difference]: Start difference. First operand 11455 states and 16697 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:03:16,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:16,016 INFO L93 Difference]: Finished difference Result 33048 states and 48522 transitions. [2023-11-22 19:03:16,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:03:16,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2023-11-22 19:03:16,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:16,083 INFO L225 Difference]: With dead ends: 33048 [2023-11-22 19:03:16,083 INFO L226 Difference]: Without dead ends: 21671 [2023-11-22 19:03:16,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-22 19:03:16,111 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 157 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:16,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 300 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:03:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21671 states. [2023-11-22 19:03:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21671 to 21139. [2023-11-22 19:03:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21139 states, 16631 states have (on average 1.259575491551921) internal successors, (20948), 17751 states have internal predecessors, (20948), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 19:03:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21139 states to 21139 states and 29128 transitions. [2023-11-22 19:03:17,181 INFO L78 Accepts]: Start accepts. Automaton has 21139 states and 29128 transitions. Word has length 106 [2023-11-22 19:03:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:17,181 INFO L495 AbstractCegarLoop]: Abstraction has 21139 states and 29128 transitions. [2023-11-22 19:03:17,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-22 19:03:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 21139 states and 29128 transitions. [2023-11-22 19:03:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-22 19:03:17,197 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:17,198 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:17,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-22 19:03:17,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:17,398 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:17,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1787052981, now seen corresponding path program 1 times [2023-11-22 19:03:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256043829] [2023-11-22 19:03:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:17,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 19:03:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 19:03:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-22 19:03:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-22 19:03:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-22 19:03:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-22 19:03:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-22 19:03:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-22 19:03:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 19:03:17,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:17,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256043829] [2023-11-22 19:03:17,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256043829] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:17,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322743989] [2023-11-22 19:03:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:17,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:17,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:17,573 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:17,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-22 19:03:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:17,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-22 19:03:17,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:17,681 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:03:17,681 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:17,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322743989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:17,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:17,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-22 19:03:17,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337619747] [2023-11-22 19:03:17,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:17,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:17,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:17,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:17,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:03:17,684 INFO L87 Difference]: Start difference. First operand 21139 states and 29128 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 19:03:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:18,454 INFO L93 Difference]: Finished difference Result 42166 states and 57974 transitions. [2023-11-22 19:03:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2023-11-22 19:03:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:18,522 INFO L225 Difference]: With dead ends: 42166 [2023-11-22 19:03:18,522 INFO L226 Difference]: Without dead ends: 21379 [2023-11-22 19:03:18,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:03:18,578 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:18,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 226 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:03:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21379 states. [2023-11-22 19:03:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21379 to 21283. [2023-11-22 19:03:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.2573472429210135) internal successors, (21092), 17895 states have internal predecessors, (21092), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 19:03:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 29272 transitions. [2023-11-22 19:03:19,842 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 29272 transitions. Word has length 119 [2023-11-22 19:03:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:19,842 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 29272 transitions. [2023-11-22 19:03:19,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 19:03:19,842 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 29272 transitions. [2023-11-22 19:03:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-22 19:03:19,865 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:19,865 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:19,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-11-22 19:03:20,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-22 19:03:20,067 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:20,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:20,067 INFO L85 PathProgramCache]: Analyzing trace with hash -883405082, now seen corresponding path program 1 times [2023-11-22 19:03:20,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:20,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701710863] [2023-11-22 19:03:20,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:20,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 19:03:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 19:03:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 19:03:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-22 19:03:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 19:03:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 19:03:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 19:03:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-22 19:03:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 19:03:20,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:20,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701710863] [2023-11-22 19:03:20,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701710863] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:20,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736104005] [2023-11-22 19:03:20,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:20,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:20,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:20,222 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:20,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-22 19:03:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:20,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:20,334 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:03:20,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:20,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736104005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:20,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:20,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-11-22 19:03:20,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126092036] [2023-11-22 19:03:20,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:20,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:20,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:20,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:03:20,351 INFO L87 Difference]: Start difference. First operand 21283 states and 29272 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 19:03:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:21,203 INFO L93 Difference]: Finished difference Result 42262 states and 57878 transitions. [2023-11-22 19:03:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:21,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 120 [2023-11-22 19:03:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:21,269 INFO L225 Difference]: With dead ends: 42262 [2023-11-22 19:03:21,269 INFO L226 Difference]: Without dead ends: 21331 [2023-11-22 19:03:21,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:03:21,307 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:21,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 221 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:03:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21331 states. [2023-11-22 19:03:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21331 to 21283. [2023-11-22 19:03:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.24876304023845) internal successors, (20948), 17895 states have internal predecessors, (20948), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 19:03:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 29128 transitions. [2023-11-22 19:03:22,358 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 29128 transitions. Word has length 120 [2023-11-22 19:03:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:22,358 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 29128 transitions. [2023-11-22 19:03:22,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 19:03:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 29128 transitions. [2023-11-22 19:03:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-22 19:03:22,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:22,378 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:22,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-11-22 19:03:22,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-22 19:03:22,578 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:22,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:22,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1018147445, now seen corresponding path program 1 times [2023-11-22 19:03:22,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:22,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425617713] [2023-11-22 19:03:22,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:22,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 19:03:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 19:03:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 19:03:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-22 19:03:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-22 19:03:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-22 19:03:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-22 19:03:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-22 19:03:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 19:03:22,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:22,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425617713] [2023-11-22 19:03:22,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425617713] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:22,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955753051] [2023-11-22 19:03:22,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:22,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:22,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:22,734 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:22,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-22 19:03:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:22,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:22,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:03:22,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:22,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955753051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:22,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:22,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2023-11-22 19:03:22,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604876329] [2023-11-22 19:03:22,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:22,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:22,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:22,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:22,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-22 19:03:22,947 INFO L87 Difference]: Start difference. First operand 21283 states and 29128 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 19:03:23,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:23,800 INFO L93 Difference]: Finished difference Result 42214 states and 57542 transitions. [2023-11-22 19:03:23,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 19:03:23,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 120 [2023-11-22 19:03:23,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:23,849 INFO L225 Difference]: With dead ends: 42214 [2023-11-22 19:03:23,849 INFO L226 Difference]: Without dead ends: 21283 [2023-11-22 19:03:23,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-22 19:03:23,881 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 275 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:23,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 119 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:03:23,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21283 states. [2023-11-22 19:03:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21283 to 21283. [2023-11-22 19:03:24,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.2459016393442623) internal successors, (20900), 17895 states have internal predecessors, (20900), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 19:03:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 29080 transitions. [2023-11-22 19:03:24,811 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 29080 transitions. Word has length 120 [2023-11-22 19:03:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:24,811 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 29080 transitions. [2023-11-22 19:03:24,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 19:03:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 29080 transitions. [2023-11-22 19:03:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-22 19:03:24,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:24,830 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:24,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-11-22 19:03:25,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-22 19:03:25,031 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:25,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1385487328, now seen corresponding path program 1 times [2023-11-22 19:03:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:25,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587823864] [2023-11-22 19:03:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:25,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 19:03:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 19:03:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 19:03:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 19:03:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 19:03:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 19:03:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-22 19:03:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 19:03:25,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587823864] [2023-11-22 19:03:25,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587823864] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981765435] [2023-11-22 19:03:25,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:25,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:25,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:25,204 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:25,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-22 19:03:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:25,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:25,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:25,315 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:03:25,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:25,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981765435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:25,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:25,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-22 19:03:25,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334760166] [2023-11-22 19:03:25,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:25,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:03:25,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:25,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:03:25,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:03:25,317 INFO L87 Difference]: Start difference. First operand 21283 states and 29080 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 19:03:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:26,063 INFO L93 Difference]: Finished difference Result 42742 states and 58214 transitions. [2023-11-22 19:03:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:03:26,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 121 [2023-11-22 19:03:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:26,132 INFO L225 Difference]: With dead ends: 42742 [2023-11-22 19:03:26,132 INFO L226 Difference]: Without dead ends: 21811 [2023-11-22 19:03:26,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-22 19:03:26,174 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 10 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:26,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 229 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:03:26,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21811 states. [2023-11-22 19:03:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21811 to 21619. [2023-11-22 19:03:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21619 states, 17111 states have (on average 1.2466834200222079) internal successors, (21332), 18231 states have internal predecessors, (21332), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 19:03:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21619 states to 21619 states and 29512 transitions. [2023-11-22 19:03:27,141 INFO L78 Accepts]: Start accepts. Automaton has 21619 states and 29512 transitions. Word has length 121 [2023-11-22 19:03:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:27,141 INFO L495 AbstractCegarLoop]: Abstraction has 21619 states and 29512 transitions. [2023-11-22 19:03:27,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-22 19:03:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 21619 states and 29512 transitions. [2023-11-22 19:03:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-22 19:03:27,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:27,162 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:27,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-11-22 19:03:27,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-22 19:03:27,366 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:27,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2117454754, now seen corresponding path program 1 times [2023-11-22 19:03:27,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:27,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252215564] [2023-11-22 19:03:27,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:27,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 19:03:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 19:03:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-22 19:03:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-22 19:03:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-22 19:03:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 19:03:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-22 19:03:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-22 19:03:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 19:03:27,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:27,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252215564] [2023-11-22 19:03:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252215564] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400501399] [2023-11-22 19:03:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:27,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:27,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:27,575 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:27,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-22 19:03:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:27,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:27,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:03:27,778 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:27,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400501399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:27,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:27,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-11-22 19:03:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783650440] [2023-11-22 19:03:27,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:27,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:27,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:03:27,782 INFO L87 Difference]: Start difference. First operand 21619 states and 29512 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 19:03:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:28,965 INFO L93 Difference]: Finished difference Result 42886 states and 58310 transitions. [2023-11-22 19:03:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 19:03:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 121 [2023-11-22 19:03:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:29,012 INFO L225 Difference]: With dead ends: 42886 [2023-11-22 19:03:29,013 INFO L226 Difference]: Without dead ends: 21619 [2023-11-22 19:03:29,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:03:29,046 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 282 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:29,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 130 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:03:29,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21619 states. [2023-11-22 19:03:29,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21619 to 21619. [2023-11-22 19:03:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21619 states, 17111 states have (on average 1.2410729939804803) internal successors, (21236), 18231 states have internal predecessors, (21236), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 19:03:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21619 states to 21619 states and 29416 transitions. [2023-11-22 19:03:30,013 INFO L78 Accepts]: Start accepts. Automaton has 21619 states and 29416 transitions. Word has length 121 [2023-11-22 19:03:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:30,013 INFO L495 AbstractCegarLoop]: Abstraction has 21619 states and 29416 transitions. [2023-11-22 19:03:30,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 19:03:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 21619 states and 29416 transitions. [2023-11-22 19:03:30,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-22 19:03:30,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:30,033 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:30,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-11-22 19:03:30,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-22 19:03:30,233 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:30,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:30,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1139138957, now seen corresponding path program 1 times [2023-11-22 19:03:30,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:30,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618300217] [2023-11-22 19:03:30,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:30,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 19:03:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 19:03:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-22 19:03:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-22 19:03:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-22 19:03:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-22 19:03:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-22 19:03:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-22 19:03:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 19:03:30,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:30,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618300217] [2023-11-22 19:03:30,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618300217] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:30,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885026842] [2023-11-22 19:03:30,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:30,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:30,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:30,428 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:30,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-11-22 19:03:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:30,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:30,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:03:30,641 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:30,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885026842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:30,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:30,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-11-22 19:03:30,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655603170] [2023-11-22 19:03:30,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:30,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:30,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:30,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:30,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:03:30,645 INFO L87 Difference]: Start difference. First operand 21619 states and 29416 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 19:03:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:31,540 INFO L93 Difference]: Finished difference Result 42550 states and 57734 transitions. [2023-11-22 19:03:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 19:03:31,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 122 [2023-11-22 19:03:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:31,600 INFO L225 Difference]: With dead ends: 42550 [2023-11-22 19:03:31,600 INFO L226 Difference]: Without dead ends: 21283 [2023-11-22 19:03:31,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:03:31,633 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 198 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:31,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 122 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:03:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21283 states. [2023-11-22 19:03:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21283 to 21283. [2023-11-22 19:03:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21283 states, 16775 states have (on average 1.237317436661699) internal successors, (20756), 17895 states have internal predecessors, (20756), 1839 states have call successors, (1839), 1453 states have call predecessors, (1839), 2668 states have return successors, (6341), 1966 states have call predecessors, (6341), 1839 states have call successors, (6341) [2023-11-22 19:03:32,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21283 states to 21283 states and 28936 transitions. [2023-11-22 19:03:32,639 INFO L78 Accepts]: Start accepts. Automaton has 21283 states and 28936 transitions. Word has length 122 [2023-11-22 19:03:32,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:32,640 INFO L495 AbstractCegarLoop]: Abstraction has 21283 states and 28936 transitions. [2023-11-22 19:03:32,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 19:03:32,640 INFO L276 IsEmpty]: Start isEmpty. Operand 21283 states and 28936 transitions. [2023-11-22 19:03:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-22 19:03:32,657 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:32,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:32,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-11-22 19:03:32,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:32,858 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:32,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1422742400, now seen corresponding path program 1 times [2023-11-22 19:03:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633112363] [2023-11-22 19:03:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 19:03:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 19:03:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:03:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 19:03:32,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 19:03:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 19:03:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-22 19:03:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-22 19:03:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-22 19:03:32,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633112363] [2023-11-22 19:03:32,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633112363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:32,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:03:32,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 19:03:32,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344299503] [2023-11-22 19:03:32,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:32,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 19:03:32,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:32,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 19:03:32,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 19:03:32,991 INFO L87 Difference]: Start difference. First operand 21283 states and 28936 transitions. Second operand has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 19:03:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:34,265 INFO L93 Difference]: Finished difference Result 44054 states and 59690 transitions. [2023-11-22 19:03:34,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 19:03:34,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-11-22 19:03:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:34,336 INFO L225 Difference]: With dead ends: 44054 [2023-11-22 19:03:34,336 INFO L226 Difference]: Without dead ends: 22976 [2023-11-22 19:03:34,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:03:34,364 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 189 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:34,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 201 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 19:03:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22976 states. [2023-11-22 19:03:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22976 to 21456. [2023-11-22 19:03:35,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21456 states, 16962 states have (on average 1.2342294540738121) internal successors, (20935), 18138 states have internal predecessors, (20935), 1769 states have call successors, (1769), 1453 states have call predecessors, (1769), 2724 states have return successors, (6225), 1888 states have call predecessors, (6225), 1769 states have call successors, (6225) [2023-11-22 19:03:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21456 states to 21456 states and 28929 transitions. [2023-11-22 19:03:35,329 INFO L78 Accepts]: Start accepts. Automaton has 21456 states and 28929 transitions. Word has length 123 [2023-11-22 19:03:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:35,330 INFO L495 AbstractCegarLoop]: Abstraction has 21456 states and 28929 transitions. [2023-11-22 19:03:35,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 19:03:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 21456 states and 28929 transitions. [2023-11-22 19:03:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-22 19:03:35,345 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:35,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:35,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-22 19:03:35,345 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:35,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:35,346 INFO L85 PathProgramCache]: Analyzing trace with hash -538832258, now seen corresponding path program 1 times [2023-11-22 19:03:35,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:35,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807610886] [2023-11-22 19:03:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:35,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 19:03:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 19:03:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:03:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 19:03:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 19:03:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 19:03:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-22 19:03:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-22 19:03:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-22 19:03:35,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:35,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807610886] [2023-11-22 19:03:35,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807610886] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:35,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038874318] [2023-11-22 19:03:35,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:35,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:35,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:35,488 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:35,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-11-22 19:03:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:35,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 19:03:35,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-22 19:03:35,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:03:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-22 19:03:35,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038874318] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:03:35,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 19:03:35,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 13 [2023-11-22 19:03:35,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412179185] [2023-11-22 19:03:35,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 19:03:35,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 19:03:35,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:35,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 19:03:35,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:03:35,863 INFO L87 Difference]: Start difference. First operand 21456 states and 28929 transitions. Second operand has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-11-22 19:03:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:39,350 INFO L93 Difference]: Finished difference Result 48244 states and 65468 transitions. [2023-11-22 19:03:39,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-22 19:03:39,350 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 123 [2023-11-22 19:03:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:39,414 INFO L225 Difference]: With dead ends: 48244 [2023-11-22 19:03:39,414 INFO L226 Difference]: Without dead ends: 26957 [2023-11-22 19:03:39,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 295 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1732 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=912, Invalid=4058, Unknown=0, NotChecked=0, Total=4970 [2023-11-22 19:03:39,447 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2555 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2571 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:39,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2571 Valid, 440 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 19:03:39,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26957 states. [2023-11-22 19:03:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26957 to 24657. [2023-11-22 19:03:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24657 states, 19501 states have (on average 1.2094764371057893) internal successors, (23586), 20807 states have internal predecessors, (23586), 2043 states have call successors, (2043), 1695 states have call predecessors, (2043), 3112 states have return successors, (6561), 2178 states have call predecessors, (6561), 2043 states have call successors, (6561) [2023-11-22 19:03:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24657 states to 24657 states and 32190 transitions. [2023-11-22 19:03:40,615 INFO L78 Accepts]: Start accepts. Automaton has 24657 states and 32190 transitions. Word has length 123 [2023-11-22 19:03:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:40,615 INFO L495 AbstractCegarLoop]: Abstraction has 24657 states and 32190 transitions. [2023-11-22 19:03:40,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.23076923076923) internal successors, (185), 10 states have internal predecessors, (185), 5 states have call successors, (26), 8 states have call predecessors, (26), 8 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2023-11-22 19:03:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 24657 states and 32190 transitions. [2023-11-22 19:03:40,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-22 19:03:40,636 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:40,637 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:40,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-11-22 19:03:40,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-22 19:03:40,837 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:40,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash 742131714, now seen corresponding path program 1 times [2023-11-22 19:03:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 19:03:40,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010284451] [2023-11-22 19:03:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:40,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 19:03:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 19:03:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-22 19:03:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-22 19:03:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 19:03:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-22 19:03:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-22 19:03:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 19:03:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 19:03:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-22 19:03:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:40,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-22 19:03:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-22 19:03:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-22 19:03:41,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 19:03:41,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010284451] [2023-11-22 19:03:41,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010284451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 19:03:41,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248773437] [2023-11-22 19:03:41,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:03:41,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:41,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:03:41,008 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 19:03:41,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-11-22 19:03:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:03:41,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:03:41,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 19:03:41,173 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:03:41,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248773437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:03:41,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 19:03:41,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2023-11-22 19:03:41,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138294149] [2023-11-22 19:03:41,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:03:41,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:03:41,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 19:03:41,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:03:41,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:03:41,175 INFO L87 Difference]: Start difference. First operand 24657 states and 32190 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 19:03:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:41,727 INFO L93 Difference]: Finished difference Result 31445 states and 40570 transitions. [2023-11-22 19:03:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 19:03:41,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 123 [2023-11-22 19:03:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:41,728 INFO L225 Difference]: With dead ends: 31445 [2023-11-22 19:03:41,728 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 19:03:41,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:03:41,759 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 184 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:41,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 127 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:03:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 19:03:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 19:03:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:03:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 19:03:41,762 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 123 [2023-11-22 19:03:41,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:41,763 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 19:03:41,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2023-11-22 19:03:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 19:03:41,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 19:03:41,765 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 19:03:41,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-11-22 19:03:41,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 19:03:41,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-22 19:04:13,221 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 383 398) the Hoare annotation is: (or (= ~comp_m1_st~0 |old(~comp_m1_st~0)|) (< ~b1_val_t~0 1) (not (= ~z_val~0 0)) (< ~z_ev~0 2) (< ~d1_val_t~0 1) (< ~b0_val~0 ~b0_val_t~0) (< ~b0_val_t~0 1) (not (= 0 ~z_val_t~0)) (< ~d1_val~0 ~d1_val_t~0) (< ~d0_val_t~0 1) (< 0 ~comp_m1_i~0) (< ~d0_val~0 ~d0_val_t~0) (< ~b1_val~0 ~b1_val_t~0)) [2023-11-22 19:04:13,222 INFO L899 garLoopResultBuilder]: For program point L129(lines 106 131) no Hoare annotation was computed. [2023-11-22 19:04:13,222 INFO L899 garLoopResultBuilder]: For program point L119(lines 119 124) no Hoare annotation was computed. [2023-11-22 19:04:13,222 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 125) no Hoare annotation was computed. [2023-11-22 19:04:13,222 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 126) no Hoare annotation was computed. [2023-11-22 19:04:13,222 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 127) no Hoare annotation was computed. [2023-11-22 19:04:13,222 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 383 398) no Hoare annotation was computed. [2023-11-22 19:04:13,222 INFO L899 garLoopResultBuilder]: For program point L390(lines 390 394) no Hoare annotation was computed. [2023-11-22 19:04:13,222 INFO L899 garLoopResultBuilder]: For program point L390-2(lines 383 398) no Hoare annotation was computed. [2023-11-22 19:04:13,223 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 264 278) no Hoare annotation was computed. [2023-11-22 19:04:13,223 INFO L899 garLoopResultBuilder]: For program point L268(lines 268 273) no Hoare annotation was computed. [2023-11-22 19:04:13,223 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 264 278) the Hoare annotation is: true [2023-11-22 19:04:13,223 INFO L899 garLoopResultBuilder]: For program point L275(lines 267 277) no Hoare annotation was computed. [2023-11-22 19:04:13,223 INFO L899 garLoopResultBuilder]: For program point L341-1(lines 317 349) no Hoare annotation was computed. [2023-11-22 19:04:13,223 INFO L899 garLoopResultBuilder]: For program point L331-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 19:04:13,224 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 317 349) the Hoare annotation is: (let ((.cse1 (< |old(~b1_ev~0)| 2)) (.cse18 (< |old(~b0_ev~0)| 2)) (.cse19 (< |old(~d0_ev~0)| 2)) (.cse17 (< |old(~d1_ev~0)| 2)) (.cse0 (< ~b1_val_t~0 1)) (.cse2 (and (= ~d1_ev~0 |old(~d1_ev~0)|) (= ~b0_ev~0 |old(~b0_ev~0)|) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~z_ev~0)| ~z_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0))) (.cse3 (< 0 |old(~d1_ev~0)|)) (.cse4 (not (= ~z_val~0 0))) (.cse5 (< ~d1_val_t~0 1)) (.cse6 (< ~b0_val~0 ~b0_val_t~0)) (.cse7 (< |old(~z_ev~0)| 2)) (.cse8 (< ~b0_val_t~0 1)) (.cse9 (< 0 |old(~d0_ev~0)|)) (.cse10 (not (= 0 ~z_val_t~0))) (.cse11 (< ~d1_val~0 ~d1_val_t~0)) (.cse12 (< ~d0_val_t~0 1)) (.cse13 (< 0 ~comp_m1_i~0)) (.cse20 (< 0 |old(~b1_ev~0)|)) (.cse14 (< ~d0_val~0 ~d0_val_t~0)) (.cse15 (< 0 |old(~b0_ev~0)|)) (.cse16 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse16) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse19 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse17 .cse18 .cse16) (or .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse18 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse18 .cse16) (or .cse19 .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse17 .cse15 .cse16) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse20 .cse14 .cse15 .cse16))) [2023-11-22 19:04:13,224 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 19:04:13,224 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 317 349) no Hoare annotation was computed. [2023-11-22 19:04:13,224 INFO L899 garLoopResultBuilder]: For program point L336-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 19:04:13,224 INFO L899 garLoopResultBuilder]: For program point L326-1(lines 320 348) no Hoare annotation was computed. [2023-11-22 19:04:13,225 INFO L899 garLoopResultBuilder]: For program point L197(lines 197 202) no Hoare annotation was computed. [2023-11-22 19:04:13,225 INFO L899 garLoopResultBuilder]: For program point L197-2(lines 197 202) no Hoare annotation was computed. [2023-11-22 19:04:13,225 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 19:04:13,225 INFO L899 garLoopResultBuilder]: For program point L152(lines 152 157) no Hoare annotation was computed. [2023-11-22 19:04:13,225 INFO L899 garLoopResultBuilder]: For program point L152-2(lines 152 157) no Hoare annotation was computed. [2023-11-22 19:04:13,225 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 208 250) no Hoare annotation was computed. [2023-11-22 19:04:13,225 INFO L899 garLoopResultBuilder]: For program point L219-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 19:04:13,225 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 187) no Hoare annotation was computed. [2023-11-22 19:04:13,226 INFO L899 garLoopResultBuilder]: For program point L182-2(lines 182 187) no Hoare annotation was computed. [2023-11-22 19:04:13,226 INFO L899 garLoopResultBuilder]: For program point L240-1(lines 208 250) no Hoare annotation was computed. [2023-11-22 19:04:13,226 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 208 250) the Hoare annotation is: (let ((.cse21 (= |old(~d1_val~0)| ~d1_val~0)) (.cse22 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse23 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse24 (= ~b1_val~0 |old(~b1_val~0)|)) (.cse25 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse26 (= ~z_val~0 0)) (.cse27 (= |old(~z_ev~0)| ~z_ev~0)) (.cse28 (= |old(~d0_val~0)| ~d0_val~0)) (.cse29 (= |old(~z_req_up~0)| ~z_req_up~0)) (.cse30 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse18 (< 0 |old(~b1_ev~0)|)) (.cse5 (< 0 |old(~d1_ev~0)|)) (.cse17 (< 0 |old(~d0_ev~0)|)) (.cse16 (< |old(~b0_ev~0)| 2)) (.cse0 (< |old(~d0_ev~0)| 2)) (.cse1 (and .cse21 .cse22 (= ~b0_req_up~0 |old(~b0_req_up~0)|) .cse23 .cse24 (= |old(~d0_req_up~0)| ~d0_req_up~0) .cse25 .cse26 .cse27 .cse28 (= |old(~b1_req_up~0)| ~b1_req_up~0) .cse29 .cse30 (= |old(~b0_val~0)| ~b0_val~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (.cse2 (< ~b1_val_t~0 1)) (.cse3 (< |old(~b1_ev~0)| 2)) (.cse4 (not (= |old(~z_val~0)| 0))) (.cse6 (< |old(~d0_val~0)| ~d0_val_t~0)) (.cse7 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse8 (< ~d1_val_t~0 1)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse10 (< ~b0_val_t~0 1)) (.cse11 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse12 (not (= 0 ~z_val_t~0))) (.cse13 (< ~d0_val_t~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse15 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse19 (< |old(~d1_ev~0)| 2)) (.cse20 (< 0 |old(~b0_ev~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse20) (or .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse19 .cse20) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse20) (or (not (= ~comp_m1_st~0 0)) .cse0 (and (= ~b0_req_up~0 1) .cse21 .cse22 .cse23 (= ~d0_req_up~0 1) .cse24 (= ~b0_val~0 0) .cse25 .cse26 .cse27 .cse28 (= ~d1_req_up~0 1) .cse29 .cse30 (= 1 ~b1_req_up~0)) .cse2 .cse3 (not (= |old(~d0_req_up~0)| 1)) .cse4 .cse8 (< 0 |old(~z_req_up~0)|) (not (= ~b0_val_t~0 1)) (not (= |old(~b0_req_up~0)| 1)) (not (= |old(~d1_req_up~0)| 1)) (not (= |old(~b0_val~0)| 0)) .cse9 (not (= |old(~b1_req_up~0)| 1)) .cse12 .cse13 .cse14 .cse19 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse20) (or .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse18 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse18 .cse19 .cse16) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse20)))) [2023-11-22 19:04:13,227 INFO L899 garLoopResultBuilder]: For program point L137(lines 137 142) no Hoare annotation was computed. [2023-11-22 19:04:13,227 INFO L899 garLoopResultBuilder]: For program point L137-2(lines 137 142) no Hoare annotation was computed. [2023-11-22 19:04:13,227 INFO L899 garLoopResultBuilder]: For program point L212-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 19:04:13,227 INFO L899 garLoopResultBuilder]: For program point L233-1(lines 211 249) no Hoare annotation was computed. [2023-11-22 19:04:13,227 INFO L899 garLoopResultBuilder]: For program point L167(lines 167 172) no Hoare annotation was computed. [2023-11-22 19:04:13,227 INFO L899 garLoopResultBuilder]: For program point L167-2(lines 167 172) no Hoare annotation was computed. [2023-11-22 19:04:13,227 INFO L899 garLoopResultBuilder]: For program point L374-1(lines 350 382) no Hoare annotation was computed. [2023-11-22 19:04:13,227 INFO L899 garLoopResultBuilder]: For program point L364-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 19:04:13,228 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 350 382) the Hoare annotation is: (let ((.cse2 (= ~d1_ev~0 |old(~d1_ev~0)|)) (.cse3 (= ~b0_ev~0 |old(~b0_ev~0)|)) (.cse22 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse4 (= |old(~z_ev~0)| ~z_ev~0)) (.cse5 (= |old(~b1_ev~0)| ~b1_ev~0))) (let ((.cse17 (< |old(~b1_ev~0)| 2)) (.cse0 (not (= ~comp_m1_st~0 0))) (.cse24 (< |old(~b0_ev~0)| 2)) (.cse25 (< |old(~d0_ev~0)| 2)) (.cse23 (< |old(~d1_ev~0)| 2)) (.cse1 (< ~b1_val_t~0 1)) (.cse18 (and .cse2 .cse3 .cse22 .cse4 .cse5)) (.cse19 (< 0 |old(~d1_ev~0)|)) (.cse6 (not (= ~z_val~0 0))) (.cse7 (< ~d1_val_t~0 1)) (.cse8 (< ~b0_val~0 ~b0_val_t~0)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse10 (< ~b0_val_t~0 1)) (.cse20 (< 0 |old(~d0_ev~0)|)) (.cse11 (not (= 0 ~z_val_t~0))) (.cse12 (< ~d1_val~0 ~d1_val_t~0)) (.cse13 (< ~d0_val_t~0 1)) (.cse14 (< 0 ~comp_m1_i~0)) (.cse26 (< 0 |old(~b1_ev~0)|)) (.cse15 (< ~d0_val~0 ~d0_val_t~0)) (.cse21 (< 0 |old(~b0_ev~0)|)) (.cse16 (< ~b1_val~0 ~b1_val_t~0))) (and (or .cse0 (not (= |old(~d0_ev~0)| 1)) .cse1 (and .cse2 .cse3 (= ~d0_ev~0 1) .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16) (or .cse0 .cse1 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= |old(~d1_ev~0)| 1)) (and .cse3 .cse22 .cse4 (= ~d1_ev~0 1) .cse5) .cse16) (or .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse24 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse21 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16) (or .cse0 .cse1 .cse6 .cse7 .cse8 (and .cse2 (= ~b0_ev~0 1) .cse22 .cse4 .cse5) .cse9 .cse10 (not (= |old(~b0_ev~0)| 1)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse21 .cse16) (or .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse21 .cse16) (or .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse15 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse21 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse21 .cse16) (or .cse25 .cse1 .cse17 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse24 .cse16) (or .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16) (or .cse0 (not (= |old(~b1_ev~0)| 1)) .cse1 .cse6 .cse7 .cse8 .cse9 (and .cse2 .cse3 (= ~b1_ev~0 1) .cse22 .cse4) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse24 .cse16) (or .cse25 .cse1 .cse18 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse23 .cse21 .cse16) (or .cse1 .cse18 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse20 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse21 .cse16)))) [2023-11-22 19:04:13,228 INFO L899 garLoopResultBuilder]: For program point L354-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 19:04:13,228 INFO L899 garLoopResultBuilder]: For program point L369-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 19:04:13,229 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 350 382) no Hoare annotation was computed. [2023-11-22 19:04:13,229 INFO L899 garLoopResultBuilder]: For program point L359-1(lines 353 381) no Hoare annotation was computed. [2023-11-22 19:04:13,229 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 19:04:13,229 INFO L899 garLoopResultBuilder]: For program point L440-1(line 440) no Hoare annotation was computed. [2023-11-22 19:04:13,229 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 412) no Hoare annotation was computed. [2023-11-22 19:04:13,229 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-11-22 19:04:13,230 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 51 101) no Hoare annotation was computed. [2023-11-22 19:04:13,230 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-22 19:04:13,230 INFO L895 garLoopResultBuilder]: At program point L432-1(lines 432 454) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 19:04:13,230 INFO L899 garLoopResultBuilder]: For program point L449(lines 449 453) no Hoare annotation was computed. [2023-11-22 19:04:13,230 INFO L899 garLoopResultBuilder]: For program point L61(lines 51 101) no Hoare annotation was computed. [2023-11-22 19:04:13,230 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 418 460) no Hoare annotation was computed. [2023-11-22 19:04:13,231 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-11-22 19:04:13,231 INFO L895 garLoopResultBuilder]: At program point L425(line 425) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= ~comp_m1_st~0 0) (<= 2 ~b1_ev~0) (<= ~z_req_up~0 0) (<= 1 ~d0_val_t~0) (= ~b0_val_t~0 1) (<= 2 ~d1_ev~0) (= ~d0_req_up~0 1) (= ~b0_val~0 0) (<= 2 ~d0_ev~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= 2 ~b0_ev~0) (= ~d1_req_up~0 1) (<= 1 ~d1_val_t~0) (= 1 ~b1_req_up~0)) [2023-11-22 19:04:13,231 INFO L899 garLoopResultBuilder]: For program point L425-1(line 425) no Hoare annotation was computed. [2023-11-22 19:04:13,231 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 66) no Hoare annotation was computed. [2023-11-22 19:04:13,231 INFO L899 garLoopResultBuilder]: For program point L79(lines 51 101) no Hoare annotation was computed. [2023-11-22 19:04:13,231 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-22 19:04:13,232 INFO L895 garLoopResultBuilder]: At program point L286(line 286) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 19:04:13,232 INFO L899 garLoopResultBuilder]: For program point L501(lines 501 507) no Hoare annotation was computed. [2023-11-22 19:04:13,232 INFO L899 garLoopResultBuilder]: For program point L501-2(lines 501 507) no Hoare annotation was computed. [2023-11-22 19:04:13,232 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 84) no Hoare annotation was computed. [2023-11-22 19:04:13,232 INFO L895 garLoopResultBuilder]: At program point L427(line 427) the Hoare annotation is: (let ((.cse3 (<= 2 ~b1_ev~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse11 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse17 (<= ~b1_ev~0 0)) (.cse19 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse6 (<= ~z_req_up~0 0)) (.cse7 (<= 1 ~d0_val_t~0)) (.cse8 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b0_ev~0 0)) (.cse18 (<= 2 ~d1_ev~0)) (.cse10 (<= ~b1_val_t~0 ~b1_val~0)) (.cse12 (<= ~b0_val_t~0 ~b0_val~0)) (.cse13 (<= 1 ~b1_val_t~0)) (.cse14 (= ~z_val~0 0)) (.cse15 (<= ~d1_val_t~0 ~d1_val~0)) (.cse16 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse17 .cse19 .cse4 .cse6 .cse7 .cse8 .cse9 .cse18 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16))) [2023-11-22 19:04:13,232 INFO L895 garLoopResultBuilder]: At program point L427-1(line 427) the Hoare annotation is: (let ((.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse3 (<= ~d0_val_t~0 ~d0_val~0)) (.cse4 (<= ~z_req_up~0 0)) (.cse5 (<= 1 ~d0_val_t~0)) (.cse6 (<= 1 ~b0_val_t~0)) (.cse7 (<= ~b1_val_t~0 ~b1_val~0)) (.cse8 (<= ~b0_val_t~0 ~b0_val~0)) (.cse9 (<= 1 ~b1_val_t~0)) (.cse10 (= ~z_val~0 0)) (.cse11 (<= ~d1_val_t~0 ~d1_val~0)) (.cse12 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 (= ~b0_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~b0_ev~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2023-11-22 19:04:13,233 INFO L895 garLoopResultBuilder]: At program point L295(lines 285 310) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 19:04:13,233 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 279 316) no Hoare annotation was computed. [2023-11-22 19:04:13,233 INFO L895 garLoopResultBuilder]: At program point L444(line 444) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 19:04:13,233 INFO L895 garLoopResultBuilder]: At program point L444-1(line 444) the Hoare annotation is: (and (<= ~comp_m1_i~0 0) (<= 2 ~z_ev~0) (= 0 ~z_val_t~0) (<= ~d0_val_t~0 ~d0_val~0) (<= 1 ~d0_val_t~0) (<= 1 ~b0_val_t~0) (<= ~b1_val_t~0 ~b1_val~0) (<= ~b0_val_t~0 ~b0_val~0) (<= 1 ~b1_val_t~0) (= ~z_val~0 0) (<= ~d1_val_t~0 ~d1_val~0) (<= 1 ~d1_val_t~0)) [2023-11-22 19:04:13,234 INFO L895 garLoopResultBuilder]: At program point L428(line 428) the Hoare annotation is: (let ((.cse3 (= ~comp_m1_st~0 0)) (.cse15 (<= 2 ~b1_ev~0)) (.cse16 (<= ~d1_ev~0 0)) (.cse17 (<= 2 ~d0_ev~0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse18 (<= ~b1_ev~0 0)) (.cse20 (<= ~d0_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~z_req_up~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse8 (<= ~b0_ev~0 0)) (.cse19 (<= 2 ~d1_ev~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= 1 ~b1_val_t~0)) (.cse12 (= ~z_val~0 0)) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse14 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse20 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 (= ~b0_ev~0 1) .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse20 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse4 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse18 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse19 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14))) [2023-11-22 19:04:13,234 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2023-11-22 19:04:13,234 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 51 101) no Hoare annotation was computed. [2023-11-22 19:04:13,234 INFO L899 garLoopResultBuilder]: For program point L288(line 288) no Hoare annotation was computed. [2023-11-22 19:04:13,234 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2023-11-22 19:04:13,234 INFO L899 garLoopResultBuilder]: For program point L255-2(lines 251 263) no Hoare annotation was computed. [2023-11-22 19:04:13,235 INFO L895 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 (= ~comp_m1_st~0 0) .cse4 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 19:04:13,235 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-22 19:04:13,235 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-22 19:04:13,235 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2023-11-22 19:04:13,235 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2023-11-22 19:04:13,235 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 88 96) no Hoare annotation was computed. [2023-11-22 19:04:13,236 INFO L895 garLoopResultBuilder]: At program point L405(line 405) the Hoare annotation is: (let ((.cse8 (<= ~b0_ev~0 0)) (.cse17 (<= 2 ~d1_ev~0)) (.cse3 (<= 2 ~b1_ev~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse0 (<= ~comp_m1_i~0 0)) (.cse1 (<= 2 ~z_ev~0)) (.cse2 (= 0 ~z_val_t~0)) (.cse16 (<= ~b1_ev~0 0)) (.cse4 (<= ~d0_val_t~0 ~d0_val~0)) (.cse5 (<= ~d1_ev~0 0)) (.cse6 (<= 1 ~d0_val_t~0)) (.cse7 (<= 1 ~b0_val_t~0)) (.cse9 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~d0_ev~0)) (.cse11 (<= ~b0_val_t~0 ~b0_val~0)) (.cse12 (<= 1 ~b1_val_t~0)) (.cse13 (= ~z_val~0 0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (<= 2 ~b0_ev~0)) (.cse15 (<= 1 ~d1_val_t~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse6 .cse7 .cse8 .cse17 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15) (and .cse0 .cse1 .cse2 .cse16 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse18 .cse15))) [2023-11-22 19:04:13,236 INFO L899 garLoopResultBuilder]: For program point L405-1(line 405) no Hoare annotation was computed. [2023-11-22 19:04:13,236 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2023-11-22 19:04:13,236 INFO L899 garLoopResultBuilder]: For program point L290-1(lines 285 310) no Hoare annotation was computed. [2023-11-22 19:04:13,236 INFO L899 garLoopResultBuilder]: For program point L414(lines 403 416) no Hoare annotation was computed. [2023-11-22 19:04:13,237 INFO L899 garLoopResultBuilder]: For program point L299(lines 299 306) no Hoare annotation was computed. [2023-11-22 19:04:13,244 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:04:13,246 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 19:04:13,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:04:13 BoogieIcfgContainer [2023-11-22 19:04:13,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 19:04:13,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 19:04:13,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 19:04:13,280 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 19:04:13,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:02:48" (3/4) ... [2023-11-22 19:04:13,282 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-22 19:04:13,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2023-11-22 19:04:13,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-22 19:04:13,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2023-11-22 19:04:13,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2023-11-22 19:04:13,285 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2023-11-22 19:04:13,293 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-22 19:04:13,293 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-22 19:04:13,294 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-22 19:04:13,294 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-22 19:04:13,410 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 19:04:13,411 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-22 19:04:13,411 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 19:04:13,412 INFO L158 Benchmark]: Toolchain (without parser) took 86192.57ms. Allocated memory was 157.3MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 100.8MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2023-11-22 19:04:13,419 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 157.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 19:04:13,419 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.74ms. Allocated memory is still 157.3MB. Free memory was 100.2MB in the beginning and 87.1MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 19:04:13,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.49ms. Allocated memory is still 157.3MB. Free memory was 87.1MB in the beginning and 85.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 19:04:13,420 INFO L158 Benchmark]: Boogie Preprocessor took 37.10ms. Allocated memory is still 157.3MB. Free memory was 85.0MB in the beginning and 82.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 19:04:13,420 INFO L158 Benchmark]: RCFGBuilder took 478.06ms. Allocated memory is still 157.3MB. Free memory was 82.3MB in the beginning and 60.4MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-22 19:04:13,420 INFO L158 Benchmark]: TraceAbstraction took 85223.64ms. Allocated memory was 157.3MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 59.8MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2023-11-22 19:04:13,420 INFO L158 Benchmark]: Witness Printer took 131.90ms. Allocated memory is still 5.1GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-22 19:04:13,421 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 157.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.74ms. Allocated memory is still 157.3MB. Free memory was 100.2MB in the beginning and 87.1MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.49ms. Allocated memory is still 157.3MB. Free memory was 87.1MB in the beginning and 85.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.10ms. Allocated memory is still 157.3MB. Free memory was 85.0MB in the beginning and 82.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.06ms. Allocated memory is still 157.3MB. Free memory was 82.3MB in the beginning and 60.4MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 85223.64ms. Allocated memory was 157.3MB in the beginning and 5.1GB in the end (delta: 4.9GB). Free memory was 59.8MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Witness Printer took 131.90ms. Allocated memory is still 5.1GB. Free memory was 2.5GB in the beginning and 2.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 85.1s, OverallIterations: 33, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.6s, AutomataDifference: 20.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 31.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6524 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6468 mSDsluCounter, 10159 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6294 mSDsCounter, 727 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5383 IncrementalHoareTripleChecker+Invalid, 6110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 727 mSolverCounterUnsat, 3865 mSDtfsCounter, 5383 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4336 GetRequests, 3954 SyntacticMatches, 7 SemanticMatches, 375 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24657occurred in iteration=32, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.0s AutomataMinimizationTime, 33 MinimizatonAttempts, 9982 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 22549 PreInvPairs, 23349 NumberOfFragments, 10750 HoareAnnotationTreeSize, 22549 FomulaSimplifications, 18192 FormulaSimplificationTreeSizeReduction, 8.1s HoareSimplificationTime, 17 FomulaSimplificationsInter, 109867 FormulaSimplificationTreeSizeReductionInter, 22.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 6588 NumberOfCodeBlocks, 6535 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 6751 ConstructedInterpolants, 0 QuantifiedInterpolants, 15421 SizeOfPredicates, 9 NumberOfNonLiveVariables, 14477 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 66 InterpolantComputations, 32 PerfectInterpolantSequences, 2062/2284 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t)) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b0_ev <= 0)) && (2 <= d1_ev)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (2 <= b1_ev)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) || ((((((((((((((((comp_m1_i <= 0) && (2 <= z_ev)) && (0 == z_val_t)) && (b1_ev <= 0)) && (d0_val_t <= d0_val)) && (d1_ev <= 0)) && (1 <= d0_val_t)) && (1 <= b0_val_t)) && (b1_val_t <= b1_val)) && (2 <= d0_ev)) && (b0_val_t <= b0_val)) && (1 <= b1_val_t)) && (z_val == 0)) && (d1_val_t <= d1_val)) && (2 <= b0_ev)) && (1 <= d1_val_t))) RESULT: Ultimate proved your program to be correct! [2023-11-22 19:04:13,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE