./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:29:51,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:29:51,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:29:51,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:29:51,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:29:51,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:29:51,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:29:51,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:29:51,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:29:51,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:29:51,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:29:51,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:29:51,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:29:51,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:29:51,433 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:29:51,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:29:51,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:29:51,434 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:29:51,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:29:51,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:29:51,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:29:51,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:29:51,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:29:51,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:29:51,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:29:51,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:29:51,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:29:51,442 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:29:51,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:29:51,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:29:51,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:29:51,443 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:29:51,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:29:51,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:29:51,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:29:51,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:29:51,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:29:51,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:29:51,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:29:51,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:29:51,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:29:51,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:29:51,446 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-clean/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-clean/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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2024-10-10 22:29:51,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:29:51,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:29:51,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:29:51,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:29:51,755 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:29:51,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-10-10 22:29:53,208 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:29:53,416 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:29:53,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-10-10 22:29:53,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ac3bc5543/33920c2c53ed4a429e28e4ecf926c231/FLAGbccf9d69c [2024-10-10 22:29:53,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ac3bc5543/33920c2c53ed4a429e28e4ecf926c231 [2024-10-10 22:29:53,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:29:53,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:29:53,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:29:53,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:29:53,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:29:53,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66212c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53, skipping insertion in model container [2024-10-10 22:29:53,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:29:53,693 WARN L248 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_4-2a.c.cil.c[755,768] [2024-10-10 22:29:53,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:29:53,758 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:29:53,770 WARN L248 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_4-2a.c.cil.c[755,768] [2024-10-10 22:29:53,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:29:53,819 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:29:53,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53 WrapperNode [2024-10-10 22:29:53,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:29:53,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:29:53,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:29:53,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:29:53,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,866 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-10-10 22:29:53,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:29:53,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:29:53,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:29:53,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:29:53,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,895 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-10-10 22:29:53,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:29:53,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:29:53,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:29:53,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:29:53,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (1/1) ... [2024-10-10 22:29:53,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:29:53,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:53,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:29:53,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:29:54,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:29:54,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:29:54,023 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-10 22:29:54,023 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-10 22:29:54,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:29:54,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:29:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-10-10 22:29:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-10-10 22:29:54,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-10 22:29:54,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-10 22:29:54,127 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:29:54,129 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:29:54,498 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-10-10 22:29:54,498 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:29:54,530 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:29:54,534 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 22:29:54,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:54 BoogieIcfgContainer [2024-10-10 22:29:54,536 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:29:54,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:29:54,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:29:54,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:29:54,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:29:53" (1/3) ... [2024-10-10 22:29:54,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631422d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:29:54, skipping insertion in model container [2024-10-10 22:29:54,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:53" (2/3) ... [2024-10-10 22:29:54,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@631422d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:29:54, skipping insertion in model container [2024-10-10 22:29:54,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:54" (3/3) ... [2024-10-10 22:29:54,547 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2024-10-10 22:29:54,563 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:29:54,564 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:29:54,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:29:54,624 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;@58a413fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:29:54,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:29:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 60 states have (on average 1.55) internal successors, (93), 61 states have internal predecessors, (93), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-10 22:29:54,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 22:29:54,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:54,637 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:54,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:54,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash -609404855, now seen corresponding path program 1 times [2024-10-10 22:29:54,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:54,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143961631] [2024-10-10 22:29:54,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:55,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:55,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143961631] [2024-10-10 22:29:55,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143961631] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448919810] [2024-10-10 22:29:55,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:55,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:55,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:55,364 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:55,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:29:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-10 22:29:55,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:55,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:55,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448919810] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:55,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:55,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-10-10 22:29:55,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109952964] [2024-10-10 22:29:55,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:55,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-10 22:29:55,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:55,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-10 22:29:55,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:29:55,782 INFO L87 Difference]: Start difference. First operand has 73 states, 60 states have (on average 1.55) internal successors, (93), 61 states have internal predecessors, (93), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:29:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:56,104 INFO L93 Difference]: Finished difference Result 164 states and 258 transitions. [2024-10-10 22:29:56,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:29:56,107 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2024-10-10 22:29:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:56,119 INFO L225 Difference]: With dead ends: 164 [2024-10-10 22:29:56,119 INFO L226 Difference]: Without dead ends: 90 [2024-10-10 22:29:56,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:29:56,125 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 28 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:56,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 987 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:29:56,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-10 22:29:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2024-10-10 22:29:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 66 states have (on average 1.393939393939394) internal successors, (92), 68 states have internal predecessors, (92), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2024-10-10 22:29:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2024-10-10 22:29:56,171 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 31 [2024-10-10 22:29:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:56,172 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2024-10-10 22:29:56,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:29:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2024-10-10 22:29:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:29:56,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:56,176 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:56,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:29:56,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-10 22:29:56,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:56,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:56,382 INFO L85 PathProgramCache]: Analyzing trace with hash 918415096, now seen corresponding path program 1 times [2024-10-10 22:29:56,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:56,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649303526] [2024-10-10 22:29:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:29:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:56,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:56,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649303526] [2024-10-10 22:29:56,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649303526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:56,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:56,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-10 22:29:56,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73082964] [2024-10-10 22:29:56,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:56,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 22:29:56,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:56,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 22:29:56,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:29:56,609 INFO L87 Difference]: Start difference. First operand 82 states and 115 transitions. Second operand has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:56,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:56,698 INFO L93 Difference]: Finished difference Result 150 states and 205 transitions. [2024-10-10 22:29:56,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:29:56,699 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-10 22:29:56,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:56,703 INFO L225 Difference]: With dead ends: 150 [2024-10-10 22:29:56,703 INFO L226 Difference]: Without dead ends: 103 [2024-10-10 22:29:56,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:29:56,705 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 12 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:56,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 630 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-10 22:29:56,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2024-10-10 22:29:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 73 states have internal predecessors, (97), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-10 22:29:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2024-10-10 22:29:56,729 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 35 [2024-10-10 22:29:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:56,729 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2024-10-10 22:29:56,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2024-10-10 22:29:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:29:56,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:56,733 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] [2024-10-10 22:29:56,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:29:56,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:56,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:56,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1414477667, now seen corresponding path program 1 times [2024-10-10 22:29:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:56,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15098288] [2024-10-10 22:29:56,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:56,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:29:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-10 22:29:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:29:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:57,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15098288] [2024-10-10 22:29:57,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15098288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:57,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:57,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-10 22:29:57,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774277828] [2024-10-10 22:29:57,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:57,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:29:57,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:57,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:29:57,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:29:57,073 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:29:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:57,203 INFO L93 Difference]: Finished difference Result 148 states and 205 transitions. [2024-10-10 22:29:57,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:29:57,205 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-10-10 22:29:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:57,208 INFO L225 Difference]: With dead ends: 148 [2024-10-10 22:29:57,208 INFO L226 Difference]: Without dead ends: 137 [2024-10-10 22:29:57,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:29:57,212 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 55 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:57,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 744 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:57,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-10 22:29:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2024-10-10 22:29:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 102 states have internal predecessors, (136), 15 states have call successors, (15), 5 states have call predecessors, (15), 7 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-10-10 22:29:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 171 transitions. [2024-10-10 22:29:57,236 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 171 transitions. Word has length 38 [2024-10-10 22:29:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:57,237 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 171 transitions. [2024-10-10 22:29:57,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:29:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 171 transitions. [2024-10-10 22:29:57,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:29:57,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:57,245 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] [2024-10-10 22:29:57,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:29:57,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:57,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:57,246 INFO L85 PathProgramCache]: Analyzing trace with hash -714825895, now seen corresponding path program 1 times [2024-10-10 22:29:57,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:57,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5886240] [2024-10-10 22:29:57,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:57,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:29:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:57,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5886240] [2024-10-10 22:29:57,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5886240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:57,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:57,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-10 22:29:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46413455] [2024-10-10 22:29:57,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:57,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:29:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:57,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:29:57,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:29:57,467 INFO L87 Difference]: Start difference. First operand 122 states and 171 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:29:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:57,590 INFO L93 Difference]: Finished difference Result 204 states and 284 transitions. [2024-10-10 22:29:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:29:57,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-10-10 22:29:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:57,593 INFO L225 Difference]: With dead ends: 204 [2024-10-10 22:29:57,593 INFO L226 Difference]: Without dead ends: 165 [2024-10-10 22:29:57,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:29:57,597 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 83 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:57,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 717 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-10 22:29:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 129. [2024-10-10 22:29:57,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 107 states have internal predecessors, (142), 16 states have call successors, (16), 6 states have call predecessors, (16), 8 states have return successors, (20), 15 states have call predecessors, (20), 15 states have call successors, (20) [2024-10-10 22:29:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2024-10-10 22:29:57,623 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 178 transitions. Word has length 38 [2024-10-10 22:29:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:57,624 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 178 transitions. [2024-10-10 22:29:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:29:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 178 transitions. [2024-10-10 22:29:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:29:57,628 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:57,629 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] [2024-10-10 22:29:57,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:29:57,629 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:57,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:57,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1807504677, now seen corresponding path program 1 times [2024-10-10 22:29:57,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:57,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245928030] [2024-10-10 22:29:57,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:57,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:29:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-10 22:29:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:29:58,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245928030] [2024-10-10 22:29:58,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245928030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:58,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-10 22:29:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301104065] [2024-10-10 22:29:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:58,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-10 22:29:58,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-10 22:29:58,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-10 22:29:58,086 INFO L87 Difference]: Start difference. First operand 129 states and 178 transitions. Second operand has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-10 22:29:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:58,372 INFO L93 Difference]: Finished difference Result 188 states and 261 transitions. [2024-10-10 22:29:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-10 22:29:58,373 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2024-10-10 22:29:58,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:58,376 INFO L225 Difference]: With dead ends: 188 [2024-10-10 22:29:58,377 INFO L226 Difference]: Without dead ends: 180 [2024-10-10 22:29:58,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:29:58,378 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:58,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1059 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:29:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-10 22:29:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 136. [2024-10-10 22:29:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 112 states have internal predecessors, (149), 16 states have call successors, (16), 6 states have call predecessors, (16), 9 states have return successors, (22), 17 states have call predecessors, (22), 15 states have call successors, (22) [2024-10-10 22:29:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 187 transitions. [2024-10-10 22:29:58,404 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 187 transitions. Word has length 38 [2024-10-10 22:29:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:58,406 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 187 transitions. [2024-10-10 22:29:58,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-10 22:29:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 187 transitions. [2024-10-10 22:29:58,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:29:58,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:58,408 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-10-10 22:29:58,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:29:58,409 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:58,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1107852905, now seen corresponding path program 1 times [2024-10-10 22:29:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:58,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025812795] [2024-10-10 22:29:58,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:58,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:29:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:58,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025812795] [2024-10-10 22:29:58,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025812795] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385305179] [2024-10-10 22:29:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:58,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:58,581 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:58,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:29:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-10 22:29:58,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:58,690 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:58,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:58,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385305179] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:58,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:58,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-10 22:29:58,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272929095] [2024-10-10 22:29:58,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:58,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 22:29:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:58,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 22:29:58,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:29:58,836 INFO L87 Difference]: Start difference. First operand 136 states and 187 transitions. Second operand has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:29:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:58,928 INFO L93 Difference]: Finished difference Result 229 states and 309 transitions. [2024-10-10 22:29:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:29:58,929 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 38 [2024-10-10 22:29:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:58,930 INFO L225 Difference]: With dead ends: 229 [2024-10-10 22:29:58,930 INFO L226 Difference]: Without dead ends: 151 [2024-10-10 22:29:58,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-10 22:29:58,931 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:58,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 922 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:58,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-10 22:29:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 142. [2024-10-10 22:29:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 116 states have internal predecessors, (153), 17 states have call successors, (17), 8 states have call predecessors, (17), 9 states have return successors, (20), 17 states have call predecessors, (20), 16 states have call successors, (20) [2024-10-10 22:29:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 190 transitions. [2024-10-10 22:29:58,949 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 190 transitions. Word has length 38 [2024-10-10 22:29:58,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:58,950 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 190 transitions. [2024-10-10 22:29:58,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 10 states have internal predecessors, (32), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:29:58,950 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 190 transitions. [2024-10-10 22:29:58,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:29:58,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:58,953 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] [2024-10-10 22:29:58,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 22:29:59,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:59,158 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:59,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash 404699807, now seen corresponding path program 1 times [2024-10-10 22:29:59,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:59,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244912760] [2024-10-10 22:29:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:59,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-10 22:29:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-10 22:29:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:29:59,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:59,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244912760] [2024-10-10 22:29:59,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244912760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:59,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:59,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:29:59,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598878483] [2024-10-10 22:29:59,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:59,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:29:59,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:59,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:29:59,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:29:59,249 INFO L87 Difference]: Start difference. First operand 142 states and 190 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-10 22:29:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:59,288 INFO L93 Difference]: Finished difference Result 150 states and 197 transitions. [2024-10-10 22:29:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:29:59,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2024-10-10 22:29:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:59,291 INFO L225 Difference]: With dead ends: 150 [2024-10-10 22:29:59,291 INFO L226 Difference]: Without dead ends: 130 [2024-10-10 22:29:59,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-10-10 22:29:59,292 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 3 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:59,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 459 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-10 22:29:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-10 22:29:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.349056603773585) internal successors, (143), 108 states have internal predecessors, (143), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2024-10-10 22:29:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 175 transitions. [2024-10-10 22:29:59,306 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 175 transitions. Word has length 40 [2024-10-10 22:29:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:59,306 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 175 transitions. [2024-10-10 22:29:59,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-10 22:29:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 175 transitions. [2024-10-10 22:29:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 22:29:59,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:59,308 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:59,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:29:59,308 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:59,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:59,309 INFO L85 PathProgramCache]: Analyzing trace with hash -95517081, now seen corresponding path program 2 times [2024-10-10 22:29:59,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:59,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169802936] [2024-10-10 22:29:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:59,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:29:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,457 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:59,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:59,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169802936] [2024-10-10 22:29:59,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169802936] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:59,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770840674] [2024-10-10 22:29:59,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:29:59,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:59,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:59,460 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:59,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:29:59,512 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-10 22:29:59,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:29:59,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-10 22:29:59,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:59,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:59,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770840674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:59,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:59,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2024-10-10 22:29:59,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223441794] [2024-10-10 22:29:59,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:59,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:29:59,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:59,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:29:59,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:29:59,653 INFO L87 Difference]: Start difference. First operand 130 states and 175 transitions. Second operand has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:59,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:59,926 INFO L93 Difference]: Finished difference Result 264 states and 358 transitions. [2024-10-10 22:29:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:29:59,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-10-10 22:29:59,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:59,928 INFO L225 Difference]: With dead ends: 264 [2024-10-10 22:29:59,928 INFO L226 Difference]: Without dead ends: 210 [2024-10-10 22:29:59,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:29:59,929 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 100 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:59,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1249 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:29:59,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-10 22:29:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2024-10-10 22:29:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 143 states have (on average 1.3426573426573427) internal successors, (192), 146 states have internal predecessors, (192), 19 states have call successors, (19), 9 states have call predecessors, (19), 11 states have return successors, (25), 18 states have call predecessors, (25), 18 states have call successors, (25) [2024-10-10 22:29:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 236 transitions. [2024-10-10 22:29:59,939 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 236 transitions. Word has length 39 [2024-10-10 22:29:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:59,940 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 236 transitions. [2024-10-10 22:29:59,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 236 transitions. [2024-10-10 22:29:59,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 22:29:59,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:59,941 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:29:59,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:00,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:00,146 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:00,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:00,146 INFO L85 PathProgramCache]: Analyzing trace with hash -488544091, now seen corresponding path program 1 times [2024-10-10 22:30:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:00,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986595740] [2024-10-10 22:30:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:00,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:00,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986595740] [2024-10-10 22:30:00,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986595740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:00,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:00,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-10 22:30:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854192502] [2024-10-10 22:30:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:00,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-10 22:30:00,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:00,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-10 22:30:00,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:30:00,605 INFO L87 Difference]: Start difference. First operand 174 states and 236 transitions. Second operand has 12 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:00,851 INFO L93 Difference]: Finished difference Result 189 states and 253 transitions. [2024-10-10 22:30:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-10 22:30:00,851 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-10-10 22:30:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:00,853 INFO L225 Difference]: With dead ends: 189 [2024-10-10 22:30:00,853 INFO L226 Difference]: Without dead ends: 187 [2024-10-10 22:30:00,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:30:00,854 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 60 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:00,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1274 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:30:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-10 22:30:00,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 178. [2024-10-10 22:30:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 146 states have (on average 1.3356164383561644) internal successors, (195), 149 states have internal predecessors, (195), 19 states have call successors, (19), 10 states have call predecessors, (19), 12 states have return successors, (25), 18 states have call predecessors, (25), 18 states have call successors, (25) [2024-10-10 22:30:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 239 transitions. [2024-10-10 22:30:00,870 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 239 transitions. Word has length 39 [2024-10-10 22:30:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:00,871 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 239 transitions. [2024-10-10 22:30:00,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 239 transitions. [2024-10-10 22:30:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:30:00,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:00,873 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:00,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:30:00,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:00,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash -109607670, now seen corresponding path program 1 times [2024-10-10 22:30:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160641769] [2024-10-10 22:30:00,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:00,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:30:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 22:30:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-10 22:30:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:01,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160641769] [2024-10-10 22:30:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160641769] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133909139] [2024-10-10 22:30:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:01,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:01,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:01,103 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:01,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:30:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-10 22:30:01,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:01,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:01,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133909139] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:01,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:01,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-10-10 22:30:01,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137130925] [2024-10-10 22:30:01,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:01,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-10 22:30:01,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:01,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-10 22:30:01,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-10-10 22:30:01,800 INFO L87 Difference]: Start difference. First operand 178 states and 239 transitions. Second operand has 32 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-10 22:30:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:03,467 INFO L93 Difference]: Finished difference Result 377 states and 539 transitions. [2024-10-10 22:30:03,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-10 22:30:03,469 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2024-10-10 22:30:03,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:03,471 INFO L225 Difference]: With dead ends: 377 [2024-10-10 22:30:03,471 INFO L226 Difference]: Without dead ends: 353 [2024-10-10 22:30:03,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2024-10-10 22:30:03,476 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 311 mSDsluCounter, 3815 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 4010 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:03,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 4010 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:30:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-10 22:30:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 219. [2024-10-10 22:30:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 179 states have (on average 1.318435754189944) internal successors, (236), 186 states have internal predecessors, (236), 23 states have call successors, (23), 9 states have call predecessors, (23), 16 states have return successors, (40), 23 states have call predecessors, (40), 22 states have call successors, (40) [2024-10-10 22:30:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 299 transitions. [2024-10-10 22:30:03,504 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 299 transitions. Word has length 42 [2024-10-10 22:30:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:03,504 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 299 transitions. [2024-10-10 22:30:03,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 25 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-10 22:30:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 299 transitions. [2024-10-10 22:30:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:30:03,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:03,506 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:03,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:30:03,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 22:30:03,711 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:03,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash -837941490, now seen corresponding path program 2 times [2024-10-10 22:30:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:03,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267213600] [2024-10-10 22:30:03,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 22:30:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-10 22:30:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:03,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:03,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267213600] [2024-10-10 22:30:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267213600] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51774149] [2024-10-10 22:30:03,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:03,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:03,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:03,952 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:03,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:30:04,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:30:04,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:04,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-10 22:30:04,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:04,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51774149] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:04,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:04,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-10-10 22:30:04,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184031939] [2024-10-10 22:30:04,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:04,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-10 22:30:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:04,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-10 22:30:04,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-10-10 22:30:04,606 INFO L87 Difference]: Start difference. First operand 219 states and 299 transitions. Second operand has 32 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-10 22:30:06,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:06,033 INFO L93 Difference]: Finished difference Result 429 states and 651 transitions. [2024-10-10 22:30:06,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-10 22:30:06,034 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 42 [2024-10-10 22:30:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:06,036 INFO L225 Difference]: With dead ends: 429 [2024-10-10 22:30:06,036 INFO L226 Difference]: Without dead ends: 414 [2024-10-10 22:30:06,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=295, Invalid=3245, Unknown=0, NotChecked=0, Total=3540 [2024-10-10 22:30:06,038 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 405 mSDsluCounter, 3136 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 3286 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:06,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 3286 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:30:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-10 22:30:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 239. [2024-10-10 22:30:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 190 states have (on average 1.3) internal successors, (247), 199 states have internal predecessors, (247), 29 states have call successors, (29), 10 states have call predecessors, (29), 19 states have return successors, (64), 29 states have call predecessors, (64), 28 states have call successors, (64) [2024-10-10 22:30:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 340 transitions. [2024-10-10 22:30:06,063 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 340 transitions. Word has length 42 [2024-10-10 22:30:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:06,063 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 340 transitions. [2024-10-10 22:30:06,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 1.8333333333333333) internal successors, (44), 25 states have internal predecessors, (44), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-10 22:30:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 340 transitions. [2024-10-10 22:30:06,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 22:30:06,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:06,065 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:06,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:06,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-10 22:30:06,270 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:06,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:06,270 INFO L85 PathProgramCache]: Analyzing trace with hash 347926418, now seen corresponding path program 1 times [2024-10-10 22:30:06,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:06,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236804914] [2024-10-10 22:30:06,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:06,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:06,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:06,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:06,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 22:30:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-10 22:30:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:06,389 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:06,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:06,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236804914] [2024-10-10 22:30:06,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236804914] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:06,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519268673] [2024-10-10 22:30:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:06,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:06,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:06,392 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:06,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:30:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:06,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-10 22:30:06,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:06,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:06,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519268673] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:06,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 21 [2024-10-10 22:30:06,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979688031] [2024-10-10 22:30:06,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:06,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-10 22:30:06,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:06,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-10 22:30:06,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-10-10 22:30:06,833 INFO L87 Difference]: Start difference. First operand 239 states and 340 transitions. Second operand has 21 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-10 22:30:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:07,327 INFO L93 Difference]: Finished difference Result 450 states and 673 transitions. [2024-10-10 22:30:07,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-10 22:30:07,328 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 44 [2024-10-10 22:30:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:07,331 INFO L225 Difference]: With dead ends: 450 [2024-10-10 22:30:07,331 INFO L226 Difference]: Without dead ends: 427 [2024-10-10 22:30:07,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2024-10-10 22:30:07,332 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 115 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:07,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 2143 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:30:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-10 22:30:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 247. [2024-10-10 22:30:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 194 states have (on average 1.2835051546391754) internal successors, (249), 204 states have internal predecessors, (249), 32 states have call successors, (32), 10 states have call predecessors, (32), 20 states have return successors, (81), 32 states have call predecessors, (81), 31 states have call successors, (81) [2024-10-10 22:30:07,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 362 transitions. [2024-10-10 22:30:07,356 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 362 transitions. Word has length 44 [2024-10-10 22:30:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:07,356 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 362 transitions. [2024-10-10 22:30:07,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-10 22:30:07,357 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 362 transitions. [2024-10-10 22:30:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-10 22:30:07,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:07,358 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:07,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:07,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 22:30:07,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:07,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:07,559 INFO L85 PathProgramCache]: Analyzing trace with hash -644490447, now seen corresponding path program 1 times [2024-10-10 22:30:07,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:07,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555272406] [2024-10-10 22:30:07,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:07,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:30:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-10 22:30:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-10 22:30:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:07,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:07,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555272406] [2024-10-10 22:30:07,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555272406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:07,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:07,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:07,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497502147] [2024-10-10 22:30:07,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:07,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:07,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:07,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:07,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:07,624 INFO L87 Difference]: Start difference. First operand 247 states and 362 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:30:07,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:07,675 INFO L93 Difference]: Finished difference Result 499 states and 737 transitions. [2024-10-10 22:30:07,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:07,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2024-10-10 22:30:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:07,679 INFO L225 Difference]: With dead ends: 499 [2024-10-10 22:30:07,680 INFO L226 Difference]: Without dead ends: 254 [2024-10-10 22:30:07,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-10-10 22:30:07,681 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 9 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:07,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 161 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-10 22:30:07,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2024-10-10 22:30:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 197 states have (on average 1.284263959390863) internal successors, (253), 207 states have internal predecessors, (253), 32 states have call successors, (32), 10 states have call predecessors, (32), 20 states have return successors, (81), 32 states have call predecessors, (81), 31 states have call successors, (81) [2024-10-10 22:30:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 366 transitions. [2024-10-10 22:30:07,700 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 366 transitions. Word has length 47 [2024-10-10 22:30:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:07,701 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 366 transitions. [2024-10-10 22:30:07,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:30:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 366 transitions. [2024-10-10 22:30:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-10 22:30:07,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:07,702 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:07,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:30:07,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:07,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:07,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1492626201, now seen corresponding path program 1 times [2024-10-10 22:30:07,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:07,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608635087] [2024-10-10 22:30:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:07,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:30:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-10 22:30:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-10 22:30:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:07,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608635087] [2024-10-10 22:30:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608635087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:07,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:07,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:30:07,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501081866] [2024-10-10 22:30:07,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:07,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:07,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:07,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:07,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:30:07,761 INFO L87 Difference]: Start difference. First operand 250 states and 366 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:30:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:07,812 INFO L93 Difference]: Finished difference Result 503 states and 741 transitions. [2024-10-10 22:30:07,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:07,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-10-10 22:30:07,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:07,814 INFO L225 Difference]: With dead ends: 503 [2024-10-10 22:30:07,815 INFO L226 Difference]: Without dead ends: 255 [2024-10-10 22:30:07,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-10-10 22:30:07,816 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:07,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-10 22:30:07,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2024-10-10 22:30:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 199 states have (on average 1.2814070351758795) internal successors, (255), 209 states have internal predecessors, (255), 32 states have call successors, (32), 10 states have call predecessors, (32), 20 states have return successors, (81), 32 states have call predecessors, (81), 31 states have call successors, (81) [2024-10-10 22:30:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2024-10-10 22:30:07,835 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 48 [2024-10-10 22:30:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:07,836 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2024-10-10 22:30:07,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:30:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2024-10-10 22:30:07,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-10 22:30:07,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:07,838 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:07,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:30:07,838 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:07,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash 831467203, now seen corresponding path program 1 times [2024-10-10 22:30:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:07,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61589802] [2024-10-10 22:30:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:07,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-10 22:30:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:07,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-10 22:30:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,003 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:08,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:08,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61589802] [2024-10-10 22:30:08,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61589802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:08,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642385870] [2024-10-10 22:30:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:08,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:08,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:08,006 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:08,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:30:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-10 22:30:08,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:08,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:08,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642385870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:08,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:08,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 13 [2024-10-10 22:30:08,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511517507] [2024-10-10 22:30:08,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:08,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:30:08,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:08,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:30:08,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:30:08,140 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-10 22:30:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:08,285 INFO L93 Difference]: Finished difference Result 382 states and 582 transitions. [2024-10-10 22:30:08,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:30:08,286 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 48 [2024-10-10 22:30:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:08,288 INFO L225 Difference]: With dead ends: 382 [2024-10-10 22:30:08,288 INFO L226 Difference]: Without dead ends: 304 [2024-10-10 22:30:08,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:30:08,289 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 54 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:08,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1208 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-10-10 22:30:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 286. [2024-10-10 22:30:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 225 states have (on average 1.3022222222222222) internal successors, (293), 239 states have internal predecessors, (293), 36 states have call successors, (36), 10 states have call predecessors, (36), 24 states have return successors, (107), 36 states have call predecessors, (107), 35 states have call successors, (107) [2024-10-10 22:30:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 436 transitions. [2024-10-10 22:30:08,322 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 436 transitions. Word has length 48 [2024-10-10 22:30:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:08,323 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 436 transitions. [2024-10-10 22:30:08,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-10-10 22:30:08,323 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 436 transitions. [2024-10-10 22:30:08,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 22:30:08,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:08,326 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:08,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:08,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:08,530 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:08,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:08,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1515726862, now seen corresponding path program 1 times [2024-10-10 22:30:08,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:08,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167904376] [2024-10-10 22:30:08,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:08,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:30:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-10 22:30:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-10 22:30:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:08,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:08,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167904376] [2024-10-10 22:30:08,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167904376] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:08,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945984073] [2024-10-10 22:30:08,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:08,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:08,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:08,779 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:08,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 22:30:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:08,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-10 22:30:08,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:08,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:09,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945984073] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:09,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:09,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-10-10 22:30:09,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903521146] [2024-10-10 22:30:09,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:09,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-10 22:30:09,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:09,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-10 22:30:09,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-10-10 22:30:09,173 INFO L87 Difference]: Start difference. First operand 286 states and 436 transitions. Second operand has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:09,711 INFO L93 Difference]: Finished difference Result 311 states and 470 transitions. [2024-10-10 22:30:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-10 22:30:09,712 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 49 [2024-10-10 22:30:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:09,714 INFO L225 Difference]: With dead ends: 311 [2024-10-10 22:30:09,714 INFO L226 Difference]: Without dead ends: 281 [2024-10-10 22:30:09,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-10-10 22:30:09,719 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 203 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:09,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1705 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:30:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-10 22:30:09,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 274. [2024-10-10 22:30:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 217 states have (on average 1.3133640552995391) internal successors, (285), 230 states have internal predecessors, (285), 34 states have call successors, (34), 8 states have call predecessors, (34), 22 states have return successors, (104), 35 states have call predecessors, (104), 33 states have call successors, (104) [2024-10-10 22:30:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 423 transitions. [2024-10-10 22:30:09,742 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 423 transitions. Word has length 49 [2024-10-10 22:30:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:09,743 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 423 transitions. [2024-10-10 22:30:09,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.526315789473684) internal successors, (48), 21 states have internal predecessors, (48), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 423 transitions. [2024-10-10 22:30:09,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 22:30:09,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:09,745 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:09,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-10 22:30:09,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 22:30:09,946 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:09,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1343954346, now seen corresponding path program 2 times [2024-10-10 22:30:09,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:09,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432036530] [2024-10-10 22:30:09,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:09,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 22:30:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-10 22:30:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-10 22:30:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432036530] [2024-10-10 22:30:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432036530] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699024803] [2024-10-10 22:30:10,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:10,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:10,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:10,183 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:10,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 22:30:10,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:30:10,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:10,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-10 22:30:10,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:10,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:10,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699024803] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:10,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:10,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2024-10-10 22:30:10,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883518912] [2024-10-10 22:30:10,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:10,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-10 22:30:10,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:10,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-10 22:30:10,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2024-10-10 22:30:10,832 INFO L87 Difference]: Start difference. First operand 274 states and 423 transitions. Second operand has 29 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 24 states have internal predecessors, (51), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-10 22:30:11,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:11,375 INFO L93 Difference]: Finished difference Result 301 states and 461 transitions. [2024-10-10 22:30:11,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-10 22:30:11,376 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 24 states have internal predecessors, (51), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) Word has length 49 [2024-10-10 22:30:11,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:11,378 INFO L225 Difference]: With dead ends: 301 [2024-10-10 22:30:11,378 INFO L226 Difference]: Without dead ends: 284 [2024-10-10 22:30:11,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2024-10-10 22:30:11,380 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 124 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:11,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 2173 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:30:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-10 22:30:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 273. [2024-10-10 22:30:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 215 states have (on average 1.3116279069767443) internal successors, (282), 229 states have internal predecessors, (282), 35 states have call successors, (35), 7 states have call predecessors, (35), 22 states have return successors, (103), 36 states have call predecessors, (103), 34 states have call successors, (103) [2024-10-10 22:30:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 420 transitions. [2024-10-10 22:30:11,399 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 420 transitions. Word has length 49 [2024-10-10 22:30:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:11,400 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 420 transitions. [2024-10-10 22:30:11,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 24 states have internal predecessors, (51), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-10 22:30:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 420 transitions. [2024-10-10 22:30:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-10 22:30:11,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:11,401 INFO L215 NwaCegarLoop]: trace histogram [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-10-10 22:30:11,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-10 22:30:11,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 22:30:11,606 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:11,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1282255435, now seen corresponding path program 1 times [2024-10-10 22:30:11,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:11,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205895604] [2024-10-10 22:30:11,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:11,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-10 22:30:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:11,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:11,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205895604] [2024-10-10 22:30:11,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205895604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:11,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:11,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:30:11,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188224737] [2024-10-10 22:30:11,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:11,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:30:11,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:11,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:30:11,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:30:11,687 INFO L87 Difference]: Start difference. First operand 273 states and 420 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-10 22:30:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:11,765 INFO L93 Difference]: Finished difference Result 309 states and 488 transitions. [2024-10-10 22:30:11,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:30:11,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2024-10-10 22:30:11,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:11,768 INFO L225 Difference]: With dead ends: 309 [2024-10-10 22:30:11,768 INFO L226 Difference]: Without dead ends: 307 [2024-10-10 22:30:11,768 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-10-10 22:30:11,769 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 10 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:11,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 334 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:11,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-10-10 22:30:11,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 292. [2024-10-10 22:30:11,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.337719298245614) internal successors, (305), 247 states have internal predecessors, (305), 40 states have call successors, (40), 8 states have call predecessors, (40), 23 states have return successors, (108), 36 states have call predecessors, (108), 39 states have call successors, (108) [2024-10-10 22:30:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 453 transitions. [2024-10-10 22:30:11,794 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 453 transitions. Word has length 51 [2024-10-10 22:30:11,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:11,795 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 453 transitions. [2024-10-10 22:30:11,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-10 22:30:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 453 transitions. [2024-10-10 22:30:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-10 22:30:11,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:11,798 INFO L215 NwaCegarLoop]: trace histogram [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-10-10 22:30:11,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 22:30:11,798 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:11,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:11,800 INFO L85 PathProgramCache]: Analyzing trace with hash 238170036, now seen corresponding path program 1 times [2024-10-10 22:30:11,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:11,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475437605] [2024-10-10 22:30:11,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:11,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-10 22:30:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:11,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475437605] [2024-10-10 22:30:11,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475437605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:11,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:11,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-10 22:30:11,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730843716] [2024-10-10 22:30:11,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:11,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:30:11,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:11,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:30:11,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:11,937 INFO L87 Difference]: Start difference. First operand 292 states and 453 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:12,111 INFO L93 Difference]: Finished difference Result 565 states and 969 transitions. [2024-10-10 22:30:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:30:12,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-10-10 22:30:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:12,114 INFO L225 Difference]: With dead ends: 565 [2024-10-10 22:30:12,115 INFO L226 Difference]: Without dead ends: 408 [2024-10-10 22:30:12,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:30:12,117 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 23 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:12,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 642 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:12,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-10 22:30:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 340. [2024-10-10 22:30:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 272 states have (on average 1.3125) internal successors, (357), 291 states have internal predecessors, (357), 44 states have call successors, (44), 8 states have call predecessors, (44), 23 states have return successors, (112), 40 states have call predecessors, (112), 43 states have call successors, (112) [2024-10-10 22:30:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 513 transitions. [2024-10-10 22:30:12,141 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 513 transitions. Word has length 52 [2024-10-10 22:30:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:12,142 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 513 transitions. [2024-10-10 22:30:12,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:12,142 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 513 transitions. [2024-10-10 22:30:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-10 22:30:12,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:12,143 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:12,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 22:30:12,144 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:12,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:12,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1449730966, now seen corresponding path program 1 times [2024-10-10 22:30:12,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:12,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781004277] [2024-10-10 22:30:12,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:12,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-10 22:30:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:12,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:12,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781004277] [2024-10-10 22:30:12,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781004277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:12,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:12,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:30:12,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306976675] [2024-10-10 22:30:12,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:12,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:12,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:12,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:12,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:12,248 INFO L87 Difference]: Start difference. First operand 340 states and 513 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-10 22:30:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:12,344 INFO L93 Difference]: Finished difference Result 386 states and 596 transitions. [2024-10-10 22:30:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2024-10-10 22:30:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:12,347 INFO L225 Difference]: With dead ends: 386 [2024-10-10 22:30:12,347 INFO L226 Difference]: Without dead ends: 384 [2024-10-10 22:30:12,347 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-10-10 22:30:12,348 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 10 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:12,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 435 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-10 22:30:12,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 345. [2024-10-10 22:30:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 277 states have (on average 1.3249097472924187) internal successors, (367), 296 states have internal predecessors, (367), 44 states have call successors, (44), 8 states have call predecessors, (44), 23 states have return successors, (112), 40 states have call predecessors, (112), 43 states have call successors, (112) [2024-10-10 22:30:12,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 523 transitions. [2024-10-10 22:30:12,374 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 523 transitions. Word has length 53 [2024-10-10 22:30:12,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:12,374 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 523 transitions. [2024-10-10 22:30:12,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-10 22:30:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 523 transitions. [2024-10-10 22:30:12,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-10 22:30:12,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:12,376 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:12,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 22:30:12,376 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:12,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1401480500, now seen corresponding path program 1 times [2024-10-10 22:30:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:12,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647353928] [2024-10-10 22:30:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:12,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-10 22:30:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:12,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647353928] [2024-10-10 22:30:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647353928] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:12,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330825112] [2024-10-10 22:30:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:12,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:12,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:12,555 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:12,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-10 22:30:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:30:12,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:12,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:12,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330825112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:12,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:12,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-10 22:30:12,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813809191] [2024-10-10 22:30:12,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:12,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:30:12,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:30:12,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:30:12,636 INFO L87 Difference]: Start difference. First operand 345 states and 523 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-10 22:30:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:12,663 INFO L93 Difference]: Finished difference Result 498 states and 759 transitions. [2024-10-10 22:30:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:30:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2024-10-10 22:30:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:12,667 INFO L225 Difference]: With dead ends: 498 [2024-10-10 22:30:12,667 INFO L226 Difference]: Without dead ends: 345 [2024-10-10 22:30:12,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 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-10-10 22:30:12,668 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:12,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-10 22:30:12,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2024-10-10 22:30:12,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 273 states have (on average 1.3113553113553114) internal successors, (358), 292 states have internal predecessors, (358), 44 states have call successors, (44), 8 states have call predecessors, (44), 23 states have return successors, (112), 40 states have call predecessors, (112), 43 states have call successors, (112) [2024-10-10 22:30:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 514 transitions. [2024-10-10 22:30:12,693 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 514 transitions. Word has length 53 [2024-10-10 22:30:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:12,693 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 514 transitions. [2024-10-10 22:30:12,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-10 22:30:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 514 transitions. [2024-10-10 22:30:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-10 22:30:12,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:12,695 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:12,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:12,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-10 22:30:12,896 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:12,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1915492850, now seen corresponding path program 1 times [2024-10-10 22:30:12,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:12,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022385040] [2024-10-10 22:30:12,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:12,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-10 22:30:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:13,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:13,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022385040] [2024-10-10 22:30:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022385040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103562996] [2024-10-10 22:30:13,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:13,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:13,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:13,054 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:13,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-10 22:30:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-10 22:30:13,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:13,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103562996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:13,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:13,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 16 [2024-10-10 22:30:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485651550] [2024-10-10 22:30:13,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:13,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-10 22:30:13,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:13,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-10 22:30:13,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:30:13,299 INFO L87 Difference]: Start difference. First operand 341 states and 514 transitions. Second operand has 13 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-10 22:30:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:13,531 INFO L93 Difference]: Finished difference Result 643 states and 923 transitions. [2024-10-10 22:30:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:30:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 54 [2024-10-10 22:30:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:13,536 INFO L225 Difference]: With dead ends: 643 [2024-10-10 22:30:13,536 INFO L226 Difference]: Without dead ends: 455 [2024-10-10 22:30:13,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-10-10 22:30:13,538 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 61 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:13,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1274 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-10-10 22:30:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 418. [2024-10-10 22:30:13,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 341 states have (on average 1.2961876832844574) internal successors, (442), 362 states have internal predecessors, (442), 50 states have call successors, (50), 10 states have call predecessors, (50), 26 states have return successors, (113), 45 states have call predecessors, (113), 49 states have call successors, (113) [2024-10-10 22:30:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 605 transitions. [2024-10-10 22:30:13,572 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 605 transitions. Word has length 54 [2024-10-10 22:30:13,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:13,572 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 605 transitions. [2024-10-10 22:30:13,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-10 22:30:13,572 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 605 transitions. [2024-10-10 22:30:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-10 22:30:13,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:13,574 INFO L215 NwaCegarLoop]: trace histogram [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-10-10 22:30:13,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-10 22:30:13,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-10 22:30:13,775 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:13,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:13,775 INFO L85 PathProgramCache]: Analyzing trace with hash -373078929, now seen corresponding path program 1 times [2024-10-10 22:30:13,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:13,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279017317] [2024-10-10 22:30:13,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:13,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-10 22:30:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:13,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:13,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279017317] [2024-10-10 22:30:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279017317] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:13,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967918174] [2024-10-10 22:30:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:13,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:13,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:13,930 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:13,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-10 22:30:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-10 22:30:13,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:30:14,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:14,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967918174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:14,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:14,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 14 [2024-10-10 22:30:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087283586] [2024-10-10 22:30:14,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:14,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:30:14,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:14,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:30:14,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:30:14,083 INFO L87 Difference]: Start difference. First operand 418 states and 605 transitions. Second operand has 11 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-10 22:30:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:14,238 INFO L93 Difference]: Finished difference Result 527 states and 751 transitions. [2024-10-10 22:30:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 22:30:14,238 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2024-10-10 22:30:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:14,241 INFO L225 Difference]: With dead ends: 527 [2024-10-10 22:30:14,241 INFO L226 Difference]: Without dead ends: 412 [2024-10-10 22:30:14,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:30:14,243 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 54 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:14,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1266 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-10 22:30:14,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 396. [2024-10-10 22:30:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 321 states have (on average 1.3021806853582554) internal successors, (418), 342 states have internal predecessors, (418), 48 states have call successors, (48), 10 states have call predecessors, (48), 26 states have return successors, (111), 43 states have call predecessors, (111), 47 states have call successors, (111) [2024-10-10 22:30:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 577 transitions. [2024-10-10 22:30:14,288 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 577 transitions. Word has length 55 [2024-10-10 22:30:14,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:14,288 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 577 transitions. [2024-10-10 22:30:14,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-10 22:30:14,289 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 577 transitions. [2024-10-10 22:30:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-10 22:30:14,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:14,291 INFO L215 NwaCegarLoop]: trace histogram [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-10-10 22:30:14,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:14,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:14,492 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:14,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1702809073, now seen corresponding path program 1 times [2024-10-10 22:30:14,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:14,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211776945] [2024-10-10 22:30:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:14,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-10 22:30:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:14,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:14,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211776945] [2024-10-10 22:30:14,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211776945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:14,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:14,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-10 22:30:14,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512834230] [2024-10-10 22:30:14,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:14,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:30:14,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:14,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:30:14,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:14,652 INFO L87 Difference]: Start difference. First operand 396 states and 577 transitions. Second operand has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:14,783 INFO L93 Difference]: Finished difference Result 633 states and 913 transitions. [2024-10-10 22:30:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:30:14,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2024-10-10 22:30:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:14,787 INFO L225 Difference]: With dead ends: 633 [2024-10-10 22:30:14,787 INFO L226 Difference]: Without dead ends: 398 [2024-10-10 22:30:14,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:30:14,788 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 57 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:14,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1051 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:14,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-10 22:30:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 385. [2024-10-10 22:30:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 311 states have (on average 1.2990353697749195) internal successors, (404), 332 states have internal predecessors, (404), 47 states have call successors, (47), 10 states have call predecessors, (47), 26 states have return successors, (110), 42 states have call predecessors, (110), 46 states have call successors, (110) [2024-10-10 22:30:14,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 561 transitions. [2024-10-10 22:30:14,815 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 561 transitions. Word has length 55 [2024-10-10 22:30:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:14,815 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 561 transitions. [2024-10-10 22:30:14,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:14,816 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 561 transitions. [2024-10-10 22:30:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-10 22:30:14,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:14,817 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:14,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-10 22:30:14,818 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:14,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:14,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1311289391, now seen corresponding path program 1 times [2024-10-10 22:30:14,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:14,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241280955] [2024-10-10 22:30:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:14,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-10 22:30:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-10 22:30:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241280955] [2024-10-10 22:30:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241280955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:14,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:14,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-10 22:30:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130098290] [2024-10-10 22:30:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:14,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:30:14,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:30:14,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:14,950 INFO L87 Difference]: Start difference. First operand 385 states and 561 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:30:15,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:15,027 INFO L93 Difference]: Finished difference Result 408 states and 582 transitions. [2024-10-10 22:30:15,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:30:15,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2024-10-10 22:30:15,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:15,030 INFO L225 Difference]: With dead ends: 408 [2024-10-10 22:30:15,030 INFO L226 Difference]: Without dead ends: 322 [2024-10-10 22:30:15,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:30:15,032 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:15,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 731 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-10 22:30:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-10-10 22:30:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 260 states have (on average 1.3038461538461539) internal successors, (339), 278 states have internal predecessors, (339), 39 states have call successors, (39), 8 states have call predecessors, (39), 22 states have return successors, (97), 35 states have call predecessors, (97), 38 states have call successors, (97) [2024-10-10 22:30:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 475 transitions. [2024-10-10 22:30:15,078 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 475 transitions. Word has length 57 [2024-10-10 22:30:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:15,079 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 475 transitions. [2024-10-10 22:30:15,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:30:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 475 transitions. [2024-10-10 22:30:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-10 22:30:15,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:15,081 INFO L215 NwaCegarLoop]: trace histogram [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-10-10 22:30:15,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-10 22:30:15,081 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:15,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:15,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1453204428, now seen corresponding path program 1 times [2024-10-10 22:30:15,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:15,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940701212] [2024-10-10 22:30:15,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:15,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:15,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 22:30:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:15,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-10 22:30:15,153 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 22:30:15,154 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:30:15,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-10 22:30:15,160 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:15,202 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:30:15,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:30:15 BoogieIcfgContainer [2024-10-10 22:30:15,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:30:15,206 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:30:15,206 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:30:15,206 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:30:15,207 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:54" (3/4) ... [2024-10-10 22:30:15,209 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-10 22:30:15,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:30:15,210 INFO L158 Benchmark]: Toolchain (without parser) took 21765.69ms. Allocated memory was 123.7MB in the beginning and 314.6MB in the end (delta: 190.8MB). Free memory was 57.5MB in the beginning and 249.5MB in the end (delta: -192.0MB). Peak memory consumption was 725.2kB. Max. memory is 16.1GB. [2024-10-10 22:30:15,210 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:15,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.09ms. Allocated memory was 123.7MB in the beginning and 180.4MB in the end (delta: 56.6MB). Free memory was 57.3MB in the beginning and 148.0MB in the end (delta: -90.7MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2024-10-10 22:30:15,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.40ms. Allocated memory is still 180.4MB. Free memory was 148.0MB in the beginning and 146.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:15,212 INFO L158 Benchmark]: Boogie Preprocessor took 53.46ms. Allocated memory is still 180.4MB. Free memory was 146.9MB in the beginning and 144.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:15,212 INFO L158 Benchmark]: RCFGBuilder took 614.82ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 122.8MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-10 22:30:15,214 INFO L158 Benchmark]: TraceAbstraction took 20667.17ms. Allocated memory was 180.4MB in the beginning and 314.6MB in the end (delta: 134.2MB). Free memory was 121.8MB in the beginning and 249.5MB in the end (delta: -127.7MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-10-10 22:30:15,214 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 314.6MB. Free memory is still 249.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:15,215 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.16ms. Allocated memory is still 123.7MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.09ms. Allocated memory was 123.7MB in the beginning and 180.4MB in the end (delta: 56.6MB). Free memory was 57.3MB in the beginning and 148.0MB in the end (delta: -90.7MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.40ms. Allocated memory is still 180.4MB. Free memory was 148.0MB in the beginning and 146.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.46ms. Allocated memory is still 180.4MB. Free memory was 146.9MB in the beginning and 144.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 614.82ms. Allocated memory is still 180.4MB. Free memory was 144.8MB in the beginning and 122.8MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20667.17ms. Allocated memory was 180.4MB in the beginning and 314.6MB in the end (delta: 134.2MB). Free memory was 121.8MB in the beginning and 249.5MB in the end (delta: -127.7MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 314.6MB. Free memory is still 249.5MB. 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_add1 ; [L234] unsigned int r_add2 ; [L235] unsigned int zero ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int __retres14 ; VAL [ea=127, eb=127] [L242] 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); [L242] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=127] [L242] zero = base2flt(0, 0) [L243] 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); [L243] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=127, ma=4328521728] [L243] a = base2flt(ma, ea) [L244] 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); [L244] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=127, ma=4328521728, mb=33554432] [L244] b = base2flt(mb, eb) [L245] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=4294967295] [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 [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L95] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=127, ma=16777215] [L111] EXPR ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, b=4294967295, ea=127] [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217, mb=16777215] [L114] EXPR mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217] [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 [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, eb=127, ma=16777217, mb=-4278190080] [L116] delta = ea - eb VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, delta=0, ea=127, ma=16777217, mb=-4278190080] [L117] COND FALSE !(!(delta < sizeof(mb) * 8)) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, delta=0, ea=127, ma=16777217, mb=-4278190080] [L118] EXPR mb >> delta VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=16777217] [L118] mb = mb >> delta [L120] COND FALSE !(! mb) [L126] ma = ma + mb VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=-4261412863] [L127] ma & (1U << 25U) VAL [\old(a)=4294967295, \old(b)=4294967295, a=4294967295, ea=127, ma=-4261412863] [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 4 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2005 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1854 mSDsluCounter, 28812 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25959 mSDsCounter, 253 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6438 IncrementalHoareTripleChecker+Invalid, 6691 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 253 mSolverCounterUnsat, 2853 mSDtfsCounter, 6438 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1404 GetRequests, 986 SyntacticMatches, 2 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1887 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=22, InterpolantAutomatonStates: 328, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 895 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1736 NumberOfCodeBlocks, 1720 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1930 ConstructedInterpolants, 1 QuantifiedInterpolants, 3915 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1763 ConjunctsInSsa, 292 ConjunctsInUnsatCore, 44 InterpolantComputations, 18 PerfectInterpolantSequences, 647/735 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-10-10 22:30:15,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:30:17,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:30:17,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-10 22:30:17,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:30:17,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:30:17,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:30:17,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:30:17,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:30:17,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:30:17,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:30:17,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:30:17,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:30:17,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:30:17,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:30:17,629 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:30:17,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:30:17,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:30:17,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:30:17,631 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:30:17,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:30:17,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:30:17,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:30:17,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:30:17,637 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-10 22:30:17,637 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-10 22:30:17,637 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:30:17,637 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-10 22:30:17,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:30:17,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:30:17,638 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:30:17,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:30:17,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:30:17,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:30:17,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:30:17,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:17,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:30:17,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:30:17,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:30:17,643 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-10 22:30:17,643 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-10 22:30:17,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:30:17,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:30:17,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:30:17,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:30:17,645 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-10 22:30:17,645 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-clean/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-clean/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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2024-10-10 22:30:17,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:30:17,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:30:17,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:30:17,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:30:17,988 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:30:17,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-10-10 22:30:19,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:30:19,684 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:30:19,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2024-10-10 22:30:19,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c9fba39ad/1c56d4eefa504922a64bdcbbb58f03ca/FLAGe92f07529 [2024-10-10 22:30:19,721 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c9fba39ad/1c56d4eefa504922a64bdcbbb58f03ca [2024-10-10 22:30:19,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:30:19,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:30:19,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:19,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:30:19,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:30:19,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:19" (1/1) ... [2024-10-10 22:30:19,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4514391a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:19, skipping insertion in model container [2024-10-10 22:30:19,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:19" (1/1) ... [2024-10-10 22:30:19,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:30:19,968 WARN L248 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_4-2a.c.cil.c[755,768] [2024-10-10 22:30:20,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:20,053 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:30:20,064 WARN L248 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_4-2a.c.cil.c[755,768] [2024-10-10 22:30:20,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:20,104 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:30:20,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20 WrapperNode [2024-10-10 22:30:20,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:20,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:20,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:30:20,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:30:20,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,148 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-10-10 22:30:20,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:20,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:30:20,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:30:20,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:30:20,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,179 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-10-10 22:30:20,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:30:20,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:30:20,201 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:30:20,201 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:30:20,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (1/1) ... [2024-10-10 22:30:20,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:20,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:20,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:30:20,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:30:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:30:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-10 22:30:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-10 22:30:20,285 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-10 22:30:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:30:20,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:30:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-10-10 22:30:20,285 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-10-10 22:30:20,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-10 22:30:20,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-10 22:30:20,372 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:30:20,375 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:30:20,615 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-10 22:30:20,618 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:30:20,656 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:30:20,657 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 22:30:20,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:20 BoogieIcfgContainer [2024-10-10 22:30:20,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:30:20,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:30:20,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:30:20,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:30:20,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:30:19" (1/3) ... [2024-10-10 22:30:20,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75088a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:20, skipping insertion in model container [2024-10-10 22:30:20,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:20" (2/3) ... [2024-10-10 22:30:20,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75088a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:20, skipping insertion in model container [2024-10-10 22:30:20,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:20" (3/3) ... [2024-10-10 22:30:20,681 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2024-10-10 22:30:20,697 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:30:20,697 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:30:20,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:30:20,769 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;@2cd23911, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:30:20,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:30:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-10 22:30:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:30:20,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:20,782 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:20,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:20,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1974951318, now seen corresponding path program 1 times [2024-10-10 22:30:20,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:20,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990506757] [2024-10-10 22:30:20,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:20,801 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-10-10 22:30:20,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:20,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-10 22:30:20,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:20,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:30:20,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:21,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:21,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:21,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990506757] [2024-10-10 22:30:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990506757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:21,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:21,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-10 22:30:21,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568391767] [2024-10-10 22:30:21,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:21,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 22:30:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:21,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 22:30:21,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:30:21,082 INFO L87 Difference]: Start difference. First operand has 49 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:21,255 INFO L93 Difference]: Finished difference Result 113 states and 177 transitions. [2024-10-10 22:30:21,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:30:21,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-10-10 22:30:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:21,269 INFO L225 Difference]: With dead ends: 113 [2024-10-10 22:30:21,269 INFO L226 Difference]: Without dead ends: 63 [2024-10-10 22:30:21,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:21,279 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 12 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:21,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 393 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-10 22:30:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-10-10 22:30:21,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 43 states have internal predecessors, (55), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-10 22:30:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 75 transitions. [2024-10-10 22:30:21,321 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 75 transitions. Word has length 27 [2024-10-10 22:30:21,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:21,321 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 75 transitions. [2024-10-10 22:30:21,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 75 transitions. [2024-10-10 22:30:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-10 22:30:21,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:21,324 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:21,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:21,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-10 22:30:21,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:21,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1701845995, now seen corresponding path program 1 times [2024-10-10 22:30:21,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:21,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539371576] [2024-10-10 22:30:21,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:21,527 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-10-10 22:30:21,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:21,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-10 22:30:21,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:21,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:30:21,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:21,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:21,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:21,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539371576] [2024-10-10 22:30:21,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539371576] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:21,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:21,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-10 22:30:21,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744587889] [2024-10-10 22:30:21,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:21,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:30:21,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:21,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:30:21,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:21,793 INFO L87 Difference]: Start difference. First operand 56 states and 75 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:21,947 INFO L93 Difference]: Finished difference Result 107 states and 143 transitions. [2024-10-10 22:30:21,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:30:21,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-10-10 22:30:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:21,950 INFO L225 Difference]: With dead ends: 107 [2024-10-10 22:30:21,950 INFO L226 Difference]: Without dead ends: 80 [2024-10-10 22:30:21,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:30:21,952 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 14 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:21,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 439 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:21,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-10 22:30:21,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2024-10-10 22:30:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 49 states have internal predecessors, (62), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-10-10 22:30:21,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2024-10-10 22:30:21,969 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 31 [2024-10-10 22:30:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:21,970 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2024-10-10 22:30:21,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2024-10-10 22:30:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 22:30:21,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:21,974 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] [2024-10-10 22:30:21,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-10 22:30:22,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-10 22:30:22,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:22,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:22,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2061916751, now seen corresponding path program 1 times [2024-10-10 22:30:22,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:22,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28191700] [2024-10-10 22:30:22,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:22,178 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-10-10 22:30:22,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:22,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-10 22:30:22,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:22,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:30:22,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:22,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:22,384 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28191700] [2024-10-10 22:30:22,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28191700] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:22,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:22,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-10 22:30:22,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372217520] [2024-10-10 22:30:22,385 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:22,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 22:30:22,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:22,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 22:30:22,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:30:22,387 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:22,484 INFO L93 Difference]: Finished difference Result 102 states and 136 transitions. [2024-10-10 22:30:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:30:22,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2024-10-10 22:30:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:22,488 INFO L225 Difference]: With dead ends: 102 [2024-10-10 22:30:22,488 INFO L226 Difference]: Without dead ends: 79 [2024-10-10 22:30:22,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:22,489 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:22,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 401 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:22,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-10 22:30:22,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2024-10-10 22:30:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 55 states have internal predecessors, (68), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-10-10 22:30:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2024-10-10 22:30:22,504 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 34 [2024-10-10 22:30:22,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:22,507 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2024-10-10 22:30:22,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2024-10-10 22:30:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:30:22,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:22,510 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:22,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:22,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-10 22:30:22,711 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:22,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash 922216448, now seen corresponding path program 2 times [2024-10-10 22:30:22,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:22,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975868724] [2024-10-10 22:30:22,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:22,712 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-10-10 22:30:22,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:22,715 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-10 22:30:22,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:22,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-10 22:30:22,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:22,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:30:22,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:22,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:22,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:22,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:22,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975868724] [2024-10-10 22:30:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975868724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:22,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:30:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775722302] [2024-10-10 22:30:22,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:22,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:22,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:22,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:22,911 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:23,033 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2024-10-10 22:30:23,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:23,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-10 22:30:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:23,035 INFO L225 Difference]: With dead ends: 84 [2024-10-10 22:30:23,035 INFO L226 Difference]: Without dead ends: 82 [2024-10-10 22:30:23,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-10-10 22:30:23,037 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 3 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:23,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 279 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-10 22:30:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-10-10 22:30:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.280701754385965) internal successors, (73), 60 states have internal predecessors, (73), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17) [2024-10-10 22:30:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2024-10-10 22:30:23,047 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 35 [2024-10-10 22:30:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:23,048 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2024-10-10 22:30:23,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2024-10-10 22:30:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:30:23,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:23,049 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:23,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:23,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-10 22:30:23,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash 979474750, now seen corresponding path program 1 times [2024-10-10 22:30:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:23,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130621530] [2024-10-10 22:30:23,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:23,254 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-10-10 22:30:23,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:23,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-10 22:30:23,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:23,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:30:23,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:23,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:23,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:23,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130621530] [2024-10-10 22:30:23,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130621530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:23,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:23,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:30:23,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267933038] [2024-10-10 22:30:23,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:23,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:23,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:23,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:23,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:23,419 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:23,537 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2024-10-10 22:30:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:23,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-10 22:30:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:23,542 INFO L225 Difference]: With dead ends: 86 [2024-10-10 22:30:23,542 INFO L226 Difference]: Without dead ends: 84 [2024-10-10 22:30:23,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-10-10 22:30:23,543 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:23,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 274 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-10 22:30:23,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2024-10-10 22:30:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 58 states have internal predecessors, (71), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-10-10 22:30:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-10-10 22:30:23,566 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 35 [2024-10-10 22:30:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:23,567 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-10-10 22:30:23,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-10-10 22:30:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:30:23,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:23,571 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] [2024-10-10 22:30:23,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:23,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-10 22:30:23,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:23,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:23,772 INFO L85 PathProgramCache]: Analyzing trace with hash 539553575, now seen corresponding path program 1 times [2024-10-10 22:30:23,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611511352] [2024-10-10 22:30:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:23,773 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-10-10 22:30:23,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:23,774 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-10 22:30:23,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:23,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-10 22:30:23,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:23,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:23,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:23,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611511352] [2024-10-10 22:30:23,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611511352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:23,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:23,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-10 22:30:23,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395909450] [2024-10-10 22:30:23,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:23,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:30:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:23,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:30:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:30:23,946 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:30:24,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:24,173 INFO L93 Difference]: Finished difference Result 114 states and 151 transitions. [2024-10-10 22:30:24,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 22:30:24,174 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-10-10 22:30:24,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:24,175 INFO L225 Difference]: With dead ends: 114 [2024-10-10 22:30:24,175 INFO L226 Difference]: Without dead ends: 107 [2024-10-10 22:30:24,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:30:24,177 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:24,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 519 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:30:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-10 22:30:24,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 92. [2024-10-10 22:30:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 68 states have internal predecessors, (83), 16 states have call successors, (16), 7 states have call predecessors, (16), 9 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2024-10-10 22:30:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2024-10-10 22:30:24,191 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 38 [2024-10-10 22:30:24,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:24,195 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2024-10-10 22:30:24,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:30:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2024-10-10 22:30:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:30:24,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:24,197 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] [2024-10-10 22:30:24,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:24,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-10 22:30:24,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:24,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1568323699, now seen corresponding path program 1 times [2024-10-10 22:30:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:24,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104745320] [2024-10-10 22:30:24,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:24,399 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-10-10 22:30:24,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:24,401 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-10-10 22:30:24,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:24,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-10 22:30:24,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:24,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:24,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-10 22:30:24,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:24,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104745320] [2024-10-10 22:30:24,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104745320] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:24,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:24,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2024-10-10 22:30:24,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279560326] [2024-10-10 22:30:24,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:24,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 22:30:24,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:24,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 22:30:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:30:24,700 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:30:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:24,926 INFO L93 Difference]: Finished difference Result 121 states and 159 transitions. [2024-10-10 22:30:24,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 22:30:24,927 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2024-10-10 22:30:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:24,929 INFO L225 Difference]: With dead ends: 121 [2024-10-10 22:30:24,929 INFO L226 Difference]: Without dead ends: 113 [2024-10-10 22:30:24,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:30:24,931 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 33 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:24,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 550 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:30:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-10 22:30:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-10-10 22:30:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 75 states have internal predecessors, (92), 17 states have call successors, (17), 7 states have call predecessors, (17), 10 states have return successors, (24), 19 states have call predecessors, (24), 16 states have call successors, (24) [2024-10-10 22:30:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2024-10-10 22:30:24,955 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 40 [2024-10-10 22:30:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:24,956 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2024-10-10 22:30:24,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:30:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2024-10-10 22:30:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:30:24,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:24,960 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] [2024-10-10 22:30:24,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:25,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-10-10 22:30:25,161 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:25,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:25,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1511065397, now seen corresponding path program 1 times [2024-10-10 22:30:25,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:25,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103641431] [2024-10-10 22:30:25,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:25,162 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-10-10 22:30:25,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:25,166 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-10 22:30:25,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:25,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:30:25,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:30:25,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:25,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:25,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103641431] [2024-10-10 22:30:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103641431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:25,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:25,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:30:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192890410] [2024-10-10 22:30:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:25,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:25,259 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-10 22:30:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:25,303 INFO L93 Difference]: Finished difference Result 110 states and 140 transitions. [2024-10-10 22:30:25,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:25,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 40 [2024-10-10 22:30:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:25,305 INFO L225 Difference]: With dead ends: 110 [2024-10-10 22:30:25,305 INFO L226 Difference]: Without dead ends: 95 [2024-10-10 22:30:25,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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-10-10 22:30:25,306 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 3 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:25,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 284 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-10 22:30:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-10 22:30:25,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 71 states have internal predecessors, (85), 15 states have call successors, (15), 7 states have call predecessors, (15), 10 states have return successors, (21), 16 states have call predecessors, (21), 14 states have call successors, (21) [2024-10-10 22:30:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2024-10-10 22:30:25,316 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 40 [2024-10-10 22:30:25,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:25,316 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2024-10-10 22:30:25,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-10 22:30:25,316 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2024-10-10 22:30:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:30:25,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:25,318 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:25,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:25,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-10 22:30:25,519 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:25,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1965766502, now seen corresponding path program 1 times [2024-10-10 22:30:25,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:25,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420127311] [2024-10-10 22:30:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:25,519 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-10-10 22:30:25,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:25,521 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-10 22:30:25,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:25,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-10 22:30:25,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:25,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:26,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420127311] [2024-10-10 22:30:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420127311] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:26,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:26,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-10 22:30:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436375978] [2024-10-10 22:30:26,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:26,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-10 22:30:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-10 22:30:26,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2024-10-10 22:30:26,174 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:27,281 INFO L93 Difference]: Finished difference Result 132 states and 188 transitions. [2024-10-10 22:30:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-10 22:30:27,282 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 42 [2024-10-10 22:30:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:27,283 INFO L225 Difference]: With dead ends: 132 [2024-10-10 22:30:27,283 INFO L226 Difference]: Without dead ends: 98 [2024-10-10 22:30:27,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2024-10-10 22:30:27,285 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 60 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:27,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1037 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:30:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-10 22:30:27,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2024-10-10 22:30:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 60 states have internal predecessors, (71), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (24), 12 states have call predecessors, (24), 11 states have call successors, (24) [2024-10-10 22:30:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2024-10-10 22:30:27,296 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 42 [2024-10-10 22:30:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:27,296 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-10-10 22:30:27,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2024-10-10 22:30:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:30:27,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:27,297 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:27,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:27,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-10 22:30:27,501 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:27,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:27,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1432935070, now seen corresponding path program 2 times [2024-10-10 22:30:27,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:27,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761393987] [2024-10-10 22:30:27,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:27,502 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-10-10 22:30:27,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:27,505 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-10 22:30:27,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:27,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:30:27,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:27,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-10 22:30:27,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:27,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:28,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:28,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761393987] [2024-10-10 22:30:28,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761393987] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:28,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:28,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-10 22:30:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832897746] [2024-10-10 22:30:28,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:28,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-10 22:30:28,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:28,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-10 22:30:28,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2024-10-10 22:30:28,082 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:28,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:28,973 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2024-10-10 22:30:28,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-10 22:30:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 42 [2024-10-10 22:30:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:28,975 INFO L225 Difference]: With dead ends: 109 [2024-10-10 22:30:28,975 INFO L226 Difference]: Without dead ends: 98 [2024-10-10 22:30:28,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-10-10 22:30:28,976 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 61 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:28,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 985 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:30:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-10 22:30:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 80. [2024-10-10 22:30:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.263157894736842) internal successors, (72), 61 states have internal predecessors, (72), 13 states have call successors, (13), 5 states have call predecessors, (13), 9 states have return successors, (27), 13 states have call predecessors, (27), 12 states have call successors, (27) [2024-10-10 22:30:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 112 transitions. [2024-10-10 22:30:28,995 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 112 transitions. Word has length 42 [2024-10-10 22:30:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:29,007 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 112 transitions. [2024-10-10 22:30:29,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 112 transitions. [2024-10-10 22:30:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 22:30:29,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:29,008 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:29,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:29,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-10-10 22:30:29,209 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:29,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:29,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1764000766, now seen corresponding path program 1 times [2024-10-10 22:30:29,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:29,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442198579] [2024-10-10 22:30:29,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:29,210 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-10-10 22:30:29,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:29,212 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-10-10 22:30:29,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:29,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-10 22:30:29,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:29,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:29,512 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:29,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:29,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442198579] [2024-10-10 22:30:29,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442198579] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:29,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:29,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2024-10-10 22:30:29,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065973273] [2024-10-10 22:30:29,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:29,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-10 22:30:29,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:29,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-10 22:30:29,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:30:29,514 INFO L87 Difference]: Start difference. First operand 80 states and 112 transitions. Second operand has 16 states, 12 states have (on average 3.0) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:29,766 INFO L93 Difference]: Finished difference Result 108 states and 154 transitions. [2024-10-10 22:30:29,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-10 22:30:29,767 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.0) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2024-10-10 22:30:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:29,769 INFO L225 Difference]: With dead ends: 108 [2024-10-10 22:30:29,769 INFO L226 Difference]: Without dead ends: 97 [2024-10-10 22:30:29,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-10-10 22:30:29,772 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 28 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:29,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 592 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:30:29,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-10 22:30:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2024-10-10 22:30:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 63 states have internal predecessors, (73), 13 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (30), 13 states have call predecessors, (30), 12 states have call successors, (30) [2024-10-10 22:30:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2024-10-10 22:30:29,793 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 44 [2024-10-10 22:30:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:29,794 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2024-10-10 22:30:29,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.0) internal successors, (36), 14 states have internal predecessors, (36), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-10 22:30:29,795 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2024-10-10 22:30:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-10 22:30:29,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:29,795 INFO L215 NwaCegarLoop]: trace histogram [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-10-10 22:30:29,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:29,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-10-10 22:30:29,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:29,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1487703526, now seen corresponding path program 1 times [2024-10-10 22:30:29,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:29,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081835470] [2024-10-10 22:30:29,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:29,997 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-10-10 22:30:29,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:29,998 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-10-10 22:30:30,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:30,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:30:30,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-10 22:30:30,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:30,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:30,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081835470] [2024-10-10 22:30:30,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081835470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:30,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:30,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-10 22:30:30,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109669905] [2024-10-10 22:30:30,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:30,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:30:30,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:30:30,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:30,104 INFO L87 Difference]: Start difference. First operand 82 states and 116 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, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:30:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:30,208 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2024-10-10 22:30:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:30:30,211 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, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2024-10-10 22:30:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:30,212 INFO L225 Difference]: With dead ends: 131 [2024-10-10 22:30:30,212 INFO L226 Difference]: Without dead ends: 75 [2024-10-10 22:30:30,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:30:30,213 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:30,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 448 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-10 22:30:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-10 22:30:30,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 58 states have internal predecessors, (68), 12 states have call successors, (12), 4 states have call predecessors, (12), 9 states have return successors, (28), 12 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-10 22:30:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 108 transitions. [2024-10-10 22:30:30,223 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 108 transitions. Word has length 48 [2024-10-10 22:30:30,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:30,223 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 108 transitions. [2024-10-10 22:30:30,223 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, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:30:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 108 transitions. [2024-10-10 22:30:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 22:30:30,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:30,224 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:30,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-10 22:30:30,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-10-10 22:30:30,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:30,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:30,429 INFO L85 PathProgramCache]: Analyzing trace with hash -114915456, now seen corresponding path program 1 times [2024-10-10 22:30:30,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:30,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430804237] [2024-10-10 22:30:30,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:30,429 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-10-10 22:30:30,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:30,432 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-10-10 22:30:30,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:30,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:30:30,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:34,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:34,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430804237] [2024-10-10 22:30:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430804237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:34,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:34,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-10 22:30:34,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117448230] [2024-10-10 22:30:34,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:34,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 22:30:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 22:30:34,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=36, Unknown=1, NotChecked=0, Total=56 [2024-10-10 22:30:34,273 INFO L87 Difference]: Start difference. First operand 75 states and 108 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:37,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:30:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:37,770 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2024-10-10 22:30:37,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:30:37,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2024-10-10 22:30:37,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:37,772 INFO L225 Difference]: With dead ends: 85 [2024-10-10 22:30:37,772 INFO L226 Difference]: Without dead ends: 83 [2024-10-10 22:30:37,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=23, Invalid=48, Unknown=1, NotChecked=0, Total=72 [2024-10-10 22:30:37,773 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:37,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 209 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2024-10-10 22:30:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-10 22:30:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-10-10 22:30:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 62 states have internal predecessors, (71), 13 states have call successors, (13), 5 states have call predecessors, (13), 10 states have return successors, (29), 12 states have call predecessors, (29), 12 states have call successors, (29) [2024-10-10 22:30:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2024-10-10 22:30:37,787 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 45 [2024-10-10 22:30:37,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:37,788 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2024-10-10 22:30:37,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2024-10-10 22:30:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:30:37,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:37,789 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:30:37,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:37,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-10-10 22:30:37,990 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:37,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:37,991 INFO L85 PathProgramCache]: Analyzing trace with hash 501526360, now seen corresponding path program 1 times [2024-10-10 22:30:37,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:37,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397995105] [2024-10-10 22:30:37,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:37,991 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-10-10 22:30:37,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:37,992 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-10-10 22:30:37,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:30:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:38,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:30:38,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:45,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:45,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:45,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397995105] [2024-10-10 22:30:45,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397995105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:45,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:45,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-10 22:30:45,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405602202] [2024-10-10 22:30:45,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:45,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 22:30:45,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:45,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 22:30:45,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=37, Unknown=3, NotChecked=0, Total=56 [2024-10-10 22:30:45,743 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:48,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:30:50,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:30:52,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:30:54,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:30:57,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:30:59,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:31:03,661 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-10-10 22:31:07,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:31:09,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-10 22:31:09,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:09,433 INFO L93 Difference]: Finished difference Result 89 states and 124 transitions. [2024-10-10 22:31:09,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:31:09,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-10-10 22:31:09,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:09,434 INFO L225 Difference]: With dead ends: 89 [2024-10-10 22:31:09,434 INFO L226 Difference]: Without dead ends: 85 [2024-10-10 22:31:09,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=20, Invalid=49, Unknown=3, NotChecked=0, Total=72 [2024-10-10 22:31:09,435 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:09,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 263 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 8 Unknown, 0 Unchecked, 23.7s Time] [2024-10-10 22:31:09,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-10 22:31:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2024-10-10 22:31:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 59 states have internal predecessors, (69), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (28), 12 states have call predecessors, (28), 11 states have call successors, (28) [2024-10-10 22:31:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 109 transitions. [2024-10-10 22:31:09,444 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 109 transitions. Word has length 46 [2024-10-10 22:31:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:09,444 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 109 transitions. [2024-10-10 22:31:09,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:31:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 109 transitions. [2024-10-10 22:31:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-10 22:31:09,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:09,445 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:09,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:31:09,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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-10-10 22:31:09,646 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:09,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:09,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1094043785, now seen corresponding path program 1 times [2024-10-10 22:31:09,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:31:09,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697079060] [2024-10-10 22:31:09,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:09,647 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-10-10 22:31:09,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:31:09,649 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/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-10-10 22:31:09,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:31:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:09,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:31:09,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:31:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:31:09,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:31:09,949 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:31:09,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:31:09,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697079060] [2024-10-10 22:31:09,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697079060] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:31:09,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:31:09,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-10-10 22:31:09,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214184174] [2024-10-10 22:31:09,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:31:09,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:31:09,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:31:09,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:31:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:31:09,951 INFO L87 Difference]: Start difference. First operand 77 states and 109 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:31:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:10,215 INFO L93 Difference]: Finished difference Result 100 states and 152 transitions. [2024-10-10 22:31:10,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:31:10,216 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2024-10-10 22:31:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:10,217 INFO L225 Difference]: With dead ends: 100 [2024-10-10 22:31:10,217 INFO L226 Difference]: Without dead ends: 87 [2024-10-10 22:31:10,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:31:10,218 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 78 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:10,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 304 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:31:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-10 22:31:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2024-10-10 22:31:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.25) internal successors, (70), 61 states have internal predecessors, (70), 12 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (31), 12 states have call predecessors, (31), 11 states have call successors, (31) [2024-10-10 22:31:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 113 transitions. [2024-10-10 22:31:10,230 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 113 transitions. Word has length 48 [2024-10-10 22:31:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:10,231 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 113 transitions. [2024-10-10 22:31:10,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-10 22:31:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 113 transitions. [2024-10-10 22:31:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-10 22:31:10,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:10,232 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:10,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:31:10,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/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-10-10 22:31:10,433 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:10,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1537741673, now seen corresponding path program 1 times [2024-10-10 22:31:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:31:10,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921321993] [2024-10-10 22:31:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:10,434 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-10-10 22:31:10,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:31:10,435 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/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-10-10 22:31:10,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:31:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:10,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:31:10,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:31:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:31:10,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:31:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:31:10,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:31:10,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921321993] [2024-10-10 22:31:10,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921321993] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:31:10,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:31:10,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-10-10 22:31:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210752456] [2024-10-10 22:31:10,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:31:10,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:31:10,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:31:10,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:31:10,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:31:10,727 INFO L87 Difference]: Start difference. First operand 79 states and 113 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:31:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:10,958 INFO L93 Difference]: Finished difference Result 100 states and 150 transitions. [2024-10-10 22:31:10,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:31:10,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2024-10-10 22:31:10,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:10,960 INFO L225 Difference]: With dead ends: 100 [2024-10-10 22:31:10,960 INFO L226 Difference]: Without dead ends: 87 [2024-10-10 22:31:10,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:31:10,962 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 26 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:10,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 410 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:31:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-10 22:31:10,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2024-10-10 22:31:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.25) internal successors, (70), 61 states have internal predecessors, (70), 12 states have call successors, (12), 5 states have call predecessors, (12), 10 states have return successors, (30), 12 states have call predecessors, (30), 11 states have call successors, (30) [2024-10-10 22:31:10,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 112 transitions. [2024-10-10 22:31:10,973 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 112 transitions. Word has length 57 [2024-10-10 22:31:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:10,973 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 112 transitions. [2024-10-10 22:31:10,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:31:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 112 transitions. [2024-10-10 22:31:10,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-10 22:31:10,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:10,974 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:10,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-10 22:31:11,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/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-10-10 22:31:11,175 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:11,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:11,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1468857666, now seen corresponding path program 1 times [2024-10-10 22:31:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:31:11,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929936906] [2024-10-10 22:31:11,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:11,176 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-10-10 22:31:11,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:31:11,177 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/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-10-10 22:31:11,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:31:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:11,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:31:11,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:31:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:31:11,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:31:11,447 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:31:11,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:31:11,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929936906] [2024-10-10 22:31:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929936906] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:31:11,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:31:11,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-10-10 22:31:11,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582030799] [2024-10-10 22:31:11,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:31:11,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:31:11,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:31:11,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:31:11,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:31:11,449 INFO L87 Difference]: Start difference. First operand 79 states and 112 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:31:11,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:11,733 INFO L93 Difference]: Finished difference Result 98 states and 142 transitions. [2024-10-10 22:31:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:31:11,734 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 57 [2024-10-10 22:31:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:11,734 INFO L225 Difference]: With dead ends: 98 [2024-10-10 22:31:11,735 INFO L226 Difference]: Without dead ends: 85 [2024-10-10 22:31:11,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:31:11,735 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 37 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:11,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 501 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:31:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-10 22:31:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2024-10-10 22:31:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 59 states have internal predecessors, (68), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (27), 12 states have call predecessors, (27), 11 states have call successors, (27) [2024-10-10 22:31:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2024-10-10 22:31:11,746 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 107 transitions. Word has length 57 [2024-10-10 22:31:11,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:11,747 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 107 transitions. [2024-10-10 22:31:11,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:31:11,748 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2024-10-10 22:31:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-10 22:31:11,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:11,749 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:11,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:31:11,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/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-10-10 22:31:11,953 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:11,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:11,953 INFO L85 PathProgramCache]: Analyzing trace with hash -244994597, now seen corresponding path program 1 times [2024-10-10 22:31:11,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:31:11,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454834681] [2024-10-10 22:31:11,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:11,954 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-10-10 22:31:11,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:31:11,957 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/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-10-10 22:31:11,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:31:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:12,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:31:12,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:31:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:31:12,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:31:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-10 22:31:12,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:31:12,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454834681] [2024-10-10 22:31:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454834681] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:31:12,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:31:12,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2024-10-10 22:31:12,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674323521] [2024-10-10 22:31:12,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:31:12,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-10 22:31:12,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:31:12,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-10 22:31:12,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:31:12,282 INFO L87 Difference]: Start difference. First operand 77 states and 107 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:31:12,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:12,462 INFO L93 Difference]: Finished difference Result 96 states and 137 transitions. [2024-10-10 22:31:12,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:31:12,463 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2024-10-10 22:31:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:12,464 INFO L225 Difference]: With dead ends: 96 [2024-10-10 22:31:12,464 INFO L226 Difference]: Without dead ends: 83 [2024-10-10 22:31:12,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:31:12,465 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 37 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:12,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 330 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:31:12,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-10 22:31:12,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2024-10-10 22:31:12,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 12 states have call successors, (12), 5 states have call predecessors, (12), 8 states have return successors, (25), 12 states have call predecessors, (25), 11 states have call successors, (25) [2024-10-10 22:31:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2024-10-10 22:31:12,477 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 59 [2024-10-10 22:31:12,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:12,477 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2024-10-10 22:31:12,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:31:12,478 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2024-10-10 22:31:12,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-10 22:31:12,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:12,479 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:12,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:31:12,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/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-10-10 22:31:12,683 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:12,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash -557433969, now seen corresponding path program 1 times [2024-10-10 22:31:12,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:31:12,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757777771] [2024-10-10 22:31:12,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:12,684 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-10-10 22:31:12,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:31:12,685 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/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-10-10 22:31:12,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:31:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:12,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-10 22:31:12,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:31:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 22:31:13,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:31:13,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:31:13,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757777771] [2024-10-10 22:31:13,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757777771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:31:13,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:31:13,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-10 22:31:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378730867] [2024-10-10 22:31:13,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:31:13,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:31:13,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:31:13,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:31:13,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:31:13,303 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:31:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:31:13,654 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2024-10-10 22:31:13,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:31:13,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 66 [2024-10-10 22:31:13,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:31:13,657 INFO L225 Difference]: With dead ends: 89 [2024-10-10 22:31:13,657 INFO L226 Difference]: Without dead ends: 80 [2024-10-10 22:31:13,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:31:13,658 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:31:13,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 464 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:31:13,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-10 22:31:13,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-10-10 22:31:13,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 57 states have internal predecessors, (66), 12 states have call successors, (12), 5 states have call predecessors, (12), 8 states have return successors, (24), 12 states have call predecessors, (24), 11 states have call successors, (24) [2024-10-10 22:31:13,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2024-10-10 22:31:13,666 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 66 [2024-10-10 22:31:13,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:31:13,666 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2024-10-10 22:31:13,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:31:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2024-10-10 22:31:13,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-10 22:31:13,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:31:13,667 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:31:13,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:31:13,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/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-10-10 22:31:13,868 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:31:13,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:31:13,868 INFO L85 PathProgramCache]: Analyzing trace with hash 511536238, now seen corresponding path program 1 times [2024-10-10 22:31:13,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:31:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765129387] [2024-10-10 22:31:13,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:31:13,869 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-10-10 22:31:13,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:31:13,872 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/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-10-10 22:31:13,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:31:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:31:13,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-10 22:31:13,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:31:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:31:14,684 INFO L311 TraceCheckSpWp]: Computing backward predicates...