./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:22:34,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:22:34,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:22:34,913 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:22:34,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:22:34,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:22:34,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:22:34,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:22:34,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:22:34,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:22:34,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:22:34,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:22:34,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:22:34,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:22:34,946 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:22:34,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:22:34,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:22:34,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:22:34,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:22:34,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:22:34,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:22:34,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:22:34,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:22:34,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:22:34,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:22:34,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:22:34,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:22:34,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:22:34,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:22:34,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:22:34,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:22:34,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:22:34,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:34,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:22:34,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:22:34,956 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:22:34,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:22:34,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:22:34,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:22:34,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:22:34,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:22:34,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:22:34,958 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2024-11-08 10:22:35,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:22:35,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:22:35,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:22:35,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:22:35,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:22:35,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-08 10:22:36,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:22:36,950 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:22:36,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-08 10:22:36,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0195b8f/a0d4cbae45964c2ea3caa64ed1f1b4e5/FLAG4f8830432 [2024-11-08 10:22:36,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db0195b8f/a0d4cbae45964c2ea3caa64ed1f1b4e5 [2024-11-08 10:22:36,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:22:36,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:22:36,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:36,978 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:22:36,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:22:36,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:36" (1/1) ... [2024-11-08 10:22:36,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27dd1476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:36, skipping insertion in model container [2024-11-08 10:22:36,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:36" (1/1) ... [2024-11-08 10:22:37,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:22:37,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-08 10:22:37,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:37,299 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:22:37,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-08 10:22:37,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:37,378 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:22:37,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37 WrapperNode [2024-11-08 10:22:37,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:37,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:37,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:22:37,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:22:37,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,418 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 190 [2024-11-08 10:22:37,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:37,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:22:37,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:22:37,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:22:37,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,446 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:22:37,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:22:37,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:22:37,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:22:37,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:22:37,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (1/1) ... [2024-11-08 10:22:37,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:37,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:37,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:22:37,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:22:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:22:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:22:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-08 10:22:37,594 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-08 10:22:37,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:22:37,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:22:37,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 10:22:37,596 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 10:22:37,731 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:22:37,735 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:22:38,137 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-11-08 10:22:38,137 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:22:38,156 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:22:38,157 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 10:22:38,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:38 BoogieIcfgContainer [2024-11-08 10:22:38,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:22:38,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:22:38,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:22:38,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:22:38,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:22:36" (1/3) ... [2024-11-08 10:22:38,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c74b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:38, skipping insertion in model container [2024-11-08 10:22:38,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:37" (2/3) ... [2024-11-08 10:22:38,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c74b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:38, skipping insertion in model container [2024-11-08 10:22:38,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:38" (3/3) ... [2024-11-08 10:22:38,169 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-11-08 10:22:38,185 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:22:38,186 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:22:38,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:22:38,259 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b846c7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:22:38,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:22:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 84 states have (on average 1.5833333333333333) internal successors, (133), 87 states have internal predecessors, (133), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 10:22:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 10:22:38,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:38,276 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:38,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:38,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 881257019, now seen corresponding path program 1 times [2024-11-08 10:22:38,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:38,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586497019] [2024-11-08 10:22:38,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:38,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:38,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:38,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:38,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:38,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586497019] [2024-11-08 10:22:38,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586497019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:38,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:38,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 10:22:38,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356498927] [2024-11-08 10:22:38,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:39,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 10:22:39,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:39,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 10:22:39,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:39,031 INFO L87 Difference]: Start difference. First operand has 96 states, 84 states have (on average 1.5833333333333333) internal successors, (133), 87 states have internal predecessors, (133), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:39,231 INFO L93 Difference]: Finished difference Result 225 states and 365 transitions. [2024-11-08 10:22:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 10:22:39,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-08 10:22:39,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:39,247 INFO L225 Difference]: With dead ends: 225 [2024-11-08 10:22:39,247 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 10:22:39,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:22:39,254 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 38 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:39,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 748 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 10:22:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2024-11-08 10:22:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 110 states have (on average 1.4727272727272727) internal successors, (162), 113 states have internal predecessors, (162), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-08 10:22:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-11-08 10:22:39,331 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 36 [2024-11-08 10:22:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:39,332 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-11-08 10:22:39,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-11-08 10:22:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 10:22:39,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:39,339 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:39,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 10:22:39,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:39,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash 361185340, now seen corresponding path program 1 times [2024-11-08 10:22:39,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:39,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744286144] [2024-11-08 10:22:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:39,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:39,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:39,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744286144] [2024-11-08 10:22:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744286144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:39,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:39,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489349212] [2024-11-08 10:22:39,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:39,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:39,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:39,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:39,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:39,471 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:39,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:39,499 INFO L93 Difference]: Finished difference Result 212 states and 316 transitions. [2024-11-08 10:22:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:39,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-11-08 10:22:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:39,503 INFO L225 Difference]: With dead ends: 212 [2024-11-08 10:22:39,503 INFO L226 Difference]: Without dead ends: 170 [2024-11-08 10:22:39,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:39,505 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 41 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:39,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 263 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-08 10:22:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-11-08 10:22:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 154 states have (on average 1.4350649350649352) internal successors, (221), 157 states have internal predecessors, (221), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (14), 12 states have call predecessors, (14), 11 states have call successors, (14) [2024-11-08 10:22:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 247 transitions. [2024-11-08 10:22:39,523 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 247 transitions. Word has length 37 [2024-11-08 10:22:39,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:39,524 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 247 transitions. [2024-11-08 10:22:39,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 247 transitions. [2024-11-08 10:22:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 10:22:39,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:39,526 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:39,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:22:39,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:39,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash 501597929, now seen corresponding path program 1 times [2024-11-08 10:22:39,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:39,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759593614] [2024-11-08 10:22:39,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:39,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:39,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:39,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:39,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759593614] [2024-11-08 10:22:39,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759593614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:39,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:39,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:39,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046667805] [2024-11-08 10:22:39,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:39,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:39,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:39,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:39,600 INFO L87 Difference]: Start difference. First operand 170 states and 247 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:39,628 INFO L93 Difference]: Finished difference Result 308 states and 449 transitions. [2024-11-08 10:22:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:39,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-08 10:22:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:39,631 INFO L225 Difference]: With dead ends: 308 [2024-11-08 10:22:39,632 INFO L226 Difference]: Without dead ends: 250 [2024-11-08 10:22:39,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:39,634 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:39,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 265 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:39,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-08 10:22:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 236. [2024-11-08 10:22:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 216 states have (on average 1.4027777777777777) internal successors, (303), 220 states have internal predecessors, (303), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17) [2024-11-08 10:22:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 336 transitions. [2024-11-08 10:22:39,663 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 336 transitions. Word has length 39 [2024-11-08 10:22:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:39,666 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 336 transitions. [2024-11-08 10:22:39,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:39,667 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 336 transitions. [2024-11-08 10:22:39,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 10:22:39,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:39,670 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:39,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:22:39,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:39,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash -361221418, now seen corresponding path program 1 times [2024-11-08 10:22:39,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960608240] [2024-11-08 10:22:39,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960608240] [2024-11-08 10:22:39,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960608240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:39,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:22:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767551592] [2024-11-08 10:22:39,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:39,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:22:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:39,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:22:39,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:39,788 INFO L87 Difference]: Start difference. First operand 236 states and 336 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:39,814 INFO L93 Difference]: Finished difference Result 370 states and 530 transitions. [2024-11-08 10:22:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:22:39,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-08 10:22:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:39,817 INFO L225 Difference]: With dead ends: 370 [2024-11-08 10:22:39,817 INFO L226 Difference]: Without dead ends: 326 [2024-11-08 10:22:39,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:39,820 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 53 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:39,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 494 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-08 10:22:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 300. [2024-11-08 10:22:39,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 274 states have (on average 1.4014598540145986) internal successors, (384), 280 states have internal predecessors, (384), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (23), 21 states have call predecessors, (23), 20 states have call successors, (23) [2024-11-08 10:22:39,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 429 transitions. [2024-11-08 10:22:39,844 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 429 transitions. Word has length 40 [2024-11-08 10:22:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:39,845 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 429 transitions. [2024-11-08 10:22:39,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:39,845 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 429 transitions. [2024-11-08 10:22:39,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 10:22:39,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:39,847 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:39,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 10:22:39,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:39,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1382289772, now seen corresponding path program 1 times [2024-11-08 10:22:39,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:39,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599916228] [2024-11-08 10:22:39,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:39,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:39,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:39,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599916228] [2024-11-08 10:22:39,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599916228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:39,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:39,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:39,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712333778] [2024-11-08 10:22:39,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:39,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:39,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:39,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:39,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:39,918 INFO L87 Difference]: Start difference. First operand 300 states and 429 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:39,935 INFO L93 Difference]: Finished difference Result 309 states and 439 transitions. [2024-11-08 10:22:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:39,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-08 10:22:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:39,938 INFO L225 Difference]: With dead ends: 309 [2024-11-08 10:22:39,939 INFO L226 Difference]: Without dead ends: 302 [2024-11-08 10:22:39,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:39,940 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:39,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-08 10:22:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-11-08 10:22:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 276 states have (on average 1.3985507246376812) internal successors, (386), 282 states have internal predecessors, (386), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (23), 21 states have call predecessors, (23), 20 states have call successors, (23) [2024-11-08 10:22:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 431 transitions. [2024-11-08 10:22:39,963 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 431 transitions. Word has length 40 [2024-11-08 10:22:39,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:39,965 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 431 transitions. [2024-11-08 10:22:39,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 431 transitions. [2024-11-08 10:22:39,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 10:22:39,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:39,967 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:39,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:22:39,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:39,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash -116110102, now seen corresponding path program 1 times [2024-11-08 10:22:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:39,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755486437] [2024-11-08 10:22:39,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:40,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:40,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755486437] [2024-11-08 10:22:40,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755486437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:40,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287625038] [2024-11-08 10:22:40,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:40,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:40,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:40,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:40,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 10:22:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 10:22:40,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:40,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287625038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:40,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:22:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-08 10:22:40,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282042349] [2024-11-08 10:22:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:40,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 10:22:40,346 INFO L87 Difference]: Start difference. First operand 302 states and 431 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:40,437 INFO L93 Difference]: Finished difference Result 525 states and 758 transitions. [2024-11-08 10:22:40,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:22:40,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-08 10:22:40,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:40,443 INFO L225 Difference]: With dead ends: 525 [2024-11-08 10:22:40,444 INFO L226 Difference]: Without dead ends: 444 [2024-11-08 10:22:40,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 10:22:40,446 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 73 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:40,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 805 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-08 10:22:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 443. [2024-11-08 10:22:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 406 states have (on average 1.4064039408866995) internal successors, (571), 414 states have internal predecessors, (571), 32 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (36), 32 states have call predecessors, (36), 30 states have call successors, (36) [2024-11-08 10:22:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 639 transitions. [2024-11-08 10:22:40,471 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 639 transitions. Word has length 40 [2024-11-08 10:22:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:40,472 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 639 transitions. [2024-11-08 10:22:40,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 639 transitions. [2024-11-08 10:22:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 10:22:40,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:40,475 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:40,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 10:22:40,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 10:22:40,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:40,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:40,677 INFO L85 PathProgramCache]: Analyzing trace with hash 472870362, now seen corresponding path program 1 times [2024-11-08 10:22:40,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:40,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885434891] [2024-11-08 10:22:40,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:40,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:40,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885434891] [2024-11-08 10:22:40,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885434891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:40,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:40,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:22:40,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254312290] [2024-11-08 10:22:40,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:40,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:22:40,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:40,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:22:40,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:40,759 INFO L87 Difference]: Start difference. First operand 443 states and 639 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:40,790 INFO L93 Difference]: Finished difference Result 744 states and 1082 transitions. [2024-11-08 10:22:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:22:40,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-11-08 10:22:40,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:40,795 INFO L225 Difference]: With dead ends: 744 [2024-11-08 10:22:40,795 INFO L226 Difference]: Without dead ends: 658 [2024-11-08 10:22:40,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:40,797 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 54 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:40,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 512 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-08 10:22:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 563. [2024-11-08 10:22:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 522 states have (on average 1.396551724137931) internal successors, (729), 528 states have internal predecessors, (729), 36 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (40), 36 states have call predecessors, (40), 34 states have call successors, (40) [2024-11-08 10:22:40,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 805 transitions. [2024-11-08 10:22:40,821 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 805 transitions. Word has length 41 [2024-11-08 10:22:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:40,821 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 805 transitions. [2024-11-08 10:22:40,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:40,821 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 805 transitions. [2024-11-08 10:22:40,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 10:22:40,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:40,824 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:40,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:22:40,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:40,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2023784718, now seen corresponding path program 1 times [2024-11-08 10:22:40,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:40,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217330864] [2024-11-08 10:22:40,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:40,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:40,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217330864] [2024-11-08 10:22:40,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217330864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:40,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:40,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:22:40,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219194789] [2024-11-08 10:22:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:40,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:22:40,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:40,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:22:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:40,884 INFO L87 Difference]: Start difference. First operand 563 states and 805 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:40,906 INFO L93 Difference]: Finished difference Result 576 states and 820 transitions. [2024-11-08 10:22:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:22:40,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-08 10:22:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:40,910 INFO L225 Difference]: With dead ends: 576 [2024-11-08 10:22:40,910 INFO L226 Difference]: Without dead ends: 569 [2024-11-08 10:22:40,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:40,911 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 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 [2024-11-08 10:22:40,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-11-08 10:22:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2024-11-08 10:22:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 525 states have (on average 1.3942857142857144) internal successors, (732), 531 states have internal predecessors, (732), 36 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (40), 36 states have call predecessors, (40), 34 states have call successors, (40) [2024-11-08 10:22:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 808 transitions. [2024-11-08 10:22:40,927 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 808 transitions. Word has length 42 [2024-11-08 10:22:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:40,928 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 808 transitions. [2024-11-08 10:22:40,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 808 transitions. [2024-11-08 10:22:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 10:22:40,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:40,930 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:40,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:22:40,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:40,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash -496175216, now seen corresponding path program 1 times [2024-11-08 10:22:40,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:40,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044119708] [2024-11-08 10:22:40,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:40,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:40,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:40,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044119708] [2024-11-08 10:22:40,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044119708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:40,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:41,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 10:22:41,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266500797] [2024-11-08 10:22:41,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:41,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:22:41,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:22:41,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:22:41,001 INFO L87 Difference]: Start difference. First operand 566 states and 808 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:41,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:41,052 INFO L93 Difference]: Finished difference Result 573 states and 814 transitions. [2024-11-08 10:22:41,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:22:41,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2024-11-08 10:22:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:41,055 INFO L225 Difference]: With dead ends: 573 [2024-11-08 10:22:41,056 INFO L226 Difference]: Without dead ends: 566 [2024-11-08 10:22:41,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:41,058 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 3 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:41,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 527 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-08 10:22:41,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 560. [2024-11-08 10:22:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 519 states have (on average 1.3911368015414258) internal successors, (722), 525 states have internal predecessors, (722), 36 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (40), 36 states have call predecessors, (40), 34 states have call successors, (40) [2024-11-08 10:22:41,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 798 transitions. [2024-11-08 10:22:41,078 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 798 transitions. Word has length 42 [2024-11-08 10:22:41,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:41,079 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 798 transitions. [2024-11-08 10:22:41,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 798 transitions. [2024-11-08 10:22:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 10:22:41,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:41,080 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:41,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 10:22:41,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:41,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:41,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1034121732, now seen corresponding path program 1 times [2024-11-08 10:22:41,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:41,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978053219] [2024-11-08 10:22:41,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:41,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:41,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:41,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:41,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:41,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:41,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978053219] [2024-11-08 10:22:41,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978053219] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:41,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600331084] [2024-11-08 10:22:41,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:41,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:41,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:41,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:41,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 10:22:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:41,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 10:22:41,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:41,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:41,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600331084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:41,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:41,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-11-08 10:22:41,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794884555] [2024-11-08 10:22:41,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:41,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 10:22:41,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:41,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 10:22:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:22:41,528 INFO L87 Difference]: Start difference. First operand 560 states and 798 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 10:22:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:41,645 INFO L93 Difference]: Finished difference Result 957 states and 1362 transitions. [2024-11-08 10:22:41,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:22:41,646 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 42 [2024-11-08 10:22:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:41,649 INFO L225 Difference]: With dead ends: 957 [2024-11-08 10:22:41,649 INFO L226 Difference]: Without dead ends: 611 [2024-11-08 10:22:41,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:22:41,651 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 14 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:41,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1142 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-08 10:22:41,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2024-11-08 10:22:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 545 states have (on average 1.3761467889908257) internal successors, (750), 545 states have internal predecessors, (750), 39 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (49), 45 states have call predecessors, (49), 37 states have call successors, (49) [2024-11-08 10:22:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 838 transitions. [2024-11-08 10:22:41,668 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 838 transitions. Word has length 42 [2024-11-08 10:22:41,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:41,668 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 838 transitions. [2024-11-08 10:22:41,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 9 states have internal predecessors, (41), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 10:22:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 838 transitions. [2024-11-08 10:22:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 10:22:41,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:41,670 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:41,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 10:22:41,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 10:22:41,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:41,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash 373273288, now seen corresponding path program 1 times [2024-11-08 10:22:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:41,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312781915] [2024-11-08 10:22:41,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:41,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:42,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:42,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:42,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:42,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312781915] [2024-11-08 10:22:42,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312781915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:42,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145677638] [2024-11-08 10:22:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:42,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:42,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:42,096 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:42,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 10:22:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:42,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 10:22:42,158 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:42,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:42,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145677638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:42,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:22:42,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-11-08 10:22:42,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842924419] [2024-11-08 10:22:42,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:42,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:22:42,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:42,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:22:42,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:22:42,250 INFO L87 Difference]: Start difference. First operand 589 states and 838 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:42,402 INFO L93 Difference]: Finished difference Result 777 states and 1108 transitions. [2024-11-08 10:22:42,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:22:42,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-08 10:22:42,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:42,405 INFO L225 Difference]: With dead ends: 777 [2024-11-08 10:22:42,406 INFO L226 Difference]: Without dead ends: 629 [2024-11-08 10:22:42,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-08 10:22:42,407 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 81 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:42,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 990 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-08 10:22:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 619. [2024-11-08 10:22:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 575 states have (on average 1.3652173913043477) internal successors, (785), 575 states have internal predecessors, (785), 39 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (49), 45 states have call predecessors, (49), 37 states have call successors, (49) [2024-11-08 10:22:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 873 transitions. [2024-11-08 10:22:42,428 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 873 transitions. Word has length 44 [2024-11-08 10:22:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:42,428 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 873 transitions. [2024-11-08 10:22:42,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 873 transitions. [2024-11-08 10:22:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 10:22:42,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:42,431 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:42,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 10:22:42,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:42,635 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:42,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 766300298, now seen corresponding path program 1 times [2024-11-08 10:22:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:42,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497143358] [2024-11-08 10:22:42,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:42,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:42,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:42,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:42,781 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:42,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:42,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497143358] [2024-11-08 10:22:42,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497143358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:42,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367954434] [2024-11-08 10:22:42,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:42,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:42,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:42,784 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:22:42,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 10:22:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:42,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 10:22:42,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:42,872 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:43,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367954434] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:43,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:43,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-08 10:22:43,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740456600] [2024-11-08 10:22:43,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:43,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 10:22:43,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:43,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 10:22:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:22:43,020 INFO L87 Difference]: Start difference. First operand 619 states and 873 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:22:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:43,215 INFO L93 Difference]: Finished difference Result 1247 states and 1762 transitions. [2024-11-08 10:22:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 10:22:43,216 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 44 [2024-11-08 10:22:43,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:43,219 INFO L225 Difference]: With dead ends: 1247 [2024-11-08 10:22:43,220 INFO L226 Difference]: Without dead ends: 761 [2024-11-08 10:22:43,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:22:43,221 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 29 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:43,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1287 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-08 10:22:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 753. [2024-11-08 10:22:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 704 states have (on average 1.3409090909090908) internal successors, (944), 703 states have internal predecessors, (944), 44 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (56), 53 states have call predecessors, (56), 42 states have call successors, (56) [2024-11-08 10:22:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1044 transitions. [2024-11-08 10:22:43,246 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1044 transitions. Word has length 44 [2024-11-08 10:22:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:43,246 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1044 transitions. [2024-11-08 10:22:43,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:22:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1044 transitions. [2024-11-08 10:22:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 10:22:43,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:43,249 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:43,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 10:22:43,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:43,454 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:43,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash 699252211, now seen corresponding path program 1 times [2024-11-08 10:22:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:43,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870035052] [2024-11-08 10:22:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:43,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:43,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:43,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:43,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:43,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870035052] [2024-11-08 10:22:43,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870035052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:43,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:43,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:22:43,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411606940] [2024-11-08 10:22:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:43,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:22:43,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:43,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:22:43,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:43,527 INFO L87 Difference]: Start difference. First operand 753 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:43,549 INFO L93 Difference]: Finished difference Result 798 states and 1103 transitions. [2024-11-08 10:22:43,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:22:43,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-08 10:22:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:43,553 INFO L225 Difference]: With dead ends: 798 [2024-11-08 10:22:43,553 INFO L226 Difference]: Without dead ends: 707 [2024-11-08 10:22:43,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:43,554 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 39 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:43,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 433 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-08 10:22:43,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 567. [2024-11-08 10:22:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 532 states have (on average 1.3101503759398496) internal successors, (697), 527 states have internal predecessors, (697), 30 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (42), 39 states have call predecessors, (42), 28 states have call successors, (42) [2024-11-08 10:22:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 769 transitions. [2024-11-08 10:22:43,569 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 769 transitions. Word has length 47 [2024-11-08 10:22:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:43,570 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 769 transitions. [2024-11-08 10:22:43,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 769 transitions. [2024-11-08 10:22:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 10:22:43,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:43,571 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:43,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 10:22:43,572 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:43,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash 448174805, now seen corresponding path program 1 times [2024-11-08 10:22:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596366478] [2024-11-08 10:22:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:43,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:43,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:43,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:43,765 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:43,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596366478] [2024-11-08 10:22:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596366478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174565483] [2024-11-08 10:22:43,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:43,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:43,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:43,768 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) [2024-11-08 10:22:43,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 10:22:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:43,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 10:22:43,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:43,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:43,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174565483] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:43,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:22:43,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 11] total 15 [2024-11-08 10:22:43,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800545452] [2024-11-08 10:22:43,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:43,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:44,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:44,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 10:22:44,000 INFO L87 Difference]: Start difference. First operand 567 states and 769 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:44,149 INFO L93 Difference]: Finished difference Result 903 states and 1234 transitions. [2024-11-08 10:22:44,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:22:44,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-08 10:22:44,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:44,173 INFO L225 Difference]: With dead ends: 903 [2024-11-08 10:22:44,174 INFO L226 Difference]: Without dead ends: 863 [2024-11-08 10:22:44,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-08 10:22:44,175 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 47 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:44,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 562 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:44,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-08 10:22:44,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 737. [2024-11-08 10:22:44,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 690 states have (on average 1.291304347826087) internal successors, (891), 687 states have internal predecessors, (891), 42 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (54), 51 states have call predecessors, (54), 40 states have call successors, (54) [2024-11-08 10:22:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 987 transitions. [2024-11-08 10:22:44,199 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 987 transitions. Word has length 48 [2024-11-08 10:22:44,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:44,199 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 987 transitions. [2024-11-08 10:22:44,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:44,200 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 987 transitions. [2024-11-08 10:22:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 10:22:44,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:44,201 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:44,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 10:22:44,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 10:22:44,406 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:44,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:44,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1149239383, now seen corresponding path program 1 times [2024-11-08 10:22:44,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:44,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369761249] [2024-11-08 10:22:44,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:44,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:44,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:44,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:44,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:44,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:44,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:44,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369761249] [2024-11-08 10:22:44,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369761249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:44,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:44,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:22:44,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723528676] [2024-11-08 10:22:44,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:44,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:22:44,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:44,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:22:44,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:44,449 INFO L87 Difference]: Start difference. First operand 737 states and 987 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:44,468 INFO L93 Difference]: Finished difference Result 756 states and 1008 transitions. [2024-11-08 10:22:44,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:22:44,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-08 10:22:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:44,471 INFO L225 Difference]: With dead ends: 756 [2024-11-08 10:22:44,471 INFO L226 Difference]: Without dead ends: 690 [2024-11-08 10:22:44,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:44,472 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:44,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:44,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-08 10:22:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2024-11-08 10:22:44,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 643 states have (on average 1.2986003110419906) internal successors, (835), 642 states have internal predecessors, (835), 42 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (52), 49 states have call predecessors, (52), 40 states have call successors, (52) [2024-11-08 10:22:44,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 929 transitions. [2024-11-08 10:22:44,493 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 929 transitions. Word has length 48 [2024-11-08 10:22:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:44,493 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 929 transitions. [2024-11-08 10:22:44,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 929 transitions. [2024-11-08 10:22:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 10:22:44,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:44,495 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:44,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 10:22:44,495 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:44,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1292475715, now seen corresponding path program 1 times [2024-11-08 10:22:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:44,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405206407] [2024-11-08 10:22:44,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:44,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:44,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:44,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:44,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:22:44,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:44,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405206407] [2024-11-08 10:22:44,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405206407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:44,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983326458] [2024-11-08 10:22:44,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:44,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:44,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:44,633 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) [2024-11-08 10:22:44,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 10:22:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:44,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 10:22:44,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:22:44,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983326458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:44,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:22:44,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 10 [2024-11-08 10:22:44,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138103688] [2024-11-08 10:22:44,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:44,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 10:22:44,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:44,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 10:22:44,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-08 10:22:44,771 INFO L87 Difference]: Start difference. First operand 690 states and 929 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:22:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:44,974 INFO L93 Difference]: Finished difference Result 1378 states and 1866 transitions. [2024-11-08 10:22:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 10:22:44,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2024-11-08 10:22:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:44,979 INFO L225 Difference]: With dead ends: 1378 [2024-11-08 10:22:44,979 INFO L226 Difference]: Without dead ends: 1086 [2024-11-08 10:22:44,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:22:44,981 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 164 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:44,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1079 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2024-11-08 10:22:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 901. [2024-11-08 10:22:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 840 states have (on average 1.3142857142857143) internal successors, (1104), 835 states have internal predecessors, (1104), 56 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (70), 67 states have call predecessors, (70), 54 states have call successors, (70) [2024-11-08 10:22:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1230 transitions. [2024-11-08 10:22:45,008 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1230 transitions. Word has length 48 [2024-11-08 10:22:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:45,008 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 1230 transitions. [2024-11-08 10:22:45,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:22:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1230 transitions. [2024-11-08 10:22:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 10:22:45,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:45,010 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:45,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 10:22:45,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 10:22:45,215 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:45,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:45,215 INFO L85 PathProgramCache]: Analyzing trace with hash -489154550, now seen corresponding path program 1 times [2024-11-08 10:22:45,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:45,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867403309] [2024-11-08 10:22:45,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:45,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:45,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:45,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:22:45,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:45,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867403309] [2024-11-08 10:22:45,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867403309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:45,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750971043] [2024-11-08 10:22:45,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:45,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:45,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:45,687 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) [2024-11-08 10:22:45,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:22:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:45,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 10:22:45,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:45,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:45,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:45,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750971043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:45,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:22:45,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 24 [2024-11-08 10:22:45,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596504491] [2024-11-08 10:22:45,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:45,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 10:22:45,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:45,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 10:22:45,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2024-11-08 10:22:45,997 INFO L87 Difference]: Start difference. First operand 901 states and 1230 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:46,235 INFO L93 Difference]: Finished difference Result 1041 states and 1416 transitions. [2024-11-08 10:22:46,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 10:22:46,236 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-08 10:22:46,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:46,240 INFO L225 Difference]: With dead ends: 1041 [2024-11-08 10:22:46,240 INFO L226 Difference]: Without dead ends: 1004 [2024-11-08 10:22:46,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2024-11-08 10:22:46,241 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 137 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:46,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1137 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2024-11-08 10:22:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 933. [2024-11-08 10:22:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 868 states have (on average 1.304147465437788) internal successors, (1132), 865 states have internal predecessors, (1132), 60 states have call successors, (60), 2 states have call predecessors, (60), 4 states have return successors, (73), 70 states have call predecessors, (73), 57 states have call successors, (73) [2024-11-08 10:22:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1265 transitions. [2024-11-08 10:22:46,286 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1265 transitions. Word has length 50 [2024-11-08 10:22:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:46,287 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1265 transitions. [2024-11-08 10:22:46,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1265 transitions. [2024-11-08 10:22:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 10:22:46,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:46,289 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:46,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 10:22:46,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:46,493 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:46,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:46,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1511722484, now seen corresponding path program 1 times [2024-11-08 10:22:46,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:46,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633209559] [2024-11-08 10:22:46,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:46,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:46,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:46,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:46,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:46,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633209559] [2024-11-08 10:22:46,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633209559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:46,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:46,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 10:22:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296676010] [2024-11-08 10:22:46,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:46,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:22:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:22:46,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:22:46,564 INFO L87 Difference]: Start difference. First operand 933 states and 1265 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:46,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:46,680 INFO L93 Difference]: Finished difference Result 1088 states and 1464 transitions. [2024-11-08 10:22:46,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 10:22:46,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-08 10:22:46,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:46,685 INFO L225 Difference]: With dead ends: 1088 [2024-11-08 10:22:46,685 INFO L226 Difference]: Without dead ends: 1052 [2024-11-08 10:22:46,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:46,686 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 47 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:46,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 561 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-08 10:22:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1005. [2024-11-08 10:22:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 934 states have (on average 1.3115631691648821) internal successors, (1225), 933 states have internal predecessors, (1225), 66 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (79), 75 states have call predecessors, (79), 63 states have call successors, (79) [2024-11-08 10:22:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1370 transitions. [2024-11-08 10:22:46,714 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1370 transitions. Word has length 50 [2024-11-08 10:22:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:46,714 INFO L471 AbstractCegarLoop]: Abstraction has 1005 states and 1370 transitions. [2024-11-08 10:22:46,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1370 transitions. [2024-11-08 10:22:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 10:22:46,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:46,716 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:46,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 10:22:46,716 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:46,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:46,717 INFO L85 PathProgramCache]: Analyzing trace with hash -660224712, now seen corresponding path program 1 times [2024-11-08 10:22:46,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:46,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289856877] [2024-11-08 10:22:46,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:46,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:46,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:46,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:22:46,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:46,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289856877] [2024-11-08 10:22:46,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289856877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:46,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731751491] [2024-11-08 10:22:46,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:46,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:46,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:46,877 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) [2024-11-08 10:22:46,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 10:22:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:46,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-08 10:22:46,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:22:47,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:47,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731751491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:47,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:22:47,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2024-11-08 10:22:47,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833611972] [2024-11-08 10:22:47,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:47,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 10:22:47,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:47,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 10:22:47,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-08 10:22:47,144 INFO L87 Difference]: Start difference. First operand 1005 states and 1370 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:22:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:47,492 INFO L93 Difference]: Finished difference Result 1134 states and 1524 transitions. [2024-11-08 10:22:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 10:22:47,494 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-08 10:22:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:47,499 INFO L225 Difference]: With dead ends: 1134 [2024-11-08 10:22:47,499 INFO L226 Difference]: Without dead ends: 1132 [2024-11-08 10:22:47,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:22:47,500 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 176 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:47,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 1633 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:22:47,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-11-08 10:22:47,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1009. [2024-11-08 10:22:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 937 states have (on average 1.310565635005336) internal successors, (1228), 936 states have internal predecessors, (1228), 66 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (79), 75 states have call predecessors, (79), 63 states have call successors, (79) [2024-11-08 10:22:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1373 transitions. [2024-11-08 10:22:47,539 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1373 transitions. Word has length 50 [2024-11-08 10:22:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:47,540 INFO L471 AbstractCegarLoop]: Abstraction has 1009 states and 1373 transitions. [2024-11-08 10:22:47,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:22:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1373 transitions. [2024-11-08 10:22:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 10:22:47,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:47,542 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:47,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 10:22:47,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:47,744 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:47,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1817684770, now seen corresponding path program 1 times [2024-11-08 10:22:47,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:47,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403314847] [2024-11-08 10:22:47,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:47,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:47,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:47,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:47,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 10:22:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:47,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:47,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403314847] [2024-11-08 10:22:47,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403314847] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:47,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664347291] [2024-11-08 10:22:47,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:47,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:47,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:47,785 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) [2024-11-08 10:22:47,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 10:22:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:47,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:22:47,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 10:22:47,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:47,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664347291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:47,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:22:47,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-08 10:22:47,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378708519] [2024-11-08 10:22:47,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:47,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:47,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:47,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:47,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:47,865 INFO L87 Difference]: Start difference. First operand 1009 states and 1373 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:22:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:47,916 INFO L93 Difference]: Finished difference Result 2012 states and 2741 transitions. [2024-11-08 10:22:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:47,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-08 10:22:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:47,921 INFO L225 Difference]: With dead ends: 2012 [2024-11-08 10:22:47,921 INFO L226 Difference]: Without dead ends: 1014 [2024-11-08 10:22:47,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:47,924 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 6 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:47,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-08 10:22:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1012. [2024-11-08 10:22:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 940 states have (on average 1.3106382978723403) internal successors, (1232), 939 states have internal predecessors, (1232), 66 states have call successors, (66), 3 states have call predecessors, (66), 5 states have return successors, (79), 75 states have call predecessors, (79), 63 states have call successors, (79) [2024-11-08 10:22:47,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1377 transitions. [2024-11-08 10:22:47,965 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1377 transitions. Word has length 51 [2024-11-08 10:22:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:47,966 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1377 transitions. [2024-11-08 10:22:47,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:22:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1377 transitions. [2024-11-08 10:22:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 10:22:47,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:47,968 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:47,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 10:22:48,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:48,169 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:48,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1867068998, now seen corresponding path program 1 times [2024-11-08 10:22:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:48,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754212148] [2024-11-08 10:22:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:48,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:48,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:48,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754212148] [2024-11-08 10:22:48,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754212148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:48,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:48,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:22:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012945970] [2024-11-08 10:22:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:48,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:22:48,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:48,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:22:48,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:48,213 INFO L87 Difference]: Start difference. First operand 1012 states and 1377 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:48,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:48,236 INFO L93 Difference]: Finished difference Result 1021 states and 1385 transitions. [2024-11-08 10:22:48,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:22:48,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-08 10:22:48,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:48,240 INFO L225 Difference]: With dead ends: 1021 [2024-11-08 10:22:48,240 INFO L226 Difference]: Without dead ends: 975 [2024-11-08 10:22:48,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:22:48,241 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:48,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 390 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-08 10:22:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 954. [2024-11-08 10:22:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 886 states have (on average 1.3103837471783295) internal successors, (1161), 885 states have internal predecessors, (1161), 62 states have call successors, (62), 3 states have call predecessors, (62), 5 states have return successors, (73), 69 states have call predecessors, (73), 59 states have call successors, (73) [2024-11-08 10:22:48,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1296 transitions. [2024-11-08 10:22:48,268 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1296 transitions. Word has length 52 [2024-11-08 10:22:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:48,268 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1296 transitions. [2024-11-08 10:22:48,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1296 transitions. [2024-11-08 10:22:48,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 10:22:48,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:48,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:48,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 10:22:48,270 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:48,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash 506633684, now seen corresponding path program 1 times [2024-11-08 10:22:48,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:48,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065300169] [2024-11-08 10:22:48,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:48,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 10:22:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:22:48,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:48,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065300169] [2024-11-08 10:22:48,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065300169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:48,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237068006] [2024-11-08 10:22:48,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:48,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:48,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:48,312 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) [2024-11-08 10:22:48,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 10:22:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:22:48,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 10:22:48,383 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:48,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237068006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:48,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:22:48,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-08 10:22:48,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112019032] [2024-11-08 10:22:48,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:48,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:48,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:48,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:48,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:48,385 INFO L87 Difference]: Start difference. First operand 954 states and 1296 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:22:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:48,450 INFO L93 Difference]: Finished difference Result 1905 states and 2595 transitions. [2024-11-08 10:22:48,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:48,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2024-11-08 10:22:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:48,454 INFO L225 Difference]: With dead ends: 1905 [2024-11-08 10:22:48,454 INFO L226 Difference]: Without dead ends: 960 [2024-11-08 10:22:48,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:48,458 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 5 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:48,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 244 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:48,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-08 10:22:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 956. [2024-11-08 10:22:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 888 states have (on average 1.3096846846846846) internal successors, (1163), 887 states have internal predecessors, (1163), 62 states have call successors, (62), 3 states have call predecessors, (62), 5 states have return successors, (73), 69 states have call predecessors, (73), 59 states have call successors, (73) [2024-11-08 10:22:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1298 transitions. [2024-11-08 10:22:48,485 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1298 transitions. Word has length 52 [2024-11-08 10:22:48,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:48,486 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1298 transitions. [2024-11-08 10:22:48,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:22:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1298 transitions. [2024-11-08 10:22:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 10:22:48,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:48,488 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:48,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 10:22:48,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-08 10:22:48,689 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:48,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:48,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1448267630, now seen corresponding path program 1 times [2024-11-08 10:22:48,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:48,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731735814] [2024-11-08 10:22:48,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:48,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:48,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731735814] [2024-11-08 10:22:48,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731735814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:48,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:48,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 10:22:48,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167762158] [2024-11-08 10:22:48,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:48,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 10:22:48,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:48,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 10:22:48,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:48,848 INFO L87 Difference]: Start difference. First operand 956 states and 1298 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:49,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:49,057 INFO L93 Difference]: Finished difference Result 1307 states and 1791 transitions. [2024-11-08 10:22:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:22:49,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-08 10:22:49,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:49,063 INFO L225 Difference]: With dead ends: 1307 [2024-11-08 10:22:49,063 INFO L226 Difference]: Without dead ends: 1250 [2024-11-08 10:22:49,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:22:49,064 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 56 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:49,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 642 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-08 10:22:49,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 990. [2024-11-08 10:22:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 917 states have (on average 1.321701199563795) internal successors, (1212), 918 states have internal predecessors, (1212), 67 states have call successors, (67), 3 states have call predecessors, (67), 5 states have return successors, (74), 72 states have call predecessors, (74), 64 states have call successors, (74) [2024-11-08 10:22:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1353 transitions. [2024-11-08 10:22:49,102 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1353 transitions. Word has length 52 [2024-11-08 10:22:49,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:49,102 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1353 transitions. [2024-11-08 10:22:49,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1353 transitions. [2024-11-08 10:22:49,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 10:22:49,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:49,104 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:49,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 10:22:49,104 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:49,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash 74689151, now seen corresponding path program 1 times [2024-11-08 10:22:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:49,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694088308] [2024-11-08 10:22:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:49,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:49,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:49,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:49,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 10:22:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:22:49,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:49,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694088308] [2024-11-08 10:22:49,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694088308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:49,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:49,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 10:22:49,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860372620] [2024-11-08 10:22:49,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:49,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 10:22:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:49,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 10:22:49,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:22:49,454 INFO L87 Difference]: Start difference. First operand 990 states and 1353 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:49,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:49,695 INFO L93 Difference]: Finished difference Result 1082 states and 1476 transitions. [2024-11-08 10:22:49,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 10:22:49,696 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-08 10:22:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:49,700 INFO L225 Difference]: With dead ends: 1082 [2024-11-08 10:22:49,700 INFO L226 Difference]: Without dead ends: 1080 [2024-11-08 10:22:49,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:22:49,701 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 121 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:49,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1644 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-11-08 10:22:49,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 994. [2024-11-08 10:22:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 920 states have (on average 1.3206521739130435) internal successors, (1215), 921 states have internal predecessors, (1215), 67 states have call successors, (67), 4 states have call predecessors, (67), 6 states have return successors, (74), 72 states have call predecessors, (74), 64 states have call successors, (74) [2024-11-08 10:22:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1356 transitions. [2024-11-08 10:22:49,732 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1356 transitions. Word has length 53 [2024-11-08 10:22:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:49,732 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1356 transitions. [2024-11-08 10:22:49,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:49,732 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1356 transitions. [2024-11-08 10:22:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 10:22:49,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:49,734 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:49,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 10:22:49,734 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:49,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:49,735 INFO L85 PathProgramCache]: Analyzing trace with hash -714903607, now seen corresponding path program 1 times [2024-11-08 10:22:49,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:49,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432379941] [2024-11-08 10:22:49,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:49,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:49,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:49,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:49,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:22:49,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:49,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432379941] [2024-11-08 10:22:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432379941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:49,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174185356] [2024-11-08 10:22:49,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:49,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:49,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:49,908 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) [2024-11-08 10:22:49,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 10:22:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:49,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 10:22:49,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:22:50,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:50,139 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:22:50,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174185356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:50,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:50,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-08 10:22:50,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408095584] [2024-11-08 10:22:50,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:50,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 10:22:50,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:50,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 10:22:50,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:22:50,141 INFO L87 Difference]: Start difference. First operand 994 states and 1356 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:22:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:50,374 INFO L93 Difference]: Finished difference Result 1436 states and 1963 transitions. [2024-11-08 10:22:50,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 10:22:50,374 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2024-11-08 10:22:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:50,379 INFO L225 Difference]: With dead ends: 1436 [2024-11-08 10:22:50,379 INFO L226 Difference]: Without dead ends: 1114 [2024-11-08 10:22:50,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:22:50,380 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 137 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:50,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1260 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2024-11-08 10:22:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 950. [2024-11-08 10:22:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 879 states have (on average 1.3060295790671217) internal successors, (1148), 880 states have internal predecessors, (1148), 64 states have call successors, (64), 4 states have call predecessors, (64), 6 states have return successors, (71), 69 states have call predecessors, (71), 61 states have call successors, (71) [2024-11-08 10:22:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1283 transitions. [2024-11-08 10:22:50,417 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1283 transitions. Word has length 53 [2024-11-08 10:22:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:50,418 INFO L471 AbstractCegarLoop]: Abstraction has 950 states and 1283 transitions. [2024-11-08 10:22:50,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 12 states have internal predecessors, (54), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:22:50,418 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1283 transitions. [2024-11-08 10:22:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 10:22:50,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:50,420 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:50,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 10:22:50,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-08 10:22:50,621 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:50,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:50,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1875153810, now seen corresponding path program 1 times [2024-11-08 10:22:50,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:50,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650777139] [2024-11-08 10:22:50,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:50,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:50,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:50,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:22:50,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650777139] [2024-11-08 10:22:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650777139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590152313] [2024-11-08 10:22:50,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:50,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:50,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:50,804 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) [2024-11-08 10:22:50,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 10:22:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:50,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 10:22:50,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:22:50,958 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:51,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:22:51,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590152313] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:51,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:22:51,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 10] total 19 [2024-11-08 10:22:51,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415357767] [2024-11-08 10:22:51,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:51,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:51,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:51,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:51,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:22:51,061 INFO L87 Difference]: Start difference. First operand 950 states and 1283 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:51,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:51,220 INFO L93 Difference]: Finished difference Result 1056 states and 1408 transitions. [2024-11-08 10:22:51,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:22:51,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-11-08 10:22:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:51,224 INFO L225 Difference]: With dead ends: 1056 [2024-11-08 10:22:51,225 INFO L226 Difference]: Without dead ends: 1001 [2024-11-08 10:22:51,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-08 10:22:51,226 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 51 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:51,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 500 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-08 10:22:51,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 928. [2024-11-08 10:22:51,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 857 states have (on average 1.2777129521586932) internal successors, (1095), 861 states have internal predecessors, (1095), 64 states have call successors, (64), 4 states have call predecessors, (64), 6 states have return successors, (71), 65 states have call predecessors, (71), 61 states have call successors, (71) [2024-11-08 10:22:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1230 transitions. [2024-11-08 10:22:51,280 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1230 transitions. Word has length 54 [2024-11-08 10:22:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:51,280 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1230 transitions. [2024-11-08 10:22:51,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1230 transitions. [2024-11-08 10:22:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 10:22:51,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:51,285 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:51,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 10:22:51,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-08 10:22:51,489 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:51,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash -385973222, now seen corresponding path program 1 times [2024-11-08 10:22:51,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:51,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721029941] [2024-11-08 10:22:51,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:51,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:51,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:51,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:51,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 10:22:51,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:51,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721029941] [2024-11-08 10:22:51,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721029941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:51,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311843712] [2024-11-08 10:22:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:51,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:51,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:51,985 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) [2024-11-08 10:22:51,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 10:22:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:52,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 10:22:52,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:52,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311843712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:52,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:22:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 23 [2024-11-08 10:22:52,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081125891] [2024-11-08 10:22:52,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:52,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:22:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:52,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:22:52,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-08 10:22:52,183 INFO L87 Difference]: Start difference. First operand 928 states and 1230 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:52,362 INFO L93 Difference]: Finished difference Result 1181 states and 1568 transitions. [2024-11-08 10:22:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:22:52,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-08 10:22:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:52,367 INFO L225 Difference]: With dead ends: 1181 [2024-11-08 10:22:52,367 INFO L226 Difference]: Without dead ends: 1104 [2024-11-08 10:22:52,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2024-11-08 10:22:52,368 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 60 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:52,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1054 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-11-08 10:22:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 839. [2024-11-08 10:22:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 774 states have (on average 1.276485788113695) internal successors, (988), 780 states have internal predecessors, (988), 58 states have call successors, (58), 4 states have call predecessors, (58), 6 states have return successors, (63), 57 states have call predecessors, (63), 55 states have call successors, (63) [2024-11-08 10:22:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1109 transitions. [2024-11-08 10:22:52,398 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1109 transitions. Word has length 55 [2024-11-08 10:22:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:52,399 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1109 transitions. [2024-11-08 10:22:52,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:52,399 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1109 transitions. [2024-11-08 10:22:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 10:22:52,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:52,401 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:52,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 10:22:52,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-08 10:22:52,601 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:52,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1074781062, now seen corresponding path program 1 times [2024-11-08 10:22:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:52,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623710568] [2024-11-08 10:22:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:52,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:52,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:52,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 10:22:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:52,810 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:22:52,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:52,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623710568] [2024-11-08 10:22:52,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623710568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:52,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:52,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 10:22:52,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213411539] [2024-11-08 10:22:52,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:52,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 10:22:52,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:52,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 10:22:52,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:52,812 INFO L87 Difference]: Start difference. First operand 839 states and 1109 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:52,896 INFO L93 Difference]: Finished difference Result 845 states and 1114 transitions. [2024-11-08 10:22:52,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 10:22:52,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-08 10:22:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:52,900 INFO L225 Difference]: With dead ends: 845 [2024-11-08 10:22:52,900 INFO L226 Difference]: Without dead ends: 843 [2024-11-08 10:22:52,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 10:22:52,901 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 12 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:52,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 707 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-08 10:22:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2024-11-08 10:22:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 777 states have (on average 1.2754182754182755) internal successors, (991), 783 states have internal predecessors, (991), 58 states have call successors, (58), 5 states have call predecessors, (58), 7 states have return successors, (63), 57 states have call predecessors, (63), 55 states have call successors, (63) [2024-11-08 10:22:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1112 transitions. [2024-11-08 10:22:52,927 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1112 transitions. Word has length 55 [2024-11-08 10:22:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:52,928 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1112 transitions. [2024-11-08 10:22:52,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1112 transitions. [2024-11-08 10:22:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 10:22:52,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:52,929 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:52,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 10:22:52,930 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:52,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash -130309154, now seen corresponding path program 1 times [2024-11-08 10:22:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:52,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289296109] [2024-11-08 10:22:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:52,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 10:22:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:22:53,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:53,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289296109] [2024-11-08 10:22:53,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289296109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:53,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:53,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:22:53,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991684047] [2024-11-08 10:22:53,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:53,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:53,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:53,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:53,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:53,012 INFO L87 Difference]: Start difference. First operand 843 states and 1112 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:53,060 INFO L93 Difference]: Finished difference Result 870 states and 1140 transitions. [2024-11-08 10:22:53,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:22:53,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-08 10:22:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:53,063 INFO L225 Difference]: With dead ends: 870 [2024-11-08 10:22:53,063 INFO L226 Difference]: Without dead ends: 868 [2024-11-08 10:22:53,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:53,064 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 19 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:53,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 728 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:53,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-11-08 10:22:53,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 849. [2024-11-08 10:22:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 781 states have (on average 1.2740076824583866) internal successors, (995), 788 states have internal predecessors, (995), 59 states have call successors, (59), 6 states have call predecessors, (59), 8 states have return successors, (64), 57 states have call predecessors, (64), 56 states have call successors, (64) [2024-11-08 10:22:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1118 transitions. [2024-11-08 10:22:53,091 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1118 transitions. Word has length 56 [2024-11-08 10:22:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:53,092 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1118 transitions. [2024-11-08 10:22:53,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1118 transitions. [2024-11-08 10:22:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 10:22:53,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:53,093 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:53,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 10:22:53,094 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:53,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:53,094 INFO L85 PathProgramCache]: Analyzing trace with hash -73050852, now seen corresponding path program 1 times [2024-11-08 10:22:53,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:53,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372272660] [2024-11-08 10:22:53,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:53,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 10:22:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:22:53,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372272660] [2024-11-08 10:22:53,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372272660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:53,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:53,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:22:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79760759] [2024-11-08 10:22:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:53,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:53,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:53,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:53,168 INFO L87 Difference]: Start difference. First operand 849 states and 1118 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:53,229 INFO L93 Difference]: Finished difference Result 859 states and 1127 transitions. [2024-11-08 10:22:53,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:22:53,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-08 10:22:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:53,233 INFO L225 Difference]: With dead ends: 859 [2024-11-08 10:22:53,233 INFO L226 Difference]: Without dead ends: 857 [2024-11-08 10:22:53,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:53,234 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 8 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:53,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 641 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-08 10:22:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 853. [2024-11-08 10:22:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 784 states have (on average 1.2729591836734695) internal successors, (998), 791 states have internal predecessors, (998), 59 states have call successors, (59), 7 states have call predecessors, (59), 9 states have return successors, (64), 57 states have call predecessors, (64), 56 states have call successors, (64) [2024-11-08 10:22:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1121 transitions. [2024-11-08 10:22:53,264 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1121 transitions. Word has length 56 [2024-11-08 10:22:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:53,264 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1121 transitions. [2024-11-08 10:22:53,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1121 transitions. [2024-11-08 10:22:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 10:22:53,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:53,266 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:53,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 10:22:53,267 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:53,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1983366207, now seen corresponding path program 1 times [2024-11-08 10:22:53,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:53,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162017543] [2024-11-08 10:22:53,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:53,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 10:22:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:22:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162017543] [2024-11-08 10:22:53,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162017543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430310929] [2024-11-08 10:22:53,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:53,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:53,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:53,436 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) [2024-11-08 10:22:53,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 10:22:53,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:53,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 10:22:53,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:53,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:22:53,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:22:53,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430310929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:53,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:53,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 17 [2024-11-08 10:22:53,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094602091] [2024-11-08 10:22:53,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:53,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 10:22:53,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:53,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 10:22:53,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:22:53,776 INFO L87 Difference]: Start difference. First operand 853 states and 1121 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 10:22:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:54,103 INFO L93 Difference]: Finished difference Result 955 states and 1245 transitions. [2024-11-08 10:22:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 10:22:54,104 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 62 [2024-11-08 10:22:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:54,107 INFO L225 Difference]: With dead ends: 955 [2024-11-08 10:22:54,107 INFO L226 Difference]: Without dead ends: 933 [2024-11-08 10:22:54,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:22:54,108 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 150 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:54,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1458 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:54,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-08 10:22:54,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 868. [2024-11-08 10:22:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 798 states have (on average 1.268170426065163) internal successors, (1012), 803 states have internal predecessors, (1012), 60 states have call successors, (60), 7 states have call predecessors, (60), 9 states have return successors, (65), 58 states have call predecessors, (65), 57 states have call successors, (65) [2024-11-08 10:22:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1137 transitions. [2024-11-08 10:22:54,141 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1137 transitions. Word has length 62 [2024-11-08 10:22:54,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:54,141 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1137 transitions. [2024-11-08 10:22:54,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 15 states have internal predecessors, (82), 6 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-08 10:22:54,142 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1137 transitions. [2024-11-08 10:22:54,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 10:22:54,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:54,144 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:54,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-08 10:22:54,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:54,345 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:54,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1384290479, now seen corresponding path program 1 times [2024-11-08 10:22:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:54,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061113519] [2024-11-08 10:22:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 10:22:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 10:22:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:22:54,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:54,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061113519] [2024-11-08 10:22:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061113519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:54,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:54,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:22:54,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086378405] [2024-11-08 10:22:54,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:54,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:54,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:54,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:54,434 INFO L87 Difference]: Start difference. First operand 868 states and 1137 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:22:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:54,499 INFO L93 Difference]: Finished difference Result 894 states and 1164 transitions. [2024-11-08 10:22:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:22:54,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2024-11-08 10:22:54,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:54,502 INFO L225 Difference]: With dead ends: 894 [2024-11-08 10:22:54,503 INFO L226 Difference]: Without dead ends: 872 [2024-11-08 10:22:54,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:54,504 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 14 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:54,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 693 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-08 10:22:54,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 858. [2024-11-08 10:22:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 787 states have (on average 1.255400254129606) internal successors, (988), 793 states have internal predecessors, (988), 60 states have call successors, (60), 8 states have call predecessors, (60), 10 states have return successors, (65), 57 states have call predecessors, (65), 57 states have call successors, (65) [2024-11-08 10:22:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1113 transitions. [2024-11-08 10:22:54,534 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1113 transitions. Word has length 64 [2024-11-08 10:22:54,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:54,534 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1113 transitions. [2024-11-08 10:22:54,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:22:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1113 transitions. [2024-11-08 10:22:54,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 10:22:54,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:54,536 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:54,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 10:22:54,537 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:54,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:54,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1809751259, now seen corresponding path program 1 times [2024-11-08 10:22:54,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:54,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062690550] [2024-11-08 10:22:54,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:54,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 10:22:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,610 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 10:22:54,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:54,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062690550] [2024-11-08 10:22:54,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062690550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:54,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:54,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:22:54,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148123289] [2024-11-08 10:22:54,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:54,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:54,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:54,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:54,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:54,612 INFO L87 Difference]: Start difference. First operand 858 states and 1113 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:22:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:54,665 INFO L93 Difference]: Finished difference Result 879 states and 1133 transitions. [2024-11-08 10:22:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:22:54,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2024-11-08 10:22:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:54,668 INFO L225 Difference]: With dead ends: 879 [2024-11-08 10:22:54,669 INFO L226 Difference]: Without dead ends: 865 [2024-11-08 10:22:54,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:54,670 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 14 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:54,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 697 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-11-08 10:22:54,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 834. [2024-11-08 10:22:54,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 767 states have (on average 1.2555410691003912) internal successors, (963), 771 states have internal predecessors, (963), 56 states have call successors, (56), 8 states have call predecessors, (56), 10 states have return successors, (61), 55 states have call predecessors, (61), 53 states have call successors, (61) [2024-11-08 10:22:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1080 transitions. [2024-11-08 10:22:54,698 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1080 transitions. Word has length 64 [2024-11-08 10:22:54,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:54,698 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1080 transitions. [2024-11-08 10:22:54,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:22:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1080 transitions. [2024-11-08 10:22:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-08 10:22:54,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:54,700 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:54,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 10:22:54,701 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:54,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:54,701 INFO L85 PathProgramCache]: Analyzing trace with hash -707480718, now seen corresponding path program 1 times [2024-11-08 10:22:54,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:54,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357421782] [2024-11-08 10:22:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:54,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 10:22:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:22:54,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:54,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357421782] [2024-11-08 10:22:54,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357421782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:54,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:54,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 10:22:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289026928] [2024-11-08 10:22:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:54,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:22:54,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:54,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:22:54,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:22:54,767 INFO L87 Difference]: Start difference. First operand 834 states and 1080 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:22:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:54,860 INFO L93 Difference]: Finished difference Result 911 states and 1192 transitions. [2024-11-08 10:22:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:22:54,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2024-11-08 10:22:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:54,863 INFO L225 Difference]: With dead ends: 911 [2024-11-08 10:22:54,864 INFO L226 Difference]: Without dead ends: 906 [2024-11-08 10:22:54,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:54,865 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 10 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:54,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 477 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-11-08 10:22:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 883. [2024-11-08 10:22:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 800 states have (on average 1.26875) internal successors, (1015), 819 states have internal predecessors, (1015), 71 states have call successors, (71), 9 states have call predecessors, (71), 11 states have return successors, (76), 55 states have call predecessors, (76), 68 states have call successors, (76) [2024-11-08 10:22:54,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1162 transitions. [2024-11-08 10:22:54,901 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1162 transitions. Word has length 64 [2024-11-08 10:22:54,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:54,901 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1162 transitions. [2024-11-08 10:22:54,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:22:54,902 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1162 transitions. [2024-11-08 10:22:54,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 10:22:54,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:54,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:54,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 10:22:54,904 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:54,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash 793945063, now seen corresponding path program 1 times [2024-11-08 10:22:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:54,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961208356] [2024-11-08 10:22:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:54,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 10:22:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:22:54,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:54,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961208356] [2024-11-08 10:22:54,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961208356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:54,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:54,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 10:22:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874872987] [2024-11-08 10:22:54,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:54,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:22:54,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:54,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:22:54,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:54,990 INFO L87 Difference]: Start difference. First operand 883 states and 1162 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:22:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:55,045 INFO L93 Difference]: Finished difference Result 1134 states and 1495 transitions. [2024-11-08 10:22:55,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:22:55,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 65 [2024-11-08 10:22:55,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:55,048 INFO L225 Difference]: With dead ends: 1134 [2024-11-08 10:22:55,048 INFO L226 Difference]: Without dead ends: 899 [2024-11-08 10:22:55,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:22:55,049 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:55,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-11-08 10:22:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2024-11-08 10:22:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 816 states have (on average 1.2634803921568627) internal successors, (1031), 835 states have internal predecessors, (1031), 71 states have call successors, (71), 9 states have call predecessors, (71), 11 states have return successors, (76), 55 states have call predecessors, (76), 68 states have call successors, (76) [2024-11-08 10:22:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1178 transitions. [2024-11-08 10:22:55,086 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1178 transitions. Word has length 65 [2024-11-08 10:22:55,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:55,086 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1178 transitions. [2024-11-08 10:22:55,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:22:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1178 transitions. [2024-11-08 10:22:55,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 10:22:55,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:55,088 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:55,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-08 10:22:55,089 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:55,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:55,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1482946329, now seen corresponding path program 1 times [2024-11-08 10:22:55,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:55,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064501114] [2024-11-08 10:22:55,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:55,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 10:22:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:22:55,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:55,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064501114] [2024-11-08 10:22:55,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064501114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:55,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:55,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:22:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011056826] [2024-11-08 10:22:55,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:55,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:55,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:55,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:55,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:55,196 INFO L87 Difference]: Start difference. First operand 899 states and 1178 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:22:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:55,296 INFO L93 Difference]: Finished difference Result 960 states and 1258 transitions. [2024-11-08 10:22:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:22:55,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-11-08 10:22:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:55,300 INFO L225 Difference]: With dead ends: 960 [2024-11-08 10:22:55,300 INFO L226 Difference]: Without dead ends: 955 [2024-11-08 10:22:55,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:55,301 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 9 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:55,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 613 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:55,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-11-08 10:22:55,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 898. [2024-11-08 10:22:55,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 815 states have (on average 1.2625766871165645) internal successors, (1029), 834 states have internal predecessors, (1029), 71 states have call successors, (71), 9 states have call predecessors, (71), 11 states have return successors, (76), 55 states have call predecessors, (76), 68 states have call successors, (76) [2024-11-08 10:22:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1176 transitions. [2024-11-08 10:22:55,336 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1176 transitions. Word has length 66 [2024-11-08 10:22:55,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:55,337 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1176 transitions. [2024-11-08 10:22:55,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:22:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1176 transitions. [2024-11-08 10:22:55,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 10:22:55,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:55,339 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:22:55,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-08 10:22:55,339 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:55,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:55,340 INFO L85 PathProgramCache]: Analyzing trace with hash 179391471, now seen corresponding path program 1 times [2024-11-08 10:22:55,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:55,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120445259] [2024-11-08 10:22:55,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:55,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:22:55,368 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 10:22:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:22:55,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 10:22:55,428 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 10:22:55,430 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:22:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 10:22:55,435 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-08 10:22:55,477 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:22:55,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:22:55 BoogieIcfgContainer [2024-11-08 10:22:55,479 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:22:55,480 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:22:55,480 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:22:55,480 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:22:55,480 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:38" (3/4) ... [2024-11-08 10:22:55,483 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 10:22:55,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:22:55,484 INFO L158 Benchmark]: Toolchain (without parser) took 18507.86ms. Allocated memory was 169.9MB in the beginning and 358.6MB in the end (delta: 188.7MB). Free memory was 119.1MB in the beginning and 133.9MB in the end (delta: -14.8MB). Peak memory consumption was 173.9MB. Max. memory is 16.1GB. [2024-11-08 10:22:55,484 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 64.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:55,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.68ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 102.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 10:22:55,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.69ms. Allocated memory is still 169.9MB. Free memory was 102.8MB in the beginning and 100.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:55,485 INFO L158 Benchmark]: Boogie Preprocessor took 53.14ms. Allocated memory is still 169.9MB. Free memory was 100.8MB in the beginning and 98.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:55,485 INFO L158 Benchmark]: RCFGBuilder took 684.30ms. Allocated memory is still 169.9MB. Free memory was 98.2MB in the beginning and 119.2MB in the end (delta: -21.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:22:55,485 INFO L158 Benchmark]: TraceAbstraction took 17319.18ms. Allocated memory was 169.9MB in the beginning and 358.6MB in the end (delta: 188.7MB). Free memory was 118.2MB in the beginning and 133.9MB in the end (delta: -15.7MB). Peak memory consumption was 175.1MB. Max. memory is 16.1GB. [2024-11-08 10:22:55,485 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 358.6MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:22:55,486 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.19ms. Allocated memory is still 100.7MB. Free memory was 64.7MB in the beginning and 64.6MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.68ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 102.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.69ms. Allocated memory is still 169.9MB. Free memory was 102.8MB in the beginning and 100.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.14ms. Allocated memory is still 169.9MB. Free memory was 100.8MB in the beginning and 98.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 684.30ms. Allocated memory is still 169.9MB. Free memory was 98.2MB in the beginning and 119.2MB in the end (delta: -21.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17319.18ms. Allocated memory was 169.9MB in the beginning and 358.6MB in the end (delta: 188.7MB). Free memory was 118.2MB in the beginning and 133.9MB in the end (delta: -15.7MB). Peak memory consumption was 175.1MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 358.6MB. Free memory is still 133.9MB. There was no memory consumed. 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 - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 114, overapproximation of bitwiseAnd at line 127. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add ; [L234] unsigned int zero ; [L235] int sa ; [L236] int sb ; [L237] int tmp ; [L238] int tmp___0 ; [L239] int tmp___1 ; [L240] int tmp___2 ; [L241] int tmp___3 ; [L242] int tmp___4 ; [L243] int tmp___5 ; [L244] int tmp___6 ; [L245] int tmp___7 ; [L246] int tmp___8 ; [L247] int tmp___9 ; [L248] int __retres23 ; VAL [ea=127, eb=127] [L252] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L252] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=127] [L252] zero = base2flt(0, 0) [L253] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=4328521728] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=4328521728, e=127, m=4328521728] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=4328521728, __retres4=4294967295, m=4328521728] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=4328521728, \result=4294967295, m=4328521728] [L253] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=127, ma=4328521728, zero=0] [L253] a = base2flt(ma, ea) [L254] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L30] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L58] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L60] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L65] COND TRUE e >= 127 [L66] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L81] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L254] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L254] b = base2flt(mb, eb) [L256] COND FALSE !(a < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, zero=0] [L259] COND TRUE a > zero [L260] tmp = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, tmp=1, zero=0] [L264] sa = tmp VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L266] COND FALSE !(b < zero) VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, zero=0] [L269] COND TRUE b > zero [L270] tmp___0 = 1 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, tmp___0=1] [L274] sb = tmp___0 VAL [a=4294967295, b=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432, sa=1, sb=1] [L277] CALL addflt(a, b) [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 VAL [a=4294967295, b=4294967295, ea=127, ma=16777215] [L111] EXPR ma | (1U << 24U) VAL [a=4294967295, b=4294967295, ea=127] [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 VAL [a=4294967295, ea=127, eb=127, ma=-4261412865, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [a=4294967295, ea=127, eb=127, ma=-4261412865] [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L115] RET __VERIFIER_assert(ea >= eb) VAL [a=4294967295, ea=127, eb=127, ma=-4261412865, mb=-4278190080] [L116] delta = ea - eb VAL [a=4294967295, delta=0, ea=127, ma=-4261412865, mb=-4278190080] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [a=4294967295, delta=0, ea=127, ma=-4261412865, mb=-4278190080] [L118] EXPR mb >> delta VAL [a=4294967295, ea=127, ma=-4261412865] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [a=4294967295, ea=127, ma=-8539602945] [L127] ma & (1U << 25U) VAL [a=4294967295, ea=127, ma=-8539602945] [L127] COND FALSE !(ma & (1U << 25U)) [L140] CALL __VERIFIER_assert(ma < 1U << 25U) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L18] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 37, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1815 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1721 mSDsluCounter, 25729 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20591 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3767 IncrementalHoareTripleChecker+Invalid, 3877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 5138 mSDtfsCounter, 3767 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1503 GetRequests, 1227 SyntacticMatches, 3 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1012occurred in iteration=20, InterpolantAutomatonStates: 232, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 36 MinimizatonAttempts, 1967 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2561 NumberOfCodeBlocks, 2561 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2742 ConstructedInterpolants, 0 QuantifiedInterpolants, 5617 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2090 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 56 InterpolantComputations, 32 PerfectInterpolantSequences, 854/941 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 10:22:55,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:22:57,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:22:57,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 10:22:57,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:22:57,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:22:57,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:22:57,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:22:57,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:22:57,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:22:57,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:22:57,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:22:57,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:22:57,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:22:57,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:22:57,932 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:22:57,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:22:57,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:22:57,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:22:57,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:22:57,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:22:57,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:22:57,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:22:57,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:22:57,941 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 10:22:57,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 10:22:57,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:22:57,942 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 10:22:57,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:22:57,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:22:57,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:22:57,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:22:57,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:22:57,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:22:57,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:22:57,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:57,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:22:57,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:22:57,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:22:57,945 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 10:22:57,945 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 10:22:57,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:22:57,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:22:57,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:22:57,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:22:57,947 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2024-11-08 10:22:58,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:22:58,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:22:58,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:22:58,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:22:58,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:22:58,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-08 10:22:59,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:22:59,962 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:22:59,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2024-11-08 10:22:59,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c004293e7/a5d7d7761a1646648add5b796bcdc9e2/FLAGd875ee377 [2024-11-08 10:23:00,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c004293e7/a5d7d7761a1646648add5b796bcdc9e2 [2024-11-08 10:23:00,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:23:00,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:23:00,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:23:00,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:23:00,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:23:00,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@826e009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00, skipping insertion in model container [2024-11-08 10:23:00,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:23:00,582 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-08 10:23:00,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:23:00,691 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:23:00,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c[755,768] [2024-11-08 10:23:00,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:23:00,785 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:23:00,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00 WrapperNode [2024-11-08 10:23:00,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:23:00,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:23:00,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:23:00,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:23:00,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,837 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2024-11-08 10:23:00,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:23:00,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:23:00,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:23:00,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:23:00,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,882 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:23:00,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:23:00,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:23:00,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:23:00,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:23:00,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (1/1) ... [2024-11-08 10:23:00,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:23:00,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:00,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 10:23:00,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 10:23:01,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:23:01,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 10:23:01,022 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-08 10:23:01,022 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-08 10:23:01,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:23:01,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:23:01,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 10:23:01,023 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 10:23:01,115 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:23:01,117 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:23:01,483 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-08 10:23:01,484 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:23:01,501 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:23:01,502 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 10:23:01,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:23:01 BoogieIcfgContainer [2024-11-08 10:23:01,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:23:01,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:23:01,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:23:01,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:23:01,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:23:00" (1/3) ... [2024-11-08 10:23:01,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4e938f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:23:01, skipping insertion in model container [2024-11-08 10:23:01,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:00" (2/3) ... [2024-11-08 10:23:01,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4e938f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:23:01, skipping insertion in model container [2024-11-08 10:23:01,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:23:01" (3/3) ... [2024-11-08 10:23:01,515 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2024-11-08 10:23:01,535 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:23:01,535 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:23:01,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:23:01,607 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71596a9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:23:01,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:23:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 60 states have (on average 1.6) internal successors, (96), 63 states have internal predecessors, (96), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-08 10:23:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 10:23:01,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:01,620 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:01,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:01,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:01,629 INFO L85 PathProgramCache]: Analyzing trace with hash -760882007, now seen corresponding path program 1 times [2024-11-08 10:23:01,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:01,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427199099] [2024-11-08 10:23:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:01,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:01,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:01,645 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:01,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 10:23:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 10:23:01,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:01,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:01,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:01,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427199099] [2024-11-08 10:23:01,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427199099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:01,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:23:01,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-11-08 10:23:01,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586689693] [2024-11-08 10:23:01,999 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:02,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:23:02,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:02,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:23:02,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:02,031 INFO L87 Difference]: Start difference. First operand has 72 states, 60 states have (on average 1.6) internal successors, (96), 63 states have internal predecessors, (96), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:23:02,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:02,147 INFO L93 Difference]: Finished difference Result 154 states and 253 transitions. [2024-11-08 10:23:02,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:02,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-08 10:23:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:02,159 INFO L225 Difference]: With dead ends: 154 [2024-11-08 10:23:02,159 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 10:23:02,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:02,165 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 5 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:02,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 491 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 10:23:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2024-11-08 10:23:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 68 states have internal predecessors, (96), 10 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2024-11-08 10:23:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-11-08 10:23:02,205 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 32 [2024-11-08 10:23:02,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:02,205 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-11-08 10:23:02,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:23:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-11-08 10:23:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 10:23:02,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:02,208 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:02,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 10:23:02,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:02,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:02,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:02,412 INFO L85 PathProgramCache]: Analyzing trace with hash 975798983, now seen corresponding path program 1 times [2024-11-08 10:23:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:02,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034893620] [2024-11-08 10:23:02,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:02,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:02,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:02,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:02,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 10:23:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 10:23:02,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:02,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:02,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034893620] [2024-11-08 10:23:02,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034893620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:02,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:02,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:23:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260644204] [2024-11-08 10:23:02,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:02,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:23:02,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:02,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:23:02,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:02,563 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:02,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:02,681 INFO L93 Difference]: Finished difference Result 167 states and 254 transitions. [2024-11-08 10:23:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:02,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-08 10:23:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:02,685 INFO L225 Difference]: With dead ends: 167 [2024-11-08 10:23:02,685 INFO L226 Difference]: Without dead ends: 125 [2024-11-08 10:23:02,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:02,686 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 46 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:02,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 435 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-08 10:23:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-08 10:23:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 105 states have (on average 1.457142857142857) internal successors, (153), 106 states have internal predecessors, (153), 14 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (18), 16 states have call predecessors, (18), 13 states have call successors, (18) [2024-11-08 10:23:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2024-11-08 10:23:02,701 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 36 [2024-11-08 10:23:02,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:02,701 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2024-11-08 10:23:02,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2024-11-08 10:23:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 10:23:02,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:02,705 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:02,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:02,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:02,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:02,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:02,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1655857353, now seen corresponding path program 1 times [2024-11-08 10:23:02,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:02,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263852205] [2024-11-08 10:23:02,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:02,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:02,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:02,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:02,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 10:23:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:02,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 10:23:02,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:03,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:03,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:03,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263852205] [2024-11-08 10:23:03,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263852205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:03,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:03,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 10:23:03,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830486873] [2024-11-08 10:23:03,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:03,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 10:23:03,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:03,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 10:23:03,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:03,064 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:03,196 INFO L93 Difference]: Finished difference Result 155 states and 231 transitions. [2024-11-08 10:23:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 10:23:03,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-08 10:23:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:03,199 INFO L225 Difference]: With dead ends: 155 [2024-11-08 10:23:03,199 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 10:23:03,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:23:03,203 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 33 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:03,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 511 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 10:23:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-08 10:23:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 99 states have internal predecessors, (141), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 14 states have call predecessors, (16), 11 states have call successors, (16) [2024-11-08 10:23:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2024-11-08 10:23:03,223 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 36 [2024-11-08 10:23:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:03,225 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 169 transitions. [2024-11-08 10:23:03,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 169 transitions. [2024-11-08 10:23:03,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 10:23:03,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:03,228 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:03,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 10:23:03,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:03,429 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:03,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash -371678158, now seen corresponding path program 1 times [2024-11-08 10:23:03,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:03,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407845321] [2024-11-08 10:23:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:03,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:03,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:03,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:03,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 10:23:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:03,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 10:23:03,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:03,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:03,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:03,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407845321] [2024-11-08 10:23:03,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407845321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:03,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:23:03,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-08 10:23:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795844113] [2024-11-08 10:23:03,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:03,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:23:03,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:03,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:23:03,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:23:03,652 INFO L87 Difference]: Start difference. First operand 114 states and 169 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:23:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:03,795 INFO L93 Difference]: Finished difference Result 256 states and 383 transitions. [2024-11-08 10:23:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 10:23:03,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2024-11-08 10:23:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:03,798 INFO L225 Difference]: With dead ends: 256 [2024-11-08 10:23:03,798 INFO L226 Difference]: Without dead ends: 181 [2024-11-08 10:23:03,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:23:03,803 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 28 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:03,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 590 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-08 10:23:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-11-08 10:23:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 156 states have (on average 1.3846153846153846) internal successors, (216), 155 states have internal predecessors, (216), 18 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (24), 24 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-08 10:23:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 258 transitions. [2024-11-08 10:23:03,830 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 258 transitions. Word has length 40 [2024-11-08 10:23:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:03,831 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 258 transitions. [2024-11-08 10:23:03,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:23:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 258 transitions. [2024-11-08 10:23:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 10:23:03,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:03,833 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:03,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:04,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:04,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:04,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2082074321, now seen corresponding path program 1 times [2024-11-08 10:23:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:04,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850246589] [2024-11-08 10:23:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:04,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:04,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:04,042 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:04,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 10:23:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:23:04,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:23:04,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:04,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:04,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850246589] [2024-11-08 10:23:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850246589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:04,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:04,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:23:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956904481] [2024-11-08 10:23:04,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:04,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:23:04,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:04,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:23:04,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:04,120 INFO L87 Difference]: Start difference. First operand 178 states and 258 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:04,146 INFO L93 Difference]: Finished difference Result 299 states and 437 transitions. [2024-11-08 10:23:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:23:04,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-08 10:23:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:04,149 INFO L225 Difference]: With dead ends: 299 [2024-11-08 10:23:04,149 INFO L226 Difference]: Without dead ends: 233 [2024-11-08 10:23:04,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:04,151 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 15 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:04,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 318 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-08 10:23:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-08 10:23:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 209 states have (on average 1.3444976076555024) internal successors, (281), 208 states have internal predecessors, (281), 20 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (26), 26 states have call predecessors, (26), 19 states have call successors, (26) [2024-11-08 10:23:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 327 transitions. [2024-11-08 10:23:04,175 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 327 transitions. Word has length 43 [2024-11-08 10:23:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:04,181 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 327 transitions. [2024-11-08 10:23:04,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 327 transitions. [2024-11-08 10:23:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 10:23:04,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:04,183 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:04,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 10:23:04,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:04,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:04,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1847325628, now seen corresponding path program 1 times [2024-11-08 10:23:04,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:04,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469528795] [2024-11-08 10:23:04,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:04,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:04,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:04,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:04,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 10:23:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:23:04,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 10:23:04,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:04,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469528795] [2024-11-08 10:23:04,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1469528795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:04,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:04,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:23:04,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743083931] [2024-11-08 10:23:04,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:04,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:23:04,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:04,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:23:04,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:04,475 INFO L87 Difference]: Start difference. First operand 233 states and 327 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:23:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:04,527 INFO L93 Difference]: Finished difference Result 408 states and 569 transitions. [2024-11-08 10:23:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:23:04,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-08 10:23:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:04,529 INFO L225 Difference]: With dead ends: 408 [2024-11-08 10:23:04,529 INFO L226 Difference]: Without dead ends: 178 [2024-11-08 10:23:04,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:23:04,531 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 26 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:04,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 258 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-08 10:23:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-11-08 10:23:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 148 states have (on average 1.304054054054054) internal successors, (193), 150 states have internal predecessors, (193), 13 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (18), 15 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-08 10:23:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2024-11-08 10:23:04,543 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 224 transitions. Word has length 43 [2024-11-08 10:23:04,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:04,543 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 224 transitions. [2024-11-08 10:23:04,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:23:04,543 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 224 transitions. [2024-11-08 10:23:04,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 10:23:04,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:04,544 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:04,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-08 10:23:04,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:04,745 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:04,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:04,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1563397194, now seen corresponding path program 1 times [2024-11-08 10:23:04,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:04,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42574186] [2024-11-08 10:23:04,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:04,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:04,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:04,748 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:04,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-08 10:23:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 10:23:04,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:04,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:23:05,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:05,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42574186] [2024-11-08 10:23:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42574186] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:05,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:05,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-08 10:23:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343050356] [2024-11-08 10:23:05,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:05,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:23:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:23:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:23:05,052 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:05,232 INFO L93 Difference]: Finished difference Result 252 states and 350 transitions. [2024-11-08 10:23:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:05,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-08 10:23:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:05,235 INFO L225 Difference]: With dead ends: 252 [2024-11-08 10:23:05,235 INFO L226 Difference]: Without dead ends: 216 [2024-11-08 10:23:05,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:23:05,237 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 25 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:05,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 372 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:23:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-08 10:23:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204. [2024-11-08 10:23:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 182 states have (on average 1.2967032967032968) internal successors, (236), 185 states have internal predecessors, (236), 17 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-08 10:23:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 275 transitions. [2024-11-08 10:23:05,253 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 275 transitions. Word has length 44 [2024-11-08 10:23:05,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:05,253 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 275 transitions. [2024-11-08 10:23:05,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 275 transitions. [2024-11-08 10:23:05,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 10:23:05,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:05,255 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:05,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:05,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:05,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:05,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:05,456 INFO L85 PathProgramCache]: Analyzing trace with hash -956562740, now seen corresponding path program 1 times [2024-11-08 10:23:05,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:05,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479943773] [2024-11-08 10:23:05,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:05,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:05,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:05,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:05,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-08 10:23:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:23:05,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:23:05,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:05,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:05,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479943773] [2024-11-08 10:23:05,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479943773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:05,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:05,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 10:23:05,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491441202] [2024-11-08 10:23:05,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:05,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:23:05,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:05,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:23:05,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:23:05,534 INFO L87 Difference]: Start difference. First operand 204 states and 275 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:05,571 INFO L93 Difference]: Finished difference Result 211 states and 281 transitions. [2024-11-08 10:23:05,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 10:23:05,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-08 10:23:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:05,573 INFO L225 Difference]: With dead ends: 211 [2024-11-08 10:23:05,573 INFO L226 Difference]: Without dead ends: 204 [2024-11-08 10:23:05,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:05,574 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:05,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:05,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-08 10:23:05,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-08 10:23:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 185 states have internal predecessors, (233), 17 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-08 10:23:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 272 transitions. [2024-11-08 10:23:05,592 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 272 transitions. Word has length 44 [2024-11-08 10:23:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:05,592 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 272 transitions. [2024-11-08 10:23:05,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 272 transitions. [2024-11-08 10:23:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 10:23:05,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:05,595 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:05,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-08 10:23:05,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:05,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:05,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:05,796 INFO L85 PathProgramCache]: Analyzing trace with hash -3100185, now seen corresponding path program 2 times [2024-11-08 10:23:05,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:05,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355593457] [2024-11-08 10:23:05,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:23:05,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:05,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:05,799 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:05,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-08 10:23:05,852 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 10:23:05,852 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:23:05,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 10:23:05,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:06,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:06,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:06,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355593457] [2024-11-08 10:23:06,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355593457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:06,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:06,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:23:06,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635381300] [2024-11-08 10:23:06,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:06,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:23:06,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:06,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:23:06,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:06,005 INFO L87 Difference]: Start difference. First operand 204 states and 272 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:06,102 INFO L93 Difference]: Finished difference Result 210 states and 277 transitions. [2024-11-08 10:23:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:06,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-08 10:23:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:06,104 INFO L225 Difference]: With dead ends: 210 [2024-11-08 10:23:06,104 INFO L226 Difference]: Without dead ends: 208 [2024-11-08 10:23:06,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:06,105 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 3 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:06,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 455 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-08 10:23:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2024-11-08 10:23:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 188 states have internal predecessors, (236), 17 states have call successors, (17), 3 states have call predecessors, (17), 5 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-08 10:23:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 275 transitions. [2024-11-08 10:23:06,116 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 275 transitions. Word has length 44 [2024-11-08 10:23:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:06,116 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 275 transitions. [2024-11-08 10:23:06,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 275 transitions. [2024-11-08 10:23:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 10:23:06,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:06,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:06,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-08 10:23:06,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:06,318 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:06,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:06,319 INFO L85 PathProgramCache]: Analyzing trace with hash 54158117, now seen corresponding path program 1 times [2024-11-08 10:23:06,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:06,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954241289] [2024-11-08 10:23:06,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:06,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:06,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:06,320 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:06,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-08 10:23:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 10:23:06,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:23:06,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:06,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:06,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954241289] [2024-11-08 10:23:06,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954241289] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:06,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:06,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-11-08 10:23:06,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476257704] [2024-11-08 10:23:06,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:06,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:23:06,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:23:06,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-11-08 10:23:06,684 INFO L87 Difference]: Start difference. First operand 208 states and 275 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:06,755 INFO L93 Difference]: Finished difference Result 214 states and 280 transitions. [2024-11-08 10:23:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:06,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-08 10:23:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:06,758 INFO L225 Difference]: With dead ends: 214 [2024-11-08 10:23:06,758 INFO L226 Difference]: Without dead ends: 212 [2024-11-08 10:23:06,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:23:06,759 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:06,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 450 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:06,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-08 10:23:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-11-08 10:23:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 188 states have (on average 1.2712765957446808) internal successors, (239), 191 states have internal predecessors, (239), 17 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-08 10:23:06,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 278 transitions. [2024-11-08 10:23:06,768 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 278 transitions. Word has length 44 [2024-11-08 10:23:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:06,769 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 278 transitions. [2024-11-08 10:23:06,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 278 transitions. [2024-11-08 10:23:06,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 10:23:06,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:06,770 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:06,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-08 10:23:06,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:06,973 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:06,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash 561980754, now seen corresponding path program 1 times [2024-11-08 10:23:06,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:06,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125794652] [2024-11-08 10:23:06,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:06,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:06,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:06,977 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:06,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-08 10:23:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:23:07,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:23:07,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:07,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:07,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125794652] [2024-11-08 10:23:07,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125794652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:07,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:07,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:23:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536631199] [2024-11-08 10:23:07,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:07,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:23:07,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:07,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:23:07,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:07,060 INFO L87 Difference]: Start difference. First operand 212 states and 278 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:07,084 INFO L93 Difference]: Finished difference Result 345 states and 463 transitions. [2024-11-08 10:23:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:23:07,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-08 10:23:07,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:07,087 INFO L225 Difference]: With dead ends: 345 [2024-11-08 10:23:07,087 INFO L226 Difference]: Without dead ends: 293 [2024-11-08 10:23:07,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:07,088 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 28 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:07,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-08 10:23:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 231. [2024-11-08 10:23:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 206 states have (on average 1.2766990291262137) internal successors, (263), 208 states have internal predecessors, (263), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (23), 20 states have call predecessors, (23), 17 states have call successors, (23) [2024-11-08 10:23:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 304 transitions. [2024-11-08 10:23:07,103 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 304 transitions. Word has length 45 [2024-11-08 10:23:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:07,103 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 304 transitions. [2024-11-08 10:23:07,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 304 transitions. [2024-11-08 10:23:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 10:23:07,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:07,105 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:07,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-08 10:23:07,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:07,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:07,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:07,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2079579127, now seen corresponding path program 1 times [2024-11-08 10:23:07,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:07,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949820882] [2024-11-08 10:23:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:07,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:07,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:07,308 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:07,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-08 10:23:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:23:07,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:07,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:23:07,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:07,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:07,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949820882] [2024-11-08 10:23:07,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949820882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:07,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:07,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:23:07,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349077189] [2024-11-08 10:23:07,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:07,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:23:07,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:07,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:23:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:07,371 INFO L87 Difference]: Start difference. First operand 231 states and 304 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:07,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:07,386 INFO L93 Difference]: Finished difference Result 246 states and 320 transitions. [2024-11-08 10:23:07,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:23:07,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-08 10:23:07,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:07,389 INFO L225 Difference]: With dead ends: 246 [2024-11-08 10:23:07,389 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 10:23:07,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:07,390 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:07,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 10:23:07,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-11-08 10:23:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 182 states have (on average 1.2912087912087913) internal successors, (235), 185 states have internal predecessors, (235), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-08 10:23:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 274 transitions. [2024-11-08 10:23:07,399 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 274 transitions. Word has length 48 [2024-11-08 10:23:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:07,400 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 274 transitions. [2024-11-08 10:23:07,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 274 transitions. [2024-11-08 10:23:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 10:23:07,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:07,401 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:07,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:07,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:07,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:07,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:07,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1609971577, now seen corresponding path program 1 times [2024-11-08 10:23:07,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:07,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215347916] [2024-11-08 10:23:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:07,606 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:07,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:07,607 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:07,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-08 10:23:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 10:23:07,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:07,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:07,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:07,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215347916] [2024-11-08 10:23:07,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215347916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:07,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:07,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 10:23:07,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286371823] [2024-11-08 10:23:07,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:07,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 10:23:07,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:07,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 10:23:07,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:23:07,690 INFO L87 Difference]: Start difference. First operand 207 states and 274 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:07,788 INFO L93 Difference]: Finished difference Result 263 states and 351 transitions. [2024-11-08 10:23:07,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:07,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-08 10:23:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:07,791 INFO L225 Difference]: With dead ends: 263 [2024-11-08 10:23:07,791 INFO L226 Difference]: Without dead ends: 221 [2024-11-08 10:23:07,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:07,792 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 59 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:07,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 360 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-08 10:23:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 207. [2024-11-08 10:23:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 185 states have internal predecessors, (233), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-08 10:23:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 272 transitions. [2024-11-08 10:23:07,807 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 272 transitions. Word has length 49 [2024-11-08 10:23:07,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:07,807 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 272 transitions. [2024-11-08 10:23:07,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 272 transitions. [2024-11-08 10:23:07,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 10:23:07,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:07,808 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:07,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-08 10:23:08,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:08,009 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:08,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:08,010 INFO L85 PathProgramCache]: Analyzing trace with hash -908906999, now seen corresponding path program 1 times [2024-11-08 10:23:08,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:08,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980000682] [2024-11-08 10:23:08,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:08,010 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:08,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:08,013 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:08,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-08 10:23:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 10:23:08,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:08,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:08,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:08,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980000682] [2024-11-08 10:23:08,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980000682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:08,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:08,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:23:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254095719] [2024-11-08 10:23:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:08,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:23:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:08,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:23:08,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:08,087 INFO L87 Difference]: Start difference. First operand 207 states and 272 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:08,144 INFO L93 Difference]: Finished difference Result 285 states and 374 transitions. [2024-11-08 10:23:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:23:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-11-08 10:23:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:08,146 INFO L225 Difference]: With dead ends: 285 [2024-11-08 10:23:08,146 INFO L226 Difference]: Without dead ends: 254 [2024-11-08 10:23:08,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 10:23:08,147 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 40 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:08,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 274 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-08 10:23:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 211. [2024-11-08 10:23:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 186 states have (on average 1.2741935483870968) internal successors, (237), 189 states have internal predecessors, (237), 18 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-08 10:23:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2024-11-08 10:23:08,160 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 49 [2024-11-08 10:23:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:08,161 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2024-11-08 10:23:08,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:08,162 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2024-11-08 10:23:08,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 10:23:08,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:08,168 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:08,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-08 10:23:08,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:08,372 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:08,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1552744902, now seen corresponding path program 1 times [2024-11-08 10:23:08,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:08,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583376501] [2024-11-08 10:23:08,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:08,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:08,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:08,374 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:08,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-08 10:23:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 10:23:08,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:23:08,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:08,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:08,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583376501] [2024-11-08 10:23:08,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583376501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:08,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:08,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 10:23:08,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982298129] [2024-11-08 10:23:08,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:08,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 10:23:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:08,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 10:23:08,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:08,486 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:08,683 INFO L93 Difference]: Finished difference Result 290 states and 388 transitions. [2024-11-08 10:23:08,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 10:23:08,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-08 10:23:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:08,686 INFO L225 Difference]: With dead ends: 290 [2024-11-08 10:23:08,686 INFO L226 Difference]: Without dead ends: 266 [2024-11-08 10:23:08,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:08,687 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 27 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:08,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 461 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:23:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-08 10:23:08,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 248. [2024-11-08 10:23:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 219 states have (on average 1.269406392694064) internal successors, (278), 223 states have internal predecessors, (278), 22 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-08 10:23:08,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 325 transitions. [2024-11-08 10:23:08,698 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 325 transitions. Word has length 50 [2024-11-08 10:23:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:08,699 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 325 transitions. [2024-11-08 10:23:08,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 325 transitions. [2024-11-08 10:23:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 10:23:08,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:08,700 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:08,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-08 10:23:08,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:08,901 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:08,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash -963972016, now seen corresponding path program 1 times [2024-11-08 10:23:08,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:08,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205896768] [2024-11-08 10:23:08,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:08,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:08,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:08,903 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:08,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-08 10:23:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 10:23:08,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:09,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:09,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:09,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205896768] [2024-11-08 10:23:09,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205896768] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:09,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:23:09,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-11-08 10:23:09,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664957099] [2024-11-08 10:23:09,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:09,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 10:23:09,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:09,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 10:23:09,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:09,109 INFO L87 Difference]: Start difference. First operand 248 states and 325 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:23:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:09,193 INFO L93 Difference]: Finished difference Result 271 states and 351 transitions. [2024-11-08 10:23:09,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:23:09,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-08 10:23:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:09,195 INFO L225 Difference]: With dead ends: 271 [2024-11-08 10:23:09,195 INFO L226 Difference]: Without dead ends: 237 [2024-11-08 10:23:09,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:23:09,196 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 20 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:09,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 505 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:09,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-08 10:23:09,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 226. [2024-11-08 10:23:09,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 197 states have (on average 1.2791878172588833) internal successors, (252), 201 states have internal predecessors, (252), 22 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-08 10:23:09,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 299 transitions. [2024-11-08 10:23:09,212 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 299 transitions. Word has length 50 [2024-11-08 10:23:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:09,213 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 299 transitions. [2024-11-08 10:23:09,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:23:09,213 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 299 transitions. [2024-11-08 10:23:09,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 10:23:09,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:09,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:09,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:09,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:09,417 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:09,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:09,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1182826734, now seen corresponding path program 1 times [2024-11-08 10:23:09,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264201508] [2024-11-08 10:23:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:09,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:09,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:09,419 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:09,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-08 10:23:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:23:09,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:23:09,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:09,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264201508] [2024-11-08 10:23:09,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264201508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:09,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:09,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:23:09,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149678465] [2024-11-08 10:23:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:09,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:23:09,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:09,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:23:09,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:09,495 INFO L87 Difference]: Start difference. First operand 226 states and 299 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:09,520 INFO L93 Difference]: Finished difference Result 260 states and 340 transitions. [2024-11-08 10:23:09,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:23:09,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-08 10:23:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:09,522 INFO L225 Difference]: With dead ends: 260 [2024-11-08 10:23:09,522 INFO L226 Difference]: Without dead ends: 226 [2024-11-08 10:23:09,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:09,523 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 26 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:09,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 283 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-08 10:23:09,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-11-08 10:23:09,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 197 states have (on average 1.218274111675127) internal successors, (240), 201 states have internal predecessors, (240), 22 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (25), 23 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-08 10:23:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 287 transitions. [2024-11-08 10:23:09,546 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 287 transitions. Word has length 50 [2024-11-08 10:23:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:09,547 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 287 transitions. [2024-11-08 10:23:09,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2024-11-08 10:23:09,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 10:23:09,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:09,548 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:09,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-08 10:23:09,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:09,751 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:09,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1332385442, now seen corresponding path program 1 times [2024-11-08 10:23:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:09,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595799011] [2024-11-08 10:23:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:09,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:09,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:09,753 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:09,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-08 10:23:09,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 10:23:09,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:09,815 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:23:09,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:09,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:09,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595799011] [2024-11-08 10:23:09,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595799011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:09,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:09,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 10:23:09,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695426289] [2024-11-08 10:23:09,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:09,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 10:23:09,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:09,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 10:23:09,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:09,817 INFO L87 Difference]: Start difference. First operand 226 states and 287 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:09,836 INFO L93 Difference]: Finished difference Result 235 states and 295 transitions. [2024-11-08 10:23:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 10:23:09,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-08 10:23:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:09,838 INFO L225 Difference]: With dead ends: 235 [2024-11-08 10:23:09,838 INFO L226 Difference]: Without dead ends: 194 [2024-11-08 10:23:09,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:09,839 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:09,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:09,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-08 10:23:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2024-11-08 10:23:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 158 states have (on average 1.2278481012658229) internal successors, (194), 164 states have internal predecessors, (194), 19 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2024-11-08 10:23:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 232 transitions. [2024-11-08 10:23:09,848 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 232 transitions. Word has length 52 [2024-11-08 10:23:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:09,849 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 232 transitions. [2024-11-08 10:23:09,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2024-11-08 10:23:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 10:23:09,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:09,850 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:09,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-08 10:23:10,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:10,051 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:10,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:10,051 INFO L85 PathProgramCache]: Analyzing trace with hash -444512686, now seen corresponding path program 1 times [2024-11-08 10:23:10,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:10,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004019096] [2024-11-08 10:23:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:10,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:10,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:10,053 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:10,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-08 10:23:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 10:23:10,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:23:10,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:10,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:10,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004019096] [2024-11-08 10:23:10,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004019096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:10,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:10,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:23:10,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523885215] [2024-11-08 10:23:10,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:10,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:23:10,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:10,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:23:10,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:10,147 INFO L87 Difference]: Start difference. First operand 184 states and 232 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:10,299 INFO L93 Difference]: Finished difference Result 235 states and 300 transitions. [2024-11-08 10:23:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:10,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-11-08 10:23:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:10,301 INFO L225 Difference]: With dead ends: 235 [2024-11-08 10:23:10,301 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 10:23:10,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:10,302 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 20 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:10,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 459 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 10:23:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 158. [2024-11-08 10:23:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 132 states have (on average 1.25) internal successors, (165), 138 states have internal predecessors, (165), 20 states have call successors, (20), 4 states have call predecessors, (20), 5 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 10:23:10,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 203 transitions. [2024-11-08 10:23:10,312 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 203 transitions. Word has length 52 [2024-11-08 10:23:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:10,313 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 203 transitions. [2024-11-08 10:23:10,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:10,313 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 203 transitions. [2024-11-08 10:23:10,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 10:23:10,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:10,314 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:10,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-08 10:23:10,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:10,515 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:10,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash 147478644, now seen corresponding path program 1 times [2024-11-08 10:23:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:10,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902614616] [2024-11-08 10:23:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:10,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:10,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:10,519 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:10,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-08 10:23:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 10:23:10,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:10,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:10,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:10,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:10,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902614616] [2024-11-08 10:23:10,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902614616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:10,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:10,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 10:23:10,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798349647] [2024-11-08 10:23:10,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:10,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:23:10,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:10,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:23:10,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:23:10,787 INFO L87 Difference]: Start difference. First operand 158 states and 203 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:14,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 10:23:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:14,979 INFO L93 Difference]: Finished difference Result 176 states and 223 transitions. [2024-11-08 10:23:14,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:23:14,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-08 10:23:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:14,981 INFO L225 Difference]: With dead ends: 176 [2024-11-08 10:23:14,981 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 10:23:14,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 10:23:14,982 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 8 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:14,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 489 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 10:23:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 10:23:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 165. [2024-11-08 10:23:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 144 states have internal predecessors, (168), 23 states have call successors, (23), 5 states have call predecessors, (23), 6 states have return successors, (21), 16 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 10:23:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 212 transitions. [2024-11-08 10:23:14,994 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 212 transitions. Word has length 54 [2024-11-08 10:23:14,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:14,994 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 212 transitions. [2024-11-08 10:23:14,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 212 transitions. [2024-11-08 10:23:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 10:23:14,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:14,996 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:15,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:15,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:15,196 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:15,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash -36563148, now seen corresponding path program 1 times [2024-11-08 10:23:15,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:15,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831158597] [2024-11-08 10:23:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:15,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:15,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:15,199 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:15,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-08 10:23:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:15,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 10:23:15,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:30,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:30,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:30,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831158597] [2024-11-08 10:23:30,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831158597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:30,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:30,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 10:23:30,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727469941] [2024-11-08 10:23:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:30,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:23:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:30,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:23:30,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=36, Unknown=4, NotChecked=0, Total=56 [2024-11-08 10:23:30,123 INFO L87 Difference]: Start difference. First operand 165 states and 212 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:34,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 10:23:41,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 10:23:45,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 10:23:49,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 10:23:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:49,562 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2024-11-08 10:23:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 10:23:49,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-11-08 10:23:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:49,564 INFO L225 Difference]: With dead ends: 180 [2024-11-08 10:23:49,564 INFO L226 Difference]: Without dead ends: 178 [2024-11-08 10:23:49,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=38, Invalid=89, Unknown=5, NotChecked=0, Total=132 [2024-11-08 10:23:49,565 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 13 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:49,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 492 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 4 Unknown, 0 Unchecked, 15.2s Time] [2024-11-08 10:23:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-08 10:23:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 162. [2024-11-08 10:23:49,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 141 states have internal predecessors, (168), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 10:23:49,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 206 transitions. [2024-11-08 10:23:49,577 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 206 transitions. Word has length 55 [2024-11-08 10:23:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:49,578 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 206 transitions. [2024-11-08 10:23:49,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 206 transitions. [2024-11-08 10:23:49,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 10:23:49,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:49,579 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:49,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:49,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:49,780 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:49,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2067393215, now seen corresponding path program 1 times [2024-11-08 10:23:49,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:49,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024887856] [2024-11-08 10:23:49,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:49,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:49,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:49,784 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:49,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-08 10:23:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:49,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 10:23:49,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:50,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:50,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:50,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024887856] [2024-11-08 10:23:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024887856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:50,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:50,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 10:23:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576512138] [2024-11-08 10:23:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:50,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 10:23:50,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:50,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 10:23:50,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-08 10:23:50,620 INFO L87 Difference]: Start difference. First operand 162 states and 206 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:51,458 INFO L93 Difference]: Finished difference Result 202 states and 255 transitions. [2024-11-08 10:23:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 10:23:51,459 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2024-11-08 10:23:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:51,460 INFO L225 Difference]: With dead ends: 202 [2024-11-08 10:23:51,460 INFO L226 Difference]: Without dead ends: 190 [2024-11-08 10:23:51,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:23:51,461 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 19 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:51,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 867 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:23:51,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-08 10:23:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 162. [2024-11-08 10:23:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 141 states have internal predecessors, (166), 20 states have call successors, (20), 5 states have call predecessors, (20), 6 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 10:23:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2024-11-08 10:23:51,473 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 58 [2024-11-08 10:23:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:51,474 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2024-11-08 10:23:51,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2024-11-08 10:23:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 10:23:51,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:51,475 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:51,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2024-11-08 10:23:51,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:51,676 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:51,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:51,676 INFO L85 PathProgramCache]: Analyzing trace with hash 589240327, now seen corresponding path program 1 times [2024-11-08 10:23:51,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:51,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553178913] [2024-11-08 10:23:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:51,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:51,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:51,678 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:51,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-08 10:23:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:51,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 10:23:51,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:51,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:51,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:51,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553178913] [2024-11-08 10:23:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553178913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:51,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:23:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554441305] [2024-11-08 10:23:51,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:51,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:23:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:23:51,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:51,769 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:51,841 INFO L93 Difference]: Finished difference Result 181 states and 224 transitions. [2024-11-08 10:23:51,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:51,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2024-11-08 10:23:51,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:51,842 INFO L225 Difference]: With dead ends: 181 [2024-11-08 10:23:51,843 INFO L226 Difference]: Without dead ends: 179 [2024-11-08 10:23:51,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:51,844 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 20 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:51,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 514 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-08 10:23:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 166. [2024-11-08 10:23:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 144 states have internal predecessors, (169), 20 states have call successors, (20), 6 states have call predecessors, (20), 7 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-08 10:23:51,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 207 transitions. [2024-11-08 10:23:51,865 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 207 transitions. Word has length 60 [2024-11-08 10:23:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:51,865 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 207 transitions. [2024-11-08 10:23:51,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:51,866 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 207 transitions. [2024-11-08 10:23:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 10:23:51,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:51,867 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:51,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-08 10:23:52,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:52,068 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:52,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1364362596, now seen corresponding path program 1 times [2024-11-08 10:23:52,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:52,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6324109] [2024-11-08 10:23:52,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:52,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:52,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:52,072 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:52,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-08 10:23:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:52,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 10:23:52,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:52,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:52,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:52,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6324109] [2024-11-08 10:23:52,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6324109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:52,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:52,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 10:23:52,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23638947] [2024-11-08 10:23:52,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:52,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 10:23:52,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:52,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 10:23:52,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:23:52,848 INFO L87 Difference]: Start difference. First operand 166 states and 207 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:54,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:54,440 INFO L93 Difference]: Finished difference Result 270 states and 344 transitions. [2024-11-08 10:23:54,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 10:23:54,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2024-11-08 10:23:54,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:54,442 INFO L225 Difference]: With dead ends: 270 [2024-11-08 10:23:54,442 INFO L226 Difference]: Without dead ends: 241 [2024-11-08 10:23:54,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-08 10:23:54,443 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 35 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:54,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 783 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 10:23:54,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-08 10:23:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 187. [2024-11-08 10:23:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 156 states have (on average 1.2179487179487178) internal successors, (190), 163 states have internal predecessors, (190), 23 states have call successors, (23), 6 states have call predecessors, (23), 7 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 10:23:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 234 transitions. [2024-11-08 10:23:54,460 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 234 transitions. Word has length 60 [2024-11-08 10:23:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:54,460 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 234 transitions. [2024-11-08 10:23:54,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 234 transitions. [2024-11-08 10:23:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-08 10:23:54,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:54,462 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-11-08 10:23:54,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-08 10:23:54,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:54,665 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:54,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:54,665 INFO L85 PathProgramCache]: Analyzing trace with hash 865353347, now seen corresponding path program 1 times [2024-11-08 10:23:54,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:54,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849121836] [2024-11-08 10:23:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:54,666 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:54,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:54,667 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:54,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-08 10:23:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:54,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 10:23:54,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:54,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:54,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:54,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849121836] [2024-11-08 10:23:54,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849121836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:54,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:54,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:23:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32410391] [2024-11-08 10:23:54,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:54,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:23:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:54,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:23:54,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:54,790 INFO L87 Difference]: Start difference. First operand 187 states and 234 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:54,871 INFO L93 Difference]: Finished difference Result 209 states and 260 transitions. [2024-11-08 10:23:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:54,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2024-11-08 10:23:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:54,873 INFO L225 Difference]: With dead ends: 209 [2024-11-08 10:23:54,873 INFO L226 Difference]: Without dead ends: 207 [2024-11-08 10:23:54,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:54,874 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 17 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:54,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 513 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-08 10:23:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 192. [2024-11-08 10:23:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 159 states have (on average 1.2138364779874213) internal successors, (193), 167 states have internal predecessors, (193), 24 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 10:23:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 239 transitions. [2024-11-08 10:23:54,889 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 239 transitions. Word has length 60 [2024-11-08 10:23:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:54,889 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 239 transitions. [2024-11-08 10:23:54,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 10:23:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 239 transitions. [2024-11-08 10:23:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 10:23:54,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:54,890 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-08 10:23:54,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:55,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:55,091 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:55,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash 921322142, now seen corresponding path program 1 times [2024-11-08 10:23:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:55,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637174285] [2024-11-08 10:23:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:55,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:55,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:55,094 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:55,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-08 10:23:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:55,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 10:23:55,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-08 10:23:56,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:56,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:56,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637174285] [2024-11-08 10:23:56,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637174285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:56,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:56,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 10:23:56,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929511020] [2024-11-08 10:23:56,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:56,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 10:23:56,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:56,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 10:23:56,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-08 10:23:56,425 INFO L87 Difference]: Start difference. First operand 192 states and 239 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:23:58,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:58,755 INFO L93 Difference]: Finished difference Result 279 states and 350 transitions. [2024-11-08 10:23:58,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 10:23:58,756 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 65 [2024-11-08 10:23:58,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:58,757 INFO L225 Difference]: With dead ends: 279 [2024-11-08 10:23:58,757 INFO L226 Difference]: Without dead ends: 253 [2024-11-08 10:23:58,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:23:58,758 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 30 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:58,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 910 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 10:23:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-08 10:23:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 211. [2024-11-08 10:23:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 175 states have (on average 1.217142857142857) internal successors, (213), 182 states have internal predecessors, (213), 27 states have call successors, (27), 7 states have call predecessors, (27), 8 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 10:23:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 265 transitions. [2024-11-08 10:23:58,776 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 265 transitions. Word has length 65 [2024-11-08 10:23:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:58,776 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 265 transitions. [2024-11-08 10:23:58,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:23:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 265 transitions. [2024-11-08 10:23:58,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 10:23:58,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:58,778 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-08 10:23:58,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-11-08 10:23:58,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:58,979 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:58,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:58,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1450417120, now seen corresponding path program 1 times [2024-11-08 10:23:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:58,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280303] [2024-11-08 10:23:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:58,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 10:23:58,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:58,981 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 10:23:58,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-08 10:23:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:59,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 10:23:59,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-08 10:23:59,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:59,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:59,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280303] [2024-11-08 10:23:59,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:59,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:59,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 10:23:59,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576711664] [2024-11-08 10:23:59,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:59,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 10:23:59,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:59,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 10:23:59,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 10:23:59,517 INFO L87 Difference]: Start difference. First operand 211 states and 265 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)