./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 18:59:30,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:59:30,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 18:59:30,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:59:30,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:59:31,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:59:31,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:59:31,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:59:31,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:59:31,017 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:59:31,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:59:31,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:59:31,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:59:31,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:59:31,019 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:59:31,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:59:31,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:59:31,020 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:59:31,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 18:59:31,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:59:31,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:59:31,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:59:31,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:59:31,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:59:31,022 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:59:31,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:59:31,022 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:59:31,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:59:31,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:59:31,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:59:31,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:59:31,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:59:31,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:59:31,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:59:31,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:59:31,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 18:59:31,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 18:59:31,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:59:31,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:59:31,025 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:59:31,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:59:31,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:59:31,026 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2023-11-22 18:59:31,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:59:31,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:59:31,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:59:31,277 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:59:31,278 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:59:31,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-11-22 18:59:32,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:59:32,434 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:59:32,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-11-22 18:59:32,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9acc31984/251310b6a2684b91b50a58dd18af18c7/FLAG30ce2fa1d [2023-11-22 18:59:32,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9acc31984/251310b6a2684b91b50a58dd18af18c7 [2023-11-22 18:59:32,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:59:32,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:59:32,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:59:32,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:59:32,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:59:32,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43594bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32, skipping insertion in model container [2023-11-22 18:59:32,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,481 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:59:32,577 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-11-22 18:59:32,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:59:32,622 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:59:32,631 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-11-22 18:59:32,650 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:59:32,660 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:59:32,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32 WrapperNode [2023-11-22 18:59:32,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:59:32,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:59:32,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:59:32,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:59:32,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,706 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2023-11-22 18:59:32,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:59:32,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:59:32,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:59:32,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:59:32,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,722 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,747 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 18:59:32,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:59:32,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:59:32,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:59:32,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:59:32,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (1/1) ... [2023-11-22 18:59:32,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:59:32,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:32,848 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 18:59:32,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 18:59:32,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:59:32,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 18:59:32,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:59:32,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:59:32,963 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:59:32,965 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:59:33,226 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:59:33,254 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:59:33,257 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 18:59:33,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:59:33 BoogieIcfgContainer [2023-11-22 18:59:33,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:59:33,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:59:33,261 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:59:33,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:59:33,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:59:32" (1/3) ... [2023-11-22 18:59:33,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdd0c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:59:33, skipping insertion in model container [2023-11-22 18:59:33,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:59:32" (2/3) ... [2023-11-22 18:59:33,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdd0c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:59:33, skipping insertion in model container [2023-11-22 18:59:33,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:59:33" (3/3) ... [2023-11-22 18:59:33,267 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2023-11-22 18:59:33,282 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:59:33,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:59:33,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:59:33,334 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@613dfb65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:59:33,335 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:59:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-22 18:59:33,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:33,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:33,350 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:33,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:33,355 INFO L85 PathProgramCache]: Analyzing trace with hash -701051337, now seen corresponding path program 1 times [2023-11-22 18:59:33,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:33,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416065961] [2023-11-22 18:59:33,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:33,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:59:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416065961] [2023-11-22 18:59:33,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416065961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:33,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:59:33,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:59:33,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156419054] [2023-11-22 18:59:33,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:33,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 18:59:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:33,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 18:59:33,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:59:33,552 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:33,571 INFO L93 Difference]: Finished difference Result 62 states and 109 transitions. [2023-11-22 18:59:33,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 18:59:33,574 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-22 18:59:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:33,601 INFO L225 Difference]: With dead ends: 62 [2023-11-22 18:59:33,602 INFO L226 Difference]: Without dead ends: 42 [2023-11-22 18:59:33,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:59:33,606 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:33,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:59:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-22 18:59:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-22 18:59:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 41 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2023-11-22 18:59:33,688 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 13 [2023-11-22 18:59:33,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:33,688 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 74 transitions. [2023-11-22 18:59:33,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:33,689 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2023-11-22 18:59:33,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-22 18:59:33,690 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:33,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:33,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 18:59:33,691 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:33,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:33,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1267888409, now seen corresponding path program 1 times [2023-11-22 18:59:33,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:33,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436257656] [2023-11-22 18:59:33,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:59:33,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:33,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436257656] [2023-11-22 18:59:33,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436257656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:33,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:59:33,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 18:59:33,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106845986] [2023-11-22 18:59:33,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:33,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 18:59:33,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:33,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 18:59:33,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:59:33,880 INFO L87 Difference]: Start difference. First operand 42 states and 74 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:34,033 INFO L93 Difference]: Finished difference Result 98 states and 177 transitions. [2023-11-22 18:59:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 18:59:34,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-22 18:59:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:34,034 INFO L225 Difference]: With dead ends: 98 [2023-11-22 18:59:34,035 INFO L226 Difference]: Without dead ends: 65 [2023-11-22 18:59:34,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:59:34,037 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:34,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 76 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:59:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-22 18:59:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2023-11-22 18:59:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.596774193548387) internal successors, (99), 62 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 99 transitions. [2023-11-22 18:59:34,048 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 99 transitions. Word has length 13 [2023-11-22 18:59:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:34,049 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 99 transitions. [2023-11-22 18:59:34,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 99 transitions. [2023-11-22 18:59:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-22 18:59:34,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:34,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:34,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 18:59:34,052 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:34,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1612037902, now seen corresponding path program 1 times [2023-11-22 18:59:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:34,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121033251] [2023-11-22 18:59:34,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:59:34,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:34,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121033251] [2023-11-22 18:59:34,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121033251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:34,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:59:34,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 18:59:34,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147280770] [2023-11-22 18:59:34,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:34,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:59:34,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:34,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:59:34,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 18:59:34,192 INFO L87 Difference]: Start difference. First operand 63 states and 99 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:34,378 INFO L93 Difference]: Finished difference Result 155 states and 270 transitions. [2023-11-22 18:59:34,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 18:59:34,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-22 18:59:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:34,380 INFO L225 Difference]: With dead ends: 155 [2023-11-22 18:59:34,380 INFO L226 Difference]: Without dead ends: 122 [2023-11-22 18:59:34,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:59:34,381 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:34,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 99 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:59:34,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-22 18:59:34,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2023-11-22 18:59:34,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.576470588235294) internal successors, (134), 85 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2023-11-22 18:59:34,389 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 19 [2023-11-22 18:59:34,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:34,390 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2023-11-22 18:59:34,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,390 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2023-11-22 18:59:34,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-22 18:59:34,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:34,391 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:34,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 18:59:34,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:34,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1944328577, now seen corresponding path program 1 times [2023-11-22 18:59:34,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:34,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373478007] [2023-11-22 18:59:34,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-22 18:59:34,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:34,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373478007] [2023-11-22 18:59:34,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373478007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:34,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:59:34,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 18:59:34,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696666453] [2023-11-22 18:59:34,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:34,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:59:34,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:34,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:59:34,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 18:59:34,465 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:34,590 INFO L93 Difference]: Finished difference Result 247 states and 380 transitions. [2023-11-22 18:59:34,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 18:59:34,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-22 18:59:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:34,592 INFO L225 Difference]: With dead ends: 247 [2023-11-22 18:59:34,592 INFO L226 Difference]: Without dead ends: 173 [2023-11-22 18:59:34,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:59:34,593 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 94 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:34,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 198 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:59:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-11-22 18:59:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 94. [2023-11-22 18:59:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.5376344086021505) internal successors, (143), 93 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 143 transitions. [2023-11-22 18:59:34,601 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 143 transitions. Word has length 25 [2023-11-22 18:59:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:34,601 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 143 transitions. [2023-11-22 18:59:34,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 143 transitions. [2023-11-22 18:59:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-22 18:59:34,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:34,612 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:34,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 18:59:34,613 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:34,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash 889628198, now seen corresponding path program 1 times [2023-11-22 18:59:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:34,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567630183] [2023-11-22 18:59:34,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-22 18:59:34,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:34,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567630183] [2023-11-22 18:59:34,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567630183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:34,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:59:34,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 18:59:34,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692957491] [2023-11-22 18:59:34,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:34,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:59:34,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:34,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:59:34,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 18:59:34,715 INFO L87 Difference]: Start difference. First operand 94 states and 143 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:34,833 INFO L93 Difference]: Finished difference Result 268 states and 406 transitions. [2023-11-22 18:59:34,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 18:59:34,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-22 18:59:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:34,835 INFO L225 Difference]: With dead ends: 268 [2023-11-22 18:59:34,835 INFO L226 Difference]: Without dead ends: 193 [2023-11-22 18:59:34,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:59:34,836 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 98 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:34,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 206 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:59:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-22 18:59:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 104. [2023-11-22 18:59:34,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.5145631067961165) internal successors, (156), 103 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2023-11-22 18:59:34,843 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 26 [2023-11-22 18:59:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:34,844 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2023-11-22 18:59:34,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:34,848 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2023-11-22 18:59:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-22 18:59:34,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:34,849 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:34,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 18:59:34,849 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:34,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash -449843762, now seen corresponding path program 1 times [2023-11-22 18:59:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:34,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320688009] [2023-11-22 18:59:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:34,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:34,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:59:34,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320688009] [2023-11-22 18:59:34,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320688009] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:34,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655645347] [2023-11-22 18:59:34,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:34,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:34,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:34,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:34,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 18:59:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:35,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 18:59:35,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-22 18:59:35,138 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:59:35,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655645347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:35,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:59:35,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-22 18:59:35,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617555636] [2023-11-22 18:59:35,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:35,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 18:59:35,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:35,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 18:59:35,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-22 18:59:35,144 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:35,375 INFO L93 Difference]: Finished difference Result 425 states and 664 transitions. [2023-11-22 18:59:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 18:59:35,376 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-22 18:59:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:35,377 INFO L225 Difference]: With dead ends: 425 [2023-11-22 18:59:35,377 INFO L226 Difference]: Without dead ends: 336 [2023-11-22 18:59:35,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-22 18:59:35,378 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 205 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:35,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 374 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 18:59:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-11-22 18:59:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 184. [2023-11-22 18:59:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 183 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 272 transitions. [2023-11-22 18:59:35,388 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 272 transitions. Word has length 27 [2023-11-22 18:59:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:35,388 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 272 transitions. [2023-11-22 18:59:35,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 272 transitions. [2023-11-22 18:59:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 18:59:35,389 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:35,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:35,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-22 18:59:35,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-22 18:59:35,594 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:35,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1336537893, now seen corresponding path program 1 times [2023-11-22 18:59:35,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:35,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777570625] [2023-11-22 18:59:35,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:35,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:59:35,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777570625] [2023-11-22 18:59:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777570625] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579365212] [2023-11-22 18:59:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:35,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:35,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:35,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:35,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 18:59:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:35,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-22 18:59:35,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-22 18:59:35,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:59:35,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579365212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:35,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:59:35,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2023-11-22 18:59:35,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132068617] [2023-11-22 18:59:35,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:35,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 18:59:35,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 18:59:35,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-22 18:59:35,766 INFO L87 Difference]: Start difference. First operand 184 states and 272 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:36,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:36,251 INFO L93 Difference]: Finished difference Result 1065 states and 1606 transitions. [2023-11-22 18:59:36,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 18:59:36,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-22 18:59:36,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:36,254 INFO L225 Difference]: With dead ends: 1065 [2023-11-22 18:59:36,254 INFO L226 Difference]: Without dead ends: 905 [2023-11-22 18:59:36,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-11-22 18:59:36,255 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 302 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:36,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 741 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 18:59:36,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2023-11-22 18:59:36,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 477. [2023-11-22 18:59:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 476 states have (on average 1.5105042016806722) internal successors, (719), 476 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 719 transitions. [2023-11-22 18:59:36,271 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 719 transitions. Word has length 28 [2023-11-22 18:59:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:36,271 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 719 transitions. [2023-11-22 18:59:36,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 719 transitions. [2023-11-22 18:59:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 18:59:36,272 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:36,273 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 18:59:36,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 18:59:36,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-22 18:59:36,486 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:36,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1045843213, now seen corresponding path program 1 times [2023-11-22 18:59:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:36,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548108052] [2023-11-22 18:59:36,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:36,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:59:36,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548108052] [2023-11-22 18:59:36,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548108052] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:36,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071941677] [2023-11-22 18:59:36,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:36,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:36,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:36,546 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:36,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 18:59:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:36,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 18:59:36,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-22 18:59:36,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:59:36,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071941677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:36,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:59:36,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-22 18:59:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522339523] [2023-11-22 18:59:36,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:36,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:59:36,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:59:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:59:36,652 INFO L87 Difference]: Start difference. First operand 477 states and 719 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:36,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:36,784 INFO L93 Difference]: Finished difference Result 1211 states and 1915 transitions. [2023-11-22 18:59:36,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 18:59:36,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-22 18:59:36,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:36,787 INFO L225 Difference]: With dead ends: 1211 [2023-11-22 18:59:36,788 INFO L226 Difference]: Without dead ends: 708 [2023-11-22 18:59:36,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:59:36,795 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:36,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 134 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:59:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2023-11-22 18:59:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 614. [2023-11-22 18:59:36,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 1.3833605220228384) internal successors, (848), 613 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 848 transitions. [2023-11-22 18:59:36,809 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 848 transitions. Word has length 29 [2023-11-22 18:59:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:36,811 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 848 transitions. [2023-11-22 18:59:36,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 848 transitions. [2023-11-22 18:59:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 18:59:36,814 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:36,814 INFO L195 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] [2023-11-22 18:59:36,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-22 18:59:37,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:37,026 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:37,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1356275176, now seen corresponding path program 1 times [2023-11-22 18:59:37,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:37,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830731337] [2023-11-22 18:59:37,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:37,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:59:37,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:37,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830731337] [2023-11-22 18:59:37,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830731337] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:37,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396555615] [2023-11-22 18:59:37,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:37,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:37,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:37,100 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:37,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-22 18:59:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:37,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 18:59:37,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-22 18:59:37,206 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:59:37,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396555615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:37,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:59:37,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-22 18:59:37,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176311337] [2023-11-22 18:59:37,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:37,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:59:37,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:37,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:59:37,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:59:37,208 INFO L87 Difference]: Start difference. First operand 614 states and 848 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:37,344 INFO L93 Difference]: Finished difference Result 1446 states and 2075 transitions. [2023-11-22 18:59:37,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 18:59:37,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-11-22 18:59:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:37,349 INFO L225 Difference]: With dead ends: 1446 [2023-11-22 18:59:37,349 INFO L226 Difference]: Without dead ends: 857 [2023-11-22 18:59:37,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:59:37,351 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:37,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:59:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2023-11-22 18:59:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 737. [2023-11-22 18:59:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.3559782608695652) internal successors, (998), 736 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 998 transitions. [2023-11-22 18:59:37,382 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 998 transitions. Word has length 35 [2023-11-22 18:59:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:37,382 INFO L495 AbstractCegarLoop]: Abstraction has 737 states and 998 transitions. [2023-11-22 18:59:37,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 998 transitions. [2023-11-22 18:59:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-22 18:59:37,385 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:37,385 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:37,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-22 18:59:37,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:37,598 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:37,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:37,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1087520423, now seen corresponding path program 1 times [2023-11-22 18:59:37,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:37,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917632194] [2023-11-22 18:59:37,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:37,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-22 18:59:37,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:37,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917632194] [2023-11-22 18:59:37,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917632194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:37,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:59:37,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 18:59:37,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417138229] [2023-11-22 18:59:37,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:37,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 18:59:37,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:37,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 18:59:37,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:59:37,693 INFO L87 Difference]: Start difference. First operand 737 states and 998 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:37,960 INFO L93 Difference]: Finished difference Result 1386 states and 1863 transitions. [2023-11-22 18:59:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-22 18:59:37,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-22 18:59:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:37,964 INFO L225 Difference]: With dead ends: 1386 [2023-11-22 18:59:37,964 INFO L226 Difference]: Without dead ends: 1152 [2023-11-22 18:59:37,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-22 18:59:37,965 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 284 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:37,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 621 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 18:59:37,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2023-11-22 18:59:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 753. [2023-11-22 18:59:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 752 states have (on average 1.3497340425531914) internal successors, (1015), 752 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1015 transitions. [2023-11-22 18:59:37,994 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1015 transitions. Word has length 41 [2023-11-22 18:59:37,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:37,994 INFO L495 AbstractCegarLoop]: Abstraction has 753 states and 1015 transitions. [2023-11-22 18:59:37,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1015 transitions. [2023-11-22 18:59:37,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-22 18:59:37,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:37,996 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:37,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-22 18:59:37,996 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:37,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:37,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1156462875, now seen corresponding path program 1 times [2023-11-22 18:59:37,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:37,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953220710] [2023-11-22 18:59:37,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:37,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-11-22 18:59:38,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:38,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953220710] [2023-11-22 18:59:38,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953220710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:38,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:59:38,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:59:38,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310246076] [2023-11-22 18:59:38,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:38,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 18:59:38,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:38,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 18:59:38,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:59:38,076 INFO L87 Difference]: Start difference. First operand 753 states and 1015 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:38,090 INFO L93 Difference]: Finished difference Result 999 states and 1340 transitions. [2023-11-22 18:59:38,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 18:59:38,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2023-11-22 18:59:38,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:38,092 INFO L225 Difference]: With dead ends: 999 [2023-11-22 18:59:38,092 INFO L226 Difference]: Without dead ends: 340 [2023-11-22 18:59:38,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:59:38,093 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:38,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:59:38,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-11-22 18:59:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2023-11-22 18:59:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.3244837758112094) internal successors, (449), 339 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 449 transitions. [2023-11-22 18:59:38,104 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 449 transitions. Word has length 41 [2023-11-22 18:59:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:38,105 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 449 transitions. [2023-11-22 18:59:38,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 449 transitions. [2023-11-22 18:59:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-22 18:59:38,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:38,106 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:38,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-22 18:59:38,106 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:38,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:38,106 INFO L85 PathProgramCache]: Analyzing trace with hash -160686071, now seen corresponding path program 1 times [2023-11-22 18:59:38,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:38,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036015024] [2023-11-22 18:59:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:38,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-22 18:59:38,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:38,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036015024] [2023-11-22 18:59:38,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036015024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:59:38,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 18:59:38,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466657935] [2023-11-22 18:59:38,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:38,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 18:59:38,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:38,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 18:59:38,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:59:38,204 INFO L87 Difference]: Start difference. First operand 340 states and 449 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:38,319 INFO L93 Difference]: Finished difference Result 738 states and 970 transitions. [2023-11-22 18:59:38,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 18:59:38,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-11-22 18:59:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:38,321 INFO L225 Difference]: With dead ends: 738 [2023-11-22 18:59:38,321 INFO L226 Difference]: Without dead ends: 419 [2023-11-22 18:59:38,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-22 18:59:38,323 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 74 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:38,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 94 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:59:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-11-22 18:59:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 334. [2023-11-22 18:59:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 333 states have (on average 1.3153153153153154) internal successors, (438), 333 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 438 transitions. [2023-11-22 18:59:38,335 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 438 transitions. Word has length 52 [2023-11-22 18:59:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:38,336 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 438 transitions. [2023-11-22 18:59:38,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 438 transitions. [2023-11-22 18:59:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-22 18:59:38,337 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:38,337 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:38,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-22 18:59:38,338 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:38,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1041096760, now seen corresponding path program 1 times [2023-11-22 18:59:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:38,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258998410] [2023-11-22 18:59:38,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-22 18:59:38,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:38,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258998410] [2023-11-22 18:59:38,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258998410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:38,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:59:38,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 18:59:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124657957] [2023-11-22 18:59:38,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:38,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 18:59:38,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:38,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 18:59:38,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:59:38,408 INFO L87 Difference]: Start difference. First operand 334 states and 438 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:38,424 INFO L93 Difference]: Finished difference Result 467 states and 600 transitions. [2023-11-22 18:59:38,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 18:59:38,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-11-22 18:59:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:38,426 INFO L225 Difference]: With dead ends: 467 [2023-11-22 18:59:38,426 INFO L226 Difference]: Without dead ends: 430 [2023-11-22 18:59:38,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 18:59:38,427 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:38,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:59:38,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-11-22 18:59:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 391. [2023-11-22 18:59:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 1.3) internal successors, (507), 390 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 507 transitions. [2023-11-22 18:59:38,438 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 507 transitions. Word has length 60 [2023-11-22 18:59:38,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:38,438 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 507 transitions. [2023-11-22 18:59:38,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 507 transitions. [2023-11-22 18:59:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-22 18:59:38,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:38,439 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:38,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-22 18:59:38,440 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:38,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1858745210, now seen corresponding path program 1 times [2023-11-22 18:59:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:38,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317342769] [2023-11-22 18:59:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 18:59:38,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:38,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317342769] [2023-11-22 18:59:38,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317342769] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:38,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067929533] [2023-11-22 18:59:38,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:38,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:38,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:38,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:38,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-22 18:59:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:38,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 18:59:38,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-22 18:59:38,881 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:59:38,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067929533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:38,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:59:38,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2023-11-22 18:59:38,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34214850] [2023-11-22 18:59:38,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:38,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:59:38,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:38,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:59:38,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-22 18:59:38,883 INFO L87 Difference]: Start difference. First operand 391 states and 507 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:38,937 INFO L93 Difference]: Finished difference Result 807 states and 1044 transitions. [2023-11-22 18:59:38,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 18:59:38,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-11-22 18:59:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:38,939 INFO L225 Difference]: With dead ends: 807 [2023-11-22 18:59:38,939 INFO L226 Difference]: Without dead ends: 403 [2023-11-22 18:59:38,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-22 18:59:38,940 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:38,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 67 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:59:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-11-22 18:59:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 367. [2023-11-22 18:59:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 1.2868852459016393) internal successors, (471), 366 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 471 transitions. [2023-11-22 18:59:38,950 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 471 transitions. Word has length 60 [2023-11-22 18:59:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:38,951 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 471 transitions. [2023-11-22 18:59:38,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 471 transitions. [2023-11-22 18:59:38,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 18:59:38,951 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:38,952 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:38,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-22 18:59:39,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-22 18:59:39,184 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:39,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash 315293426, now seen corresponding path program 1 times [2023-11-22 18:59:39,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:39,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699279923] [2023-11-22 18:59:39,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:39,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:39,300 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-11-22 18:59:39,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:39,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699279923] [2023-11-22 18:59:39,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699279923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:39,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:59:39,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 18:59:39,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533299124] [2023-11-22 18:59:39,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:39,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 18:59:39,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:39,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 18:59:39,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:59:39,302 INFO L87 Difference]: Start difference. First operand 367 states and 471 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:39,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:39,380 INFO L93 Difference]: Finished difference Result 1119 states and 1425 transitions. [2023-11-22 18:59:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 18:59:39,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-11-22 18:59:39,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:39,382 INFO L225 Difference]: With dead ends: 1119 [2023-11-22 18:59:39,382 INFO L226 Difference]: Without dead ends: 778 [2023-11-22 18:59:39,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-22 18:59:39,383 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 157 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:39,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 173 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:59:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2023-11-22 18:59:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 549. [2023-11-22 18:59:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.2773722627737227) internal successors, (700), 548 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 700 transitions. [2023-11-22 18:59:39,399 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 700 transitions. Word has length 67 [2023-11-22 18:59:39,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:39,399 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 700 transitions. [2023-11-22 18:59:39,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 700 transitions. [2023-11-22 18:59:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-22 18:59:39,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:39,400 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:39,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-22 18:59:39,400 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:39,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1310614836, now seen corresponding path program 1 times [2023-11-22 18:59:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:39,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956538355] [2023-11-22 18:59:39,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 18:59:39,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:39,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956538355] [2023-11-22 18:59:39,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956538355] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:39,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743360011] [2023-11-22 18:59:39,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:39,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:39,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:39,693 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:39,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-22 18:59:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:39,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-22 18:59:39,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-22 18:59:39,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:59:39,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743360011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:39,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:59:39,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2023-11-22 18:59:39,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485337034] [2023-11-22 18:59:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:39,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 18:59:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:39,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 18:59:39,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-22 18:59:39,899 INFO L87 Difference]: Start difference. First operand 549 states and 700 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:40,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:40,058 INFO L93 Difference]: Finished difference Result 939 states and 1215 transitions. [2023-11-22 18:59:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 18:59:40,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-11-22 18:59:40,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:40,060 INFO L225 Difference]: With dead ends: 939 [2023-11-22 18:59:40,060 INFO L226 Difference]: Without dead ends: 741 [2023-11-22 18:59:40,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-11-22 18:59:40,061 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 191 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:40,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 706 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:59:40,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2023-11-22 18:59:40,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 699. [2023-11-22 18:59:40,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.2693409742120343) internal successors, (886), 698 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 886 transitions. [2023-11-22 18:59:40,084 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 886 transitions. Word has length 67 [2023-11-22 18:59:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:40,084 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 886 transitions. [2023-11-22 18:59:40,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 886 transitions. [2023-11-22 18:59:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-22 18:59:40,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:40,087 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:40,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-22 18:59:40,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-22 18:59:40,292 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:40,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:40,293 INFO L85 PathProgramCache]: Analyzing trace with hash -667674692, now seen corresponding path program 1 times [2023-11-22 18:59:40,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:40,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357422600] [2023-11-22 18:59:40,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:40,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:40,444 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-22 18:59:40,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:40,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357422600] [2023-11-22 18:59:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357422600] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:40,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102454257] [2023-11-22 18:59:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:40,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:40,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:40,448 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:40,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-22 18:59:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:40,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-22 18:59:40,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:40,638 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-22 18:59:40,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:59:40,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102454257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:40,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:59:40,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2023-11-22 18:59:40,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90476204] [2023-11-22 18:59:40,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:40,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 18:59:40,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:40,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 18:59:40,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-22 18:59:40,641 INFO L87 Difference]: Start difference. First operand 699 states and 886 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:40,782 INFO L93 Difference]: Finished difference Result 951 states and 1226 transitions. [2023-11-22 18:59:40,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 18:59:40,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-11-22 18:59:40,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:40,784 INFO L225 Difference]: With dead ends: 951 [2023-11-22 18:59:40,784 INFO L226 Difference]: Without dead ends: 751 [2023-11-22 18:59:40,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-22 18:59:40,785 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 137 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:40,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 485 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:59:40,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2023-11-22 18:59:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 688. [2023-11-22 18:59:40,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.264919941775837) internal successors, (869), 687 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 869 transitions. [2023-11-22 18:59:40,807 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 869 transitions. Word has length 71 [2023-11-22 18:59:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:40,808 INFO L495 AbstractCegarLoop]: Abstraction has 688 states and 869 transitions. [2023-11-22 18:59:40,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 869 transitions. [2023-11-22 18:59:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-22 18:59:40,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:40,811 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:40,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-22 18:59:41,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:41,016 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:41,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash 64292734, now seen corresponding path program 1 times [2023-11-22 18:59:41,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:41,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894955765] [2023-11-22 18:59:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:41,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-22 18:59:41,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:41,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894955765] [2023-11-22 18:59:41,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894955765] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:41,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447395927] [2023-11-22 18:59:41,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:41,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:41,309 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:41,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-22 18:59:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:41,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-22 18:59:41,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-22 18:59:41,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:59:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-22 18:59:42,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447395927] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:59:42,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:59:42,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-22 18:59:42,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307298895] [2023-11-22 18:59:42,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:59:42,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 18:59:42,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:42,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 18:59:42,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-22 18:59:42,016 INFO L87 Difference]: Start difference. First operand 688 states and 869 transitions. Second operand has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:42,230 INFO L93 Difference]: Finished difference Result 1441 states and 1788 transitions. [2023-11-22 18:59:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 18:59:42,231 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-11-22 18:59:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:42,234 INFO L225 Difference]: With dead ends: 1441 [2023-11-22 18:59:42,234 INFO L226 Difference]: Without dead ends: 775 [2023-11-22 18:59:42,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-11-22 18:59:42,236 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 213 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:42,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 430 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:59:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2023-11-22 18:59:42,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 533. [2023-11-22 18:59:42,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.2424812030075187) internal successors, (661), 532 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 661 transitions. [2023-11-22 18:59:42,260 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 661 transitions. Word has length 71 [2023-11-22 18:59:42,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:42,261 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 661 transitions. [2023-11-22 18:59:42,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.666666666666666) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 661 transitions. [2023-11-22 18:59:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-22 18:59:42,262 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:42,262 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2023-11-22 18:59:42,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-22 18:59:42,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-22 18:59:42,468 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:42,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1987520768, now seen corresponding path program 2 times [2023-11-22 18:59:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:42,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653435327] [2023-11-22 18:59:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 15 proven. 56 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-22 18:59:42,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653435327] [2023-11-22 18:59:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653435327] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457921764] [2023-11-22 18:59:42,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 18:59:42,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:42,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:42,880 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:42,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-22 18:59:43,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 18:59:43,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:59:43,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-22 18:59:43,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-22 18:59:43,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:59:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-22 18:59:43,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457921764] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:59:43,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:59:43,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-11-22 18:59:43,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606111420] [2023-11-22 18:59:43,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:59:43,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-22 18:59:43,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:43,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-22 18:59:43,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2023-11-22 18:59:43,655 INFO L87 Difference]: Start difference. First operand 533 states and 661 transitions. Second operand has 21 states, 21 states have (on average 8.0) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:47,162 INFO L93 Difference]: Finished difference Result 2288 states and 2764 transitions. [2023-11-22 18:59:47,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-22 18:59:47,163 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.0) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-11-22 18:59:47,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:47,169 INFO L225 Difference]: With dead ends: 2288 [2023-11-22 18:59:47,169 INFO L226 Difference]: Without dead ends: 2282 [2023-11-22 18:59:47,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=907, Invalid=4063, Unknown=0, NotChecked=0, Total=4970 [2023-11-22 18:59:47,171 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 399 mSDsluCounter, 2178 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:47,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 2428 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-22 18:59:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2023-11-22 18:59:47,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 808. [2023-11-22 18:59:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 1.265179677819083) internal successors, (1021), 807 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1021 transitions. [2023-11-22 18:59:47,229 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1021 transitions. Word has length 71 [2023-11-22 18:59:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:47,229 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1021 transitions. [2023-11-22 18:59:47,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.0) internal successors, (168), 21 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1021 transitions. [2023-11-22 18:59:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-22 18:59:47,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:47,230 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:47,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-22 18:59:47,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:47,436 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:47,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash 615713470, now seen corresponding path program 3 times [2023-11-22 18:59:47,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:47,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890928199] [2023-11-22 18:59:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:47,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-22 18:59:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:47,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890928199] [2023-11-22 18:59:47,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890928199] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:47,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627163100] [2023-11-22 18:59:47,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 18:59:47,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:47,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:47,763 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:47,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-22 18:59:47,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-22 18:59:47,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 18:59:47,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-22 18:59:47,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-22 18:59:48,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:59:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-22 18:59:48,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627163100] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:59:48,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:59:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2023-11-22 18:59:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646804149] [2023-11-22 18:59:48,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:59:48,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 18:59:48,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:48,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 18:59:48,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2023-11-22 18:59:48,766 INFO L87 Difference]: Start difference. First operand 808 states and 1021 transitions. Second operand has 20 states, 20 states have (on average 7.55) internal successors, (151), 20 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:52,011 INFO L93 Difference]: Finished difference Result 3039 states and 3824 transitions. [2023-11-22 18:59:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-22 18:59:52,017 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.55) internal successors, (151), 20 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-11-22 18:59:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:52,024 INFO L225 Difference]: With dead ends: 3039 [2023-11-22 18:59:52,024 INFO L226 Difference]: Without dead ends: 2875 [2023-11-22 18:59:52,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=916, Invalid=3506, Unknown=0, NotChecked=0, Total=4422 [2023-11-22 18:59:52,027 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 461 mSDsluCounter, 2161 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:52,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 2414 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-22 18:59:52,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2023-11-22 18:59:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 1232. [2023-11-22 18:59:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1232 states, 1231 states have (on average 1.281072298943948) internal successors, (1577), 1231 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1577 transitions. [2023-11-22 18:59:52,090 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1577 transitions. Word has length 71 [2023-11-22 18:59:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:52,090 INFO L495 AbstractCegarLoop]: Abstraction has 1232 states and 1577 transitions. [2023-11-22 18:59:52,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.55) internal successors, (151), 20 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1577 transitions. [2023-11-22 18:59:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-22 18:59:52,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:52,092 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:52,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-22 18:59:52,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:52,297 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:52,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:52,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1059614144, now seen corresponding path program 1 times [2023-11-22 18:59:52,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:52,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979772656] [2023-11-22 18:59:52,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:52,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 18:59:52,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:52,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979772656] [2023-11-22 18:59:52,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979772656] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:52,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228849098] [2023-11-22 18:59:52,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:52,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:52,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:52,615 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:52,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-22 18:59:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:52,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-22 18:59:52,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-22 18:59:52,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:59:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-22 18:59:53,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228849098] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:59:53,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:59:53,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2023-11-22 18:59:53,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201878157] [2023-11-22 18:59:53,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:59:53,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-22 18:59:53,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:53,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-22 18:59:53,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2023-11-22 18:59:53,062 INFO L87 Difference]: Start difference. First operand 1232 states and 1577 transitions. Second operand has 20 states, 20 states have (on average 9.05) internal successors, (181), 19 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:54,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:54,928 INFO L93 Difference]: Finished difference Result 2416 states and 3026 transitions. [2023-11-22 18:59:54,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-22 18:59:54,928 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.05) internal successors, (181), 19 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2023-11-22 18:59:54,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:54,934 INFO L225 Difference]: With dead ends: 2416 [2023-11-22 18:59:54,934 INFO L226 Difference]: Without dead ends: 2408 [2023-11-22 18:59:54,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1618 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1339, Invalid=4667, Unknown=0, NotChecked=0, Total=6006 [2023-11-22 18:59:54,936 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 564 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:54,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 1880 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-22 18:59:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2023-11-22 18:59:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1320. [2023-11-22 18:59:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.2911296436694466) internal successors, (1703), 1319 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1703 transitions. [2023-11-22 18:59:55,007 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1703 transitions. Word has length 71 [2023-11-22 18:59:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:55,008 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1703 transitions. [2023-11-22 18:59:55,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.05) internal successors, (181), 19 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1703 transitions. [2023-11-22 18:59:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-22 18:59:55,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:55,009 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:55,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-22 18:59:55,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-22 18:59:55,215 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:55,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1960049728, now seen corresponding path program 1 times [2023-11-22 18:59:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:55,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834118054] [2023-11-22 18:59:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 18:59:55,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:55,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834118054] [2023-11-22 18:59:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834118054] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:55,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967868148] [2023-11-22 18:59:55,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:55,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:55,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:55,731 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:55,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-22 18:59:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:55,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-22 18:59:55,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-22 18:59:55,989 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 18:59:55,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967868148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:59:55,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-22 18:59:55,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2023-11-22 18:59:55,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563578193] [2023-11-22 18:59:55,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:59:55,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:59:55,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:55,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:59:55,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-22 18:59:55,991 INFO L87 Difference]: Start difference. First operand 1320 states and 1703 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:56,094 INFO L93 Difference]: Finished difference Result 1337 states and 1726 transitions. [2023-11-22 18:59:56,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 18:59:56,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-11-22 18:59:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:56,097 INFO L225 Difference]: With dead ends: 1337 [2023-11-22 18:59:56,097 INFO L226 Difference]: Without dead ends: 1333 [2023-11-22 18:59:56,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-11-22 18:59:56,099 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:56,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 150 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:59:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2023-11-22 18:59:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1326. [2023-11-22 18:59:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1325 states have (on average 1.292075471698113) internal successors, (1712), 1325 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:56,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 1712 transitions. [2023-11-22 18:59:56,165 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 1712 transitions. Word has length 72 [2023-11-22 18:59:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:56,165 INFO L495 AbstractCegarLoop]: Abstraction has 1326 states and 1712 transitions. [2023-11-22 18:59:56,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 1712 transitions. [2023-11-22 18:59:56,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-22 18:59:56,166 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:56,167 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:56,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-22 18:59:56,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-22 18:59:56,372 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:56,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash 633232545, now seen corresponding path program 1 times [2023-11-22 18:59:56,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:56,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736356143] [2023-11-22 18:59:56,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:56,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:59:56,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:59:56,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736356143] [2023-11-22 18:59:56,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736356143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 18:59:56,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63768781] [2023-11-22 18:59:56,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:56,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 18:59:56,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:59:56,510 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 18:59:56,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-22 18:59:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:59:57,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-22 18:59:57,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 18:59:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:59:57,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 18:59:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-22 18:59:57,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63768781] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 18:59:57,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 18:59:57,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 14 [2023-11-22 18:59:57,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61557308] [2023-11-22 18:59:57,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 18:59:57,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-22 18:59:57,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:59:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-22 18:59:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-22 18:59:57,991 INFO L87 Difference]: Start difference. First operand 1326 states and 1712 transitions. Second operand has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:59:58,633 INFO L93 Difference]: Finished difference Result 4244 states and 5303 transitions. [2023-11-22 18:59:58,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-22 18:59:58,634 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2023-11-22 18:59:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:59:58,643 INFO L225 Difference]: With dead ends: 4244 [2023-11-22 18:59:58,643 INFO L226 Difference]: Without dead ends: 4240 [2023-11-22 18:59:58,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=313, Invalid=809, Unknown=0, NotChecked=0, Total=1122 [2023-11-22 18:59:58,645 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 559 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:59:58,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 801 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 18:59:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4240 states. [2023-11-22 18:59:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4240 to 1947. [2023-11-22 18:59:58,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1947 states, 1946 states have (on average 1.367934224049332) internal successors, (2662), 1946 states have internal predecessors, (2662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:58,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 2662 transitions. [2023-11-22 18:59:58,747 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 2662 transitions. Word has length 73 [2023-11-22 18:59:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:59:58,747 INFO L495 AbstractCegarLoop]: Abstraction has 1947 states and 2662 transitions. [2023-11-22 18:59:58,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 18:59:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 2662 transitions. [2023-11-22 18:59:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-22 18:59:58,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:59:58,749 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:58,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-22 18:59:58,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-22 18:59:58,954 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:59:58,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:59:58,955 INFO L85 PathProgramCache]: Analyzing trace with hash 633292127, now seen corresponding path program 1 times [2023-11-22 18:59:58,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:59:58,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999583359] [2023-11-22 18:59:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:59:58,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:59:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 18:59:59,033 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-22 18:59:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-22 18:59:59,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-22 18:59:59,113 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-22 18:59:59,114 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 18:59:59,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-22 18:59:59,119 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:59:59,122 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 18:59:59,169 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-22 18:59:59,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-22 18:59:59,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-22 18:59:59,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated [2023-11-22 18:59:59,170 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-22 18:59:59,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-22 18:59:59,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:59:59 BoogieIcfgContainer [2023-11-22 18:59:59,182 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 18:59:59,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 18:59:59,183 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 18:59:59,183 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 18:59:59,183 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:59:33" (3/4) ... [2023-11-22 18:59:59,185 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-22 18:59:59,186 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 18:59:59,189 INFO L158 Benchmark]: Toolchain (without parser) took 26731.63ms. Allocated memory was 151.0MB in the beginning and 408.9MB in the end (delta: 257.9MB). Free memory was 79.0MB in the beginning and 361.7MB in the end (delta: -282.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 18:59:59,190 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 151.0MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 18:59:59,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.88ms. Allocated memory is still 151.0MB. Free memory was 78.8MB in the beginning and 66.0MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 18:59:59,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.76ms. Allocated memory is still 151.0MB. Free memory was 65.8MB in the beginning and 62.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-22 18:59:59,190 INFO L158 Benchmark]: Boogie Preprocessor took 54.76ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 62.8MB in the beginning and 149.7MB in the end (delta: -86.9MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2023-11-22 18:59:59,190 INFO L158 Benchmark]: RCFGBuilder took 495.74ms. Allocated memory is still 182.5MB. Free memory was 149.6MB in the beginning and 130.7MB in the end (delta: 18.9MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2023-11-22 18:59:59,191 INFO L158 Benchmark]: TraceAbstraction took 25922.64ms. Allocated memory was 182.5MB in the beginning and 408.9MB in the end (delta: 226.5MB). Free memory was 129.7MB in the beginning and 362.8MB in the end (delta: -233.0MB). Peak memory consumption was 224.0MB. Max. memory is 16.1GB. [2023-11-22 18:59:59,192 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 408.9MB. Free memory is still 361.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 18:59:59,196 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.13ms. Allocated memory is still 151.0MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.88ms. Allocated memory is still 151.0MB. Free memory was 78.8MB in the beginning and 66.0MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.76ms. Allocated memory is still 151.0MB. Free memory was 65.8MB in the beginning and 62.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.76ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 62.8MB in the beginning and 149.7MB in the end (delta: -86.9MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * RCFGBuilder took 495.74ms. Allocated memory is still 182.5MB. Free memory was 149.6MB in the beginning and 130.7MB in the end (delta: 18.9MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25922.64ms. Allocated memory was 182.5MB in the beginning and 408.9MB in the end (delta: 226.5MB). Free memory was 129.7MB in the beginning and 362.8MB in the end (delta: -233.0MB). Peak memory consumption was 224.0MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 408.9MB. Free memory is still 361.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 25]: 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 116. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=0, na=4, nb=1, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=1, i=1, na=4, nb=1, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [\old(a)=234770789, \old(b)=155, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=-4294967141, b1=0, b2=0, b3=0, b=155, carry=0, i=4, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254, r3=13] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L25] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.8s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4063 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4063 mSDsluCounter, 12481 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9818 mSDsCounter, 298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7407 IncrementalHoareTripleChecker+Invalid, 7705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 298 mSolverCounterUnsat, 2663 mSDtfsCounter, 7407 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1484 GetRequests, 1112 SyntacticMatches, 10 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4348 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1947occurred in iteration=23, InterpolantAutomatonStates: 294, 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, 23 MinimizatonAttempts, 8640 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1922 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2165 ConstructedInterpolants, 2 QuantifiedInterpolants, 15512 SizeOfPredicates, 44 NumberOfNonLiveVariables, 2225 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 41 InterpolantComputations, 18 PerfectInterpolantSequences, 1372/2161 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 [2023-11-22 18:59:59,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 19:00:01,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 19:00:01,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-22 19:00:01,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 19:00:01,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 19:00:01,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 19:00:01,508 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 19:00:01,508 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 19:00:01,509 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 19:00:01,512 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 19:00:01,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 19:00:01,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 19:00:01,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 19:00:01,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 19:00:01,514 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 19:00:01,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 19:00:01,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 19:00:01,515 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 19:00:01,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 19:00:01,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 19:00:01,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 19:00:01,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 19:00:01,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 19:00:01,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-22 19:00:01,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-22 19:00:01,517 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-22 19:00:01,517 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 19:00:01,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 19:00:01,517 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 19:00:01,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 19:00:01,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 19:00:01,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 19:00:01,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 19:00:01,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 19:00:01,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 19:00:01,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 19:00:01,520 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 19:00:01,520 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-22 19:00:01,521 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-22 19:00:01,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 19:00:01,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 19:00:01,521 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 19:00:01,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 19:00:01,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 19:00:01,522 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-22 19:00:01,522 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2023-11-22 19:00:01,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 19:00:01,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 19:00:01,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 19:00:01,852 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 19:00:01,852 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 19:00:01,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-11-22 19:00:03,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 19:00:03,197 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 19:00:03,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i [2023-11-22 19:00:03,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80fb1746/74c93ad2913b4b3482c950fc14c2776a/FLAG80685f312 [2023-11-22 19:00:03,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80fb1746/74c93ad2913b4b3482c950fc14c2776a [2023-11-22 19:00:03,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 19:00:03,241 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 19:00:03,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 19:00:03,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 19:00:03,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 19:00:03,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4170a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03, skipping insertion in model container [2023-11-22 19:00:03,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,278 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 19:00:03,420 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-11-22 19:00:03,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 19:00:03,480 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 19:00:03,495 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add_1-1.i[1168,1181] [2023-11-22 19:00:03,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 19:00:03,543 INFO L206 MainTranslator]: Completed translation [2023-11-22 19:00:03,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03 WrapperNode [2023-11-22 19:00:03,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 19:00:03,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 19:00:03,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 19:00:03,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 19:00:03,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,581 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2023-11-22 19:00:03,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 19:00:03,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 19:00:03,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 19:00:03,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 19:00:03,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,592 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,598 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 19:00:03,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 19:00:03,610 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 19:00:03,610 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 19:00:03,610 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 19:00:03,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (1/1) ... [2023-11-22 19:00:03,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 19:00:03,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 19:00:03,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 19:00:03,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 19:00:03,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 19:00:03,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-22 19:00:03,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 19:00:03,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 19:00:03,725 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 19:00:03,727 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 19:00:03,927 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 19:00:03,960 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 19:00:03,961 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-22 19:00:03,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:00:03 BoogieIcfgContainer [2023-11-22 19:00:03,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 19:00:03,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 19:00:03,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 19:00:03,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 19:00:03,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:00:03" (1/3) ... [2023-11-22 19:00:03,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d72b5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:00:03, skipping insertion in model container [2023-11-22 19:00:03,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:00:03" (2/3) ... [2023-11-22 19:00:03,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d72b5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:00:03, skipping insertion in model container [2023-11-22 19:00:03,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:00:03" (3/3) ... [2023-11-22 19:00:03,968 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2023-11-22 19:00:03,981 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 19:00:03,981 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 19:00:04,023 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 19:00:04,028 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@fc5f364, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 19:00:04,028 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 19:00:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 19:00:04,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:04,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:04,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:04,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:04,043 INFO L85 PathProgramCache]: Analyzing trace with hash 459643034, now seen corresponding path program 1 times [2023-11-22 19:00:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:04,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348160478] [2023-11-22 19:00:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:04,065 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 [2023-11-22 19:00:04,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:04,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:04,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-22 19:00:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:04,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-22 19:00:04,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:04,155 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:00:04,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348160478] [2023-11-22 19:00:04,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348160478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:00:04,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:00:04,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 19:00:04,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516867066] [2023-11-22 19:00:04,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:00:04,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 19:00:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:04,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 19:00:04,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 19:00:04,190 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:04,213 INFO L93 Difference]: Finished difference Result 50 states and 85 transitions. [2023-11-22 19:00:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 19:00:04,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-22 19:00:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:04,221 INFO L225 Difference]: With dead ends: 50 [2023-11-22 19:00:04,221 INFO L226 Difference]: Without dead ends: 36 [2023-11-22 19:00:04,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 19:00:04,226 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:04,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:00:04,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-22 19:00:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-11-22 19:00:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:04,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2023-11-22 19:00:04,255 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 10 [2023-11-22 19:00:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:04,256 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2023-11-22 19:00:04,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2023-11-22 19:00:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-22 19:00:04,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:04,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:04,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:04,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:04,460 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:04,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:04,461 INFO L85 PathProgramCache]: Analyzing trace with hash 371044600, now seen corresponding path program 1 times [2023-11-22 19:00:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550578683] [2023-11-22 19:00:04,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:04,462 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 [2023-11-22 19:00:04,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:04,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:04,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-22 19:00:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:04,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:00:04,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:04,538 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:00:04,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550578683] [2023-11-22 19:00:04,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550578683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:00:04,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:00:04,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 19:00:04,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797222387] [2023-11-22 19:00:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:00:04,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 19:00:04,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:04,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 19:00:04,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 19:00:04,540 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:04,638 INFO L93 Difference]: Finished difference Result 109 states and 195 transitions. [2023-11-22 19:00:04,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 19:00:04,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-22 19:00:04,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:04,639 INFO L225 Difference]: With dead ends: 109 [2023-11-22 19:00:04,639 INFO L226 Difference]: Without dead ends: 82 [2023-11-22 19:00:04,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 19:00:04,641 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 88 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:04,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 122 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:00:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-22 19:00:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2023-11-22 19:00:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.641025641025641) internal successors, (128), 78 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:04,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 128 transitions. [2023-11-22 19:00:04,655 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 128 transitions. Word has length 10 [2023-11-22 19:00:04,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:04,655 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 128 transitions. [2023-11-22 19:00:04,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:04,656 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 128 transitions. [2023-11-22 19:00:04,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 19:00:04,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:04,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:04,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:04,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:04,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:04,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:04,859 INFO L85 PathProgramCache]: Analyzing trace with hash -450690481, now seen corresponding path program 1 times [2023-11-22 19:00:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:04,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315255966] [2023-11-22 19:00:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:04,860 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 [2023-11-22 19:00:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:04,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:04,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 19:00:04,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:04,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-22 19:00:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:04,929 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:00:04,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:04,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315255966] [2023-11-22 19:00:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315255966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:00:04,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:00:04,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 19:00:04,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766375280] [2023-11-22 19:00:04,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:00:04,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:00:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:04,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:00:04,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:00:04,932 INFO L87 Difference]: Start difference. First operand 79 states and 128 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:05,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:05,046 INFO L93 Difference]: Finished difference Result 153 states and 262 transitions. [2023-11-22 19:00:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 19:00:05,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-22 19:00:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:05,052 INFO L225 Difference]: With dead ends: 153 [2023-11-22 19:00:05,053 INFO L226 Difference]: Without dead ends: 126 [2023-11-22 19:00:05,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:00:05,056 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 134 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:05,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 254 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:00:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-22 19:00:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 79. [2023-11-22 19:00:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.641025641025641) internal successors, (128), 78 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 128 transitions. [2023-11-22 19:00:05,072 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 128 transitions. Word has length 11 [2023-11-22 19:00:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:05,073 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 128 transitions. [2023-11-22 19:00:05,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 128 transitions. [2023-11-22 19:00:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-22 19:00:05,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:05,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:05,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-22 19:00:05,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:05,277 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:05,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:05,277 INFO L85 PathProgramCache]: Analyzing trace with hash -950257841, now seen corresponding path program 1 times [2023-11-22 19:00:05,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:05,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383166493] [2023-11-22 19:00:05,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:05,279 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 [2023-11-22 19:00:05,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:05,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:05,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-22 19:00:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:05,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 19:00:05,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:05,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:05,342 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:00:05,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:05,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383166493] [2023-11-22 19:00:05,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383166493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:00:05,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:00:05,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 19:00:05,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415303141] [2023-11-22 19:00:05,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:00:05,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 19:00:05,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:05,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 19:00:05,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 19:00:05,344 INFO L87 Difference]: Start difference. First operand 79 states and 128 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:05,493 INFO L93 Difference]: Finished difference Result 197 states and 329 transitions. [2023-11-22 19:00:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:00:05,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-22 19:00:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:05,495 INFO L225 Difference]: With dead ends: 197 [2023-11-22 19:00:05,495 INFO L226 Difference]: Without dead ends: 170 [2023-11-22 19:00:05,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 19:00:05,499 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 180 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:05,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 479 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:00:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-22 19:00:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 79. [2023-11-22 19:00:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.641025641025641) internal successors, (128), 78 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 128 transitions. [2023-11-22 19:00:05,514 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 128 transitions. Word has length 12 [2023-11-22 19:00:05,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:05,514 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 128 transitions. [2023-11-22 19:00:05,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 128 transitions. [2023-11-22 19:00:05,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-22 19:00:05,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:05,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:05,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:05,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:05,716 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:05,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1569702093, now seen corresponding path program 1 times [2023-11-22 19:00:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:05,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545262263] [2023-11-22 19:00:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:05,717 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 [2023-11-22 19:00:05,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:05,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:05,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-22 19:00:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:05,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:00:05,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:05,883 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:00:05,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:05,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545262263] [2023-11-22 19:00:05,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545262263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:00:05,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:00:05,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 19:00:05,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829032154] [2023-11-22 19:00:05,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:00:05,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 19:00:05,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:05,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 19:00:05,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 19:00:05,884 INFO L87 Difference]: Start difference. First operand 79 states and 128 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:06,071 INFO L93 Difference]: Finished difference Result 212 states and 342 transitions. [2023-11-22 19:00:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:00:06,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-22 19:00:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:06,072 INFO L225 Difference]: With dead ends: 212 [2023-11-22 19:00:06,072 INFO L226 Difference]: Without dead ends: 185 [2023-11-22 19:00:06,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-22 19:00:06,073 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 218 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:06,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 619 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 19:00:06,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-11-22 19:00:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 85. [2023-11-22 19:00:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.5119047619047619) internal successors, (127), 84 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2023-11-22 19:00:06,090 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 12 [2023-11-22 19:00:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:06,090 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2023-11-22 19:00:06,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2023-11-22 19:00:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 19:00:06,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:06,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:06,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-22 19:00:06,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:06,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:06,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:06,292 INFO L85 PathProgramCache]: Analyzing trace with hash -171126915, now seen corresponding path program 1 times [2023-11-22 19:00:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:06,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877819307] [2023-11-22 19:00:06,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:06,292 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 [2023-11-22 19:00:06,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:06,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:06,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-22 19:00:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:06,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 19:00:06,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:06,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:06,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:00:06,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:06,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877819307] [2023-11-22 19:00:06,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877819307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:00:06,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:00:06,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 19:00:06,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151354346] [2023-11-22 19:00:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:00:06,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 19:00:06,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:06,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 19:00:06,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 19:00:06,375 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:06,441 INFO L93 Difference]: Finished difference Result 236 states and 352 transitions. [2023-11-22 19:00:06,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 19:00:06,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-22 19:00:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:06,442 INFO L225 Difference]: With dead ends: 236 [2023-11-22 19:00:06,442 INFO L226 Difference]: Without dead ends: 167 [2023-11-22 19:00:06,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-22 19:00:06,443 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 89 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:06,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 137 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:00:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-22 19:00:06,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 95. [2023-11-22 19:00:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4893617021276595) internal successors, (140), 94 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:06,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 140 transitions. [2023-11-22 19:00:06,448 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 140 transitions. Word has length 23 [2023-11-22 19:00:06,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:06,449 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 140 transitions. [2023-11-22 19:00:06,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:06,449 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 140 transitions. [2023-11-22 19:00:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-22 19:00:06,449 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:06,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:06,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:06,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:06,652 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:06,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:06,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1205485431, now seen corresponding path program 1 times [2023-11-22 19:00:06,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:06,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515173165] [2023-11-22 19:00:06,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:06,653 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 [2023-11-22 19:00:06,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:06,654 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:06,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-22 19:00:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:06,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 19:00:06,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-22 19:00:06,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:00:06,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:06,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515173165] [2023-11-22 19:00:06,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515173165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:00:06,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:00:06,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 19:00:06,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095581405] [2023-11-22 19:00:06,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:00:06,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 19:00:06,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:06,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 19:00:06,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 19:00:06,722 INFO L87 Difference]: Start difference. First operand 95 states and 140 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:06,730 INFO L93 Difference]: Finished difference Result 166 states and 245 transitions. [2023-11-22 19:00:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 19:00:06,730 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-22 19:00:06,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:06,731 INFO L225 Difference]: With dead ends: 166 [2023-11-22 19:00:06,731 INFO L226 Difference]: Without dead ends: 83 [2023-11-22 19:00:06,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 19:00:06,731 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 53 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:06,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 55 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 19:00:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-22 19:00:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-22 19:00:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 82 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2023-11-22 19:00:06,735 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 24 [2023-11-22 19:00:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:06,735 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2023-11-22 19:00:06,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2023-11-22 19:00:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-22 19:00:06,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:06,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:06,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:06,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:06,953 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:06,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:06,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1173091825, now seen corresponding path program 1 times [2023-11-22 19:00:06,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:06,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697182943] [2023-11-22 19:00:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:06,953 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 [2023-11-22 19:00:06,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:06,954 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:06,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-22 19:00:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:07,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 19:00:07,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:07,057 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:00:07,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:07,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697182943] [2023-11-22 19:00:07,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697182943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:00:07,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:00:07,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 19:00:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580984024] [2023-11-22 19:00:07,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:00:07,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:00:07,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:07,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:00:07,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:00:07,059 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:07,170 INFO L93 Difference]: Finished difference Result 195 states and 296 transitions. [2023-11-22 19:00:07,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 19:00:07,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-22 19:00:07,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:07,171 INFO L225 Difference]: With dead ends: 195 [2023-11-22 19:00:07,172 INFO L226 Difference]: Without dead ends: 152 [2023-11-22 19:00:07,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:00:07,172 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 88 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:07,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 100 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:00:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-22 19:00:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2023-11-22 19:00:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.4189189189189189) internal successors, (210), 148 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 210 transitions. [2023-11-22 19:00:07,178 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 210 transitions. Word has length 27 [2023-11-22 19:00:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:07,179 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 210 transitions. [2023-11-22 19:00:07,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 210 transitions. [2023-11-22 19:00:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-22 19:00:07,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:07,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:07,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:07,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:07,384 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:07,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:07,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1213817478, now seen corresponding path program 1 times [2023-11-22 19:00:07,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:07,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796543879] [2023-11-22 19:00:07,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:07,386 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 [2023-11-22 19:00:07,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:07,387 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:07,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-22 19:00:07,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 19:00:07,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:07,490 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:00:07,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796543879] [2023-11-22 19:00:07,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796543879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:00:07,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:00:07,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 19:00:07,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82268518] [2023-11-22 19:00:07,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:00:07,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 19:00:07,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:07,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 19:00:07,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 19:00:07,491 INFO L87 Difference]: Start difference. First operand 149 states and 210 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:07,619 INFO L93 Difference]: Finished difference Result 262 states and 387 transitions. [2023-11-22 19:00:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 19:00:07,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-22 19:00:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:07,621 INFO L225 Difference]: With dead ends: 262 [2023-11-22 19:00:07,621 INFO L226 Difference]: Without dead ends: 219 [2023-11-22 19:00:07,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 19:00:07,621 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 134 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:07,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 201 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:00:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-22 19:00:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 149. [2023-11-22 19:00:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.4189189189189189) internal successors, (210), 148 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:07,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 210 transitions. [2023-11-22 19:00:07,626 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 210 transitions. Word has length 28 [2023-11-22 19:00:07,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:07,627 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 210 transitions. [2023-11-22 19:00:07,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:07,627 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 210 transitions. [2023-11-22 19:00:07,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 19:00:07,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:07,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:07,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-22 19:00:07,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:07,829 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:07,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1570895750, now seen corresponding path program 1 times [2023-11-22 19:00:07,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:07,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784076410] [2023-11-22 19:00:07,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:07,830 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 [2023-11-22 19:00:07,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:07,831 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:07,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-22 19:00:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:07,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:00:07,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:07,929 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:00:07,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:07,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784076410] [2023-11-22 19:00:07,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784076410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:00:07,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:00:07,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-22 19:00:07,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334995519] [2023-11-22 19:00:07,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:00:07,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 19:00:07,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:07,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 19:00:07,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-22 19:00:07,931 INFO L87 Difference]: Start difference. First operand 149 states and 210 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:08,215 INFO L93 Difference]: Finished difference Result 295 states and 427 transitions. [2023-11-22 19:00:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 19:00:08,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-22 19:00:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:08,216 INFO L225 Difference]: With dead ends: 295 [2023-11-22 19:00:08,216 INFO L226 Difference]: Without dead ends: 252 [2023-11-22 19:00:08,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-22 19:00:08,217 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 158 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:08,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 416 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 19:00:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-11-22 19:00:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 115. [2023-11-22 19:00:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 159 transitions. [2023-11-22 19:00:08,222 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 159 transitions. Word has length 29 [2023-11-22 19:00:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:08,222 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 159 transitions. [2023-11-22 19:00:08,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2023-11-22 19:00:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-22 19:00:08,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:08,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:08,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:08,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:08,425 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:08,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:08,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1436882244, now seen corresponding path program 1 times [2023-11-22 19:00:08,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:08,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535911248] [2023-11-22 19:00:08,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:08,425 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 [2023-11-22 19:00:08,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:08,426 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:08,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-22 19:00:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:08,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 19:00:08,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:08,513 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 19:00:08,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535911248] [2023-11-22 19:00:08,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535911248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 19:00:08,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 19:00:08,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 19:00:08,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438115707] [2023-11-22 19:00:08,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 19:00:08,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 19:00:08,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:08,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 19:00:08,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:00:08,515 INFO L87 Difference]: Start difference. First operand 115 states and 159 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:08,615 INFO L93 Difference]: Finished difference Result 241 states and 343 transitions. [2023-11-22 19:00:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-22 19:00:08,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-22 19:00:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:08,616 INFO L225 Difference]: With dead ends: 241 [2023-11-22 19:00:08,616 INFO L226 Difference]: Without dead ends: 139 [2023-11-22 19:00:08,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 19:00:08,617 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 91 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:08,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 50 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:00:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-22 19:00:08,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 119. [2023-11-22 19:00:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.3389830508474576) internal successors, (158), 118 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 158 transitions. [2023-11-22 19:00:08,621 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 158 transitions. Word has length 29 [2023-11-22 19:00:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:08,621 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 158 transitions. [2023-11-22 19:00:08,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 158 transitions. [2023-11-22 19:00:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-22 19:00:08,622 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:08,622 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 19:00:08,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:08,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:08,825 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:08,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:08,826 INFO L85 PathProgramCache]: Analyzing trace with hash -446900071, now seen corresponding path program 1 times [2023-11-22 19:00:08,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:08,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587619537] [2023-11-22 19:00:08,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:08,826 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 [2023-11-22 19:00:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:08,827 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:08,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-22 19:00:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:08,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 19:00:08,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:08,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:00:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:09,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:09,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587619537] [2023-11-22 19:00:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587619537] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:00:09,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:00:09,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-22 19:00:09,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114308840] [2023-11-22 19:00:09,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 19:00:09,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 19:00:09,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:09,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 19:00:09,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:00:09,003 INFO L87 Difference]: Start difference. First operand 119 states and 158 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:09,187 INFO L93 Difference]: Finished difference Result 405 states and 555 transitions. [2023-11-22 19:00:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 19:00:09,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-11-22 19:00:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:09,189 INFO L225 Difference]: With dead ends: 405 [2023-11-22 19:00:09,189 INFO L226 Difference]: Without dead ends: 300 [2023-11-22 19:00:09,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2023-11-22 19:00:09,189 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 281 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:09,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 348 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:00:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-22 19:00:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 155. [2023-11-22 19:00:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4090909090909092) internal successors, (217), 154 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 217 transitions. [2023-11-22 19:00:09,197 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 217 transitions. Word has length 42 [2023-11-22 19:00:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:09,197 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 217 transitions. [2023-11-22 19:00:09,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 217 transitions. [2023-11-22 19:00:09,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-22 19:00:09,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:09,198 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-22 19:00:09,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:09,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:09,400 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:09,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:09,401 INFO L85 PathProgramCache]: Analyzing trace with hash 254164507, now seen corresponding path program 1 times [2023-11-22 19:00:09,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:09,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312738725] [2023-11-22 19:00:09,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:09,401 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 [2023-11-22 19:00:09,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:09,402 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:09,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-22 19:00:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:09,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 19:00:09,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:09,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:00:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:09,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:09,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312738725] [2023-11-22 19:00:09,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312738725] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:00:09,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:00:09,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-22 19:00:09,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15173838] [2023-11-22 19:00:09,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 19:00:09,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 19:00:09,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:09,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 19:00:09,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:00:09,605 INFO L87 Difference]: Start difference. First operand 155 states and 217 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:09,874 INFO L93 Difference]: Finished difference Result 484 states and 755 transitions. [2023-11-22 19:00:09,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-22 19:00:09,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-11-22 19:00:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:09,876 INFO L225 Difference]: With dead ends: 484 [2023-11-22 19:00:09,876 INFO L226 Difference]: Without dead ends: 342 [2023-11-22 19:00:09,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2023-11-22 19:00:09,877 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 266 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:09,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 79 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-22 19:00:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-22 19:00:09,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 302. [2023-11-22 19:00:09,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 436 transitions. [2023-11-22 19:00:09,889 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 436 transitions. Word has length 42 [2023-11-22 19:00:09,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:09,889 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 436 transitions. [2023-11-22 19:00:09,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:09,889 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 436 transitions. [2023-11-22 19:00:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-22 19:00:09,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:09,890 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-22 19:00:09,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:10,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:10,093 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:10,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash 12185717, now seen corresponding path program 1 times [2023-11-22 19:00:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093534585] [2023-11-22 19:00:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:10,094 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 [2023-11-22 19:00:10,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:10,095 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:10,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-22 19:00:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:10,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-22 19:00:10,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 19:00:10,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:00:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 19:00:10,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:10,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093534585] [2023-11-22 19:00:10,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093534585] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:00:10,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:00:10,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-22 19:00:10,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38639186] [2023-11-22 19:00:10,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 19:00:10,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 19:00:10,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:10,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 19:00:10,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-22 19:00:10,292 INFO L87 Difference]: Start difference. First operand 302 states and 436 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:10,453 INFO L93 Difference]: Finished difference Result 739 states and 1017 transitions. [2023-11-22 19:00:10,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-22 19:00:10,454 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-11-22 19:00:10,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:10,455 INFO L225 Difference]: With dead ends: 739 [2023-11-22 19:00:10,455 INFO L226 Difference]: Without dead ends: 451 [2023-11-22 19:00:10,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-11-22 19:00:10,456 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 196 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:10,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 299 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 19:00:10,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-11-22 19:00:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 278. [2023-11-22 19:00:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.3898916967509025) internal successors, (385), 277 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 385 transitions. [2023-11-22 19:00:10,469 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 385 transitions. Word has length 68 [2023-11-22 19:00:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:10,469 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 385 transitions. [2023-11-22 19:00:10,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 385 transitions. [2023-11-22 19:00:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-22 19:00:10,470 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:10,470 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:10,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:10,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:10,675 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:10,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:10,676 INFO L85 PathProgramCache]: Analyzing trace with hash -121827789, now seen corresponding path program 2 times [2023-11-22 19:00:10,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:10,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312051512] [2023-11-22 19:00:10,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 19:00:10,676 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 [2023-11-22 19:00:10,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:10,677 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:10,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-22 19:00:10,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 19:00:10,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 19:00:10,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-22 19:00:10,719 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:12,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:00:14,553 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:14,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:14,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312051512] [2023-11-22 19:00:14,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312051512] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:00:14,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:00:14,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2023-11-22 19:00:14,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331854819] [2023-11-22 19:00:14,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 19:00:14,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-22 19:00:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-22 19:00:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2023-11-22 19:00:14,555 INFO L87 Difference]: Start difference. First operand 278 states and 385 transitions. Second operand has 42 states, 42 states have (on average 3.2142857142857144) internal successors, (135), 41 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:23,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:23,720 INFO L93 Difference]: Finished difference Result 1662 states and 2238 transitions. [2023-11-22 19:00:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-22 19:00:23,720 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.2142857142857144) internal successors, (135), 41 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-11-22 19:00:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:23,724 INFO L225 Difference]: With dead ends: 1662 [2023-11-22 19:00:23,724 INFO L226 Difference]: Without dead ends: 1548 [2023-11-22 19:00:23,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2141, Invalid=10515, Unknown=0, NotChecked=0, Total=12656 [2023-11-22 19:00:23,728 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 1986 mSDsluCounter, 7043 mSDsCounter, 0 mSdLazyCounter, 4161 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1986 SdHoareTripleChecker+Valid, 7428 SdHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 4161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:23,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1986 Valid, 7428 Invalid, 4235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 4161 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-22 19:00:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2023-11-22 19:00:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 547. [2023-11-22 19:00:23,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.413919413919414) internal successors, (772), 546 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:23,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 772 transitions. [2023-11-22 19:00:23,765 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 772 transitions. Word has length 68 [2023-11-22 19:00:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:23,765 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 772 transitions. [2023-11-22 19:00:23,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.2142857142857144) internal successors, (135), 41 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 772 transitions. [2023-11-22 19:00:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-22 19:00:23,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:23,767 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:23,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-22 19:00:23,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:23,969 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:23,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:23,970 INFO L85 PathProgramCache]: Analyzing trace with hash -757023828, now seen corresponding path program 1 times [2023-11-22 19:00:23,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:23,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862309532] [2023-11-22 19:00:23,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:23,970 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 [2023-11-22 19:00:23,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:23,971 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:23,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-22 19:00:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:24,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 19:00:24,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 19:00:24,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:00:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-22 19:00:24,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862309532] [2023-11-22 19:00:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862309532] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:00:24,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:00:24,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-22 19:00:24,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055670660] [2023-11-22 19:00:24,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 19:00:24,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-22 19:00:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:24,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-22 19:00:24,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-22 19:00:24,165 INFO L87 Difference]: Start difference. First operand 547 states and 772 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:00:24,573 INFO L93 Difference]: Finished difference Result 1167 states and 1665 transitions. [2023-11-22 19:00:24,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-22 19:00:24,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2023-11-22 19:00:24,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:00:24,594 INFO L225 Difference]: With dead ends: 1167 [2023-11-22 19:00:24,595 INFO L226 Difference]: Without dead ends: 985 [2023-11-22 19:00:24,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2023-11-22 19:00:24,596 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 267 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-22 19:00:24,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 143 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-22 19:00:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2023-11-22 19:00:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 852. [2023-11-22 19:00:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.4230317273795534) internal successors, (1211), 851 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1211 transitions. [2023-11-22 19:00:24,666 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1211 transitions. Word has length 70 [2023-11-22 19:00:24,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:00:24,666 INFO L495 AbstractCegarLoop]: Abstraction has 852 states and 1211 transitions. [2023-11-22 19:00:24,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:00:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1211 transitions. [2023-11-22 19:00:24,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-22 19:00:24,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:00:24,667 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:00:24,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-22 19:00:24,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:00:24,870 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:00:24,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:00:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash -753152637, now seen corresponding path program 1 times [2023-11-22 19:00:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:00:24,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813672220] [2023-11-22 19:00:24,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:00:24,871 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 [2023-11-22 19:00:24,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:00:24,872 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:00:24,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-22 19:00:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:00:24,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-22 19:00:24,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:00:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:26,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:00:29,038 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:00:29,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:00:29,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813672220] [2023-11-22 19:00:29,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813672220] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:00:29,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:00:29,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2023-11-22 19:00:29,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827707438] [2023-11-22 19:00:29,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 19:00:29,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-22 19:00:29,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:00:29,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-22 19:00:29,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1748, Unknown=0, NotChecked=0, Total=1892 [2023-11-22 19:00:29,041 INFO L87 Difference]: Start difference. First operand 852 states and 1211 transitions. Second operand has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:01:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:01:05,858 INFO L93 Difference]: Finished difference Result 6294 states and 8491 transitions. [2023-11-22 19:01:05,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2023-11-22 19:01:05,859 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-11-22 19:01:05,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:01:05,871 INFO L225 Difference]: With dead ends: 6294 [2023-11-22 19:01:05,871 INFO L226 Difference]: Without dead ends: 5991 [2023-11-22 19:01:05,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19814 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=7666, Invalid=53096, Unknown=0, NotChecked=0, Total=60762 [2023-11-22 19:01:05,880 INFO L413 NwaCegarLoop]: 845 mSDtfsCounter, 3428 mSDsluCounter, 14496 mSDsCounter, 0 mSdLazyCounter, 8977 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3428 SdHoareTripleChecker+Valid, 15341 SdHoareTripleChecker+Invalid, 9445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 8977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-22 19:01:05,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3428 Valid, 15341 Invalid, 9445 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [468 Valid, 8977 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-11-22 19:01:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5991 states. [2023-11-22 19:01:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5991 to 3130. [2023-11-22 19:01:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3130 states, 3129 states have (on average 1.4429530201342282) internal successors, (4515), 3129 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:01:06,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3130 states to 3130 states and 4515 transitions. [2023-11-22 19:01:06,153 INFO L78 Accepts]: Start accepts. Automaton has 3130 states and 4515 transitions. Word has length 72 [2023-11-22 19:01:06,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:01:06,154 INFO L495 AbstractCegarLoop]: Abstraction has 3130 states and 4515 transitions. [2023-11-22 19:01:06,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:01:06,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3130 states and 4515 transitions. [2023-11-22 19:01:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-22 19:01:06,156 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:01:06,157 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:01:06,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-11-22 19:01:06,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:01:06,360 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:01:06,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:01:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash 782397891, now seen corresponding path program 1 times [2023-11-22 19:01:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:01:06,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534541710] [2023-11-22 19:01:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:01:06,362 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 [2023-11-22 19:01:06,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:01:06,363 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:01:06,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-22 19:01:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:01:06,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-22 19:01:06,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:01:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:01:08,745 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:01:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:01:10,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:01:10,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534541710] [2023-11-22 19:01:10,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534541710] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:01:10,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:01:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2023-11-22 19:01:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738016618] [2023-11-22 19:01:10,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 19:01:10,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-22 19:01:10,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:01:10,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-22 19:01:10,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1760, Unknown=0, NotChecked=0, Total=1892 [2023-11-22 19:01:10,600 INFO L87 Difference]: Start difference. First operand 3130 states and 4515 transitions. Second operand has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:01:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:01:30,962 INFO L93 Difference]: Finished difference Result 9239 states and 12980 transitions. [2023-11-22 19:01:30,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2023-11-22 19:01:30,964 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2023-11-22 19:01:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:01:30,980 INFO L225 Difference]: With dead ends: 9239 [2023-11-22 19:01:30,981 INFO L226 Difference]: Without dead ends: 6820 [2023-11-22 19:01:30,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=2493, Invalid=17813, Unknown=0, NotChecked=0, Total=20306 [2023-11-22 19:01:30,986 INFO L413 NwaCegarLoop]: 507 mSDtfsCounter, 1865 mSDsluCounter, 10730 mSDsCounter, 0 mSdLazyCounter, 6650 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1865 SdHoareTripleChecker+Valid, 11237 SdHoareTripleChecker+Invalid, 6784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 6650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-11-22 19:01:30,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1865 Valid, 11237 Invalid, 6784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 6650 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2023-11-22 19:01:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6820 states. [2023-11-22 19:01:31,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6820 to 3630. [2023-11-22 19:01:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3630 states, 3629 states have (on average 1.450261780104712) internal successors, (5263), 3629 states have internal predecessors, (5263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:01:31,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3630 states to 3630 states and 5263 transitions. [2023-11-22 19:01:31,241 INFO L78 Accepts]: Start accepts. Automaton has 3630 states and 5263 transitions. Word has length 72 [2023-11-22 19:01:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:01:31,242 INFO L495 AbstractCegarLoop]: Abstraction has 3630 states and 5263 transitions. [2023-11-22 19:01:31,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.25) internal successors, (143), 43 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:01:31,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3630 states and 5263 transitions. [2023-11-22 19:01:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-22 19:01:31,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:01:31,245 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:01:31,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-22 19:01:31,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:01:31,448 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:01:31,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:01:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash -967599070, now seen corresponding path program 1 times [2023-11-22 19:01:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:01:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214651813] [2023-11-22 19:01:31,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:01:31,449 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 [2023-11-22 19:01:31,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:01:31,450 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:01:31,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-22 19:01:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:01:31,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-22 19:01:31,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:01:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 23 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:01:31,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:01:31,650 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 23 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:01:31,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:01:31,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214651813] [2023-11-22 19:01:31,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214651813] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:01:31,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:01:31,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-11-22 19:01:31,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147596719] [2023-11-22 19:01:31,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 19:01:31,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-22 19:01:31,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:01:31,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-22 19:01:31,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-22 19:01:31,657 INFO L87 Difference]: Start difference. First operand 3630 states and 5263 transitions. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:01:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:01:32,861 INFO L93 Difference]: Finished difference Result 13598 states and 21694 transitions. [2023-11-22 19:01:32,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-22 19:01:32,861 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2023-11-22 19:01:32,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:01:32,879 INFO L225 Difference]: With dead ends: 13598 [2023-11-22 19:01:32,880 INFO L226 Difference]: Without dead ends: 6782 [2023-11-22 19:01:32,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-11-22 19:01:32,886 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 329 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 19:01:32,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 124 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 19:01:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6782 states. [2023-11-22 19:01:33,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6782 to 5665. [2023-11-22 19:01:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5665 states, 5664 states have (on average 1.2346398305084745) internal successors, (6993), 5664 states have internal predecessors, (6993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:01:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5665 states to 5665 states and 6993 transitions. [2023-11-22 19:01:33,339 INFO L78 Accepts]: Start accepts. Automaton has 5665 states and 6993 transitions. Word has length 74 [2023-11-22 19:01:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:01:33,340 INFO L495 AbstractCegarLoop]: Abstraction has 5665 states and 6993 transitions. [2023-11-22 19:01:33,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:01:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 5665 states and 6993 transitions. [2023-11-22 19:01:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-22 19:01:33,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:01:33,341 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:01:33,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-22 19:01:33,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:01:33,544 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:01:33,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:01:33,544 INFO L85 PathProgramCache]: Analyzing trace with hash -459659335, now seen corresponding path program 1 times [2023-11-22 19:01:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:01:33,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431042351] [2023-11-22 19:01:33,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 19:01:33,545 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 [2023-11-22 19:01:33,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:01:33,546 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:01:33,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-22 19:01:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 19:01:33,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-22 19:01:33,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:01:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:01:36,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:01:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:01:39,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:01:39,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431042351] [2023-11-22 19:01:39,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431042351] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:01:39,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:01:39,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-11-22 19:01:39,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013412260] [2023-11-22 19:01:39,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 19:01:39,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-22 19:01:39,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:01:39,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-22 19:01:39,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2086, Unknown=0, NotChecked=0, Total=2256 [2023-11-22 19:01:39,211 INFO L87 Difference]: Start difference. First operand 5665 states and 6993 transitions. Second operand has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:02:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:02:21,174 INFO L93 Difference]: Finished difference Result 8239 states and 10024 transitions. [2023-11-22 19:02:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2023-11-22 19:02:21,175 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2023-11-22 19:02:21,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:02:21,201 INFO L225 Difference]: With dead ends: 8239 [2023-11-22 19:02:21,201 INFO L226 Difference]: Without dead ends: 7988 [2023-11-22 19:02:21,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13768 ImplicationChecksByTransitivity, 37.7s TimeCoverageRelationStatistics Valid=6147, Invalid=41159, Unknown=0, NotChecked=0, Total=47306 [2023-11-22 19:02:21,224 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 2556 mSDsluCounter, 10056 mSDsCounter, 0 mSdLazyCounter, 6011 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 10488 SdHoareTripleChecker+Invalid, 6381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 6011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-22 19:02:21,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 10488 Invalid, 6381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 6011 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-11-22 19:02:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7988 states. [2023-11-22 19:02:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7988 to 6764. [2023-11-22 19:02:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6764 states, 6763 states have (on average 1.2336241313026763) internal successors, (8343), 6763 states have internal predecessors, (8343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:02:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6764 states to 6764 states and 8343 transitions. [2023-11-22 19:02:21,968 INFO L78 Accepts]: Start accepts. Automaton has 6764 states and 8343 transitions. Word has length 75 [2023-11-22 19:02:21,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:02:21,968 INFO L495 AbstractCegarLoop]: Abstraction has 6764 states and 8343 transitions. [2023-11-22 19:02:21,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:02:21,968 INFO L276 IsEmpty]: Start isEmpty. Operand 6764 states and 8343 transitions. [2023-11-22 19:02:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-22 19:02:21,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:02:21,979 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:02:21,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-11-22 19:02:22,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:02:22,182 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:02:22,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:02:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash -170026119, now seen corresponding path program 2 times [2023-11-22 19:02:22,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:02:22,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314367421] [2023-11-22 19:02:22,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-22 19:02:22,183 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 [2023-11-22 19:02:22,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:02:22,185 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:02:22,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-22 19:02:22,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-22 19:02:22,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 19:02:22,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-22 19:02:22,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:02:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:02:24,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:02:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:02:27,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:02:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314367421] [2023-11-22 19:02:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314367421] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:02:27,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:02:27,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-11-22 19:02:27,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037666189] [2023-11-22 19:02:27,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 19:02:27,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-22 19:02:27,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:02:27,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-22 19:02:27,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2079, Unknown=0, NotChecked=0, Total=2256 [2023-11-22 19:02:27,551 INFO L87 Difference]: Start difference. First operand 6764 states and 8343 transitions. Second operand has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:03:32,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 19:03:32,257 INFO L93 Difference]: Finished difference Result 11556 states and 14135 transitions. [2023-11-22 19:03:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2023-11-22 19:03:32,257 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2023-11-22 19:03:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 19:03:32,269 INFO L225 Difference]: With dead ends: 11556 [2023-11-22 19:03:32,269 INFO L226 Difference]: Without dead ends: 10201 [2023-11-22 19:03:32,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23281 ImplicationChecksByTransitivity, 59.5s TimeCoverageRelationStatistics Valid=7677, Invalid=61755, Unknown=0, NotChecked=0, Total=69432 [2023-11-22 19:03:32,281 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 2884 mSDsluCounter, 10858 mSDsCounter, 0 mSdLazyCounter, 6419 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2884 SdHoareTripleChecker+Valid, 11319 SdHoareTripleChecker+Invalid, 6755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 6419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-11-22 19:03:32,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2884 Valid, 11319 Invalid, 6755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 6419 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-11-22 19:03:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10201 states. [2023-11-22 19:03:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10201 to 8247. [2023-11-22 19:03:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8247 states, 8246 states have (on average 1.2341741450400194) internal successors, (10177), 8246 states have internal predecessors, (10177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:03:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8247 states to 8247 states and 10177 transitions. [2023-11-22 19:03:33,160 INFO L78 Accepts]: Start accepts. Automaton has 8247 states and 10177 transitions. Word has length 75 [2023-11-22 19:03:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 19:03:33,160 INFO L495 AbstractCegarLoop]: Abstraction has 8247 states and 10177 transitions. [2023-11-22 19:03:33,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.1041666666666665) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-22 19:03:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 8247 states and 10177 transitions. [2023-11-22 19:03:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-22 19:03:33,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 19:03:33,162 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 19:03:33,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-22 19:03:33,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-22 19:03:33,364 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 19:03:33,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 19:03:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash 397716473, now seen corresponding path program 3 times [2023-11-22 19:03:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-22 19:03:33,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243764047] [2023-11-22 19:03:33,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-22 19:03:33,365 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 [2023-11-22 19:03:33,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-22 19:03:33,366 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-22 19:03:33,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-22 19:03:33,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-22 19:03:33,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-22 19:03:33,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-22 19:03:33,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 19:03:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:03:35,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 19:03:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 19:03:38,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-22 19:03:38,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243764047] [2023-11-22 19:03:38,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243764047] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 19:03:38,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-22 19:03:38,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 46 [2023-11-22 19:03:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711571596] [2023-11-22 19:03:38,533 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-22 19:03:38,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-22 19:03:38,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-22 19:03:38,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-22 19:03:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2012, Unknown=0, NotChecked=0, Total=2162 [2023-11-22 19:03:38,534 INFO L87 Difference]: Start difference. First operand 8247 states and 10177 transitions. Second operand has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 46 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Killed by 15