./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:29:45,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:29:45,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:29:45,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:29:45,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:29:45,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:29:45,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:29:45,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:29:45,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:29:45,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:29:45,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:29:45,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:29:45,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:29:45,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:29:45,757 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:29:45,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:29:45,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:29:45,758 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:29:45,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:29:45,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:29:45,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:29:45,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:29:45,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:29:45,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:29:45,763 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:29:45,763 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:29:45,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:29:45,763 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:29:45,764 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:29:45,764 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:29:45,764 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:29:45,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:29:45,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:29:45,765 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:29:45,765 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:29:45,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:29:45,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:29:45,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:29:45,766 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:29:45,766 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:29:45,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:29:45,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:29:45,767 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2024-10-10 22:29:45,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:29:46,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:29:46,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:29:46,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:29:46,007 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:29:46,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-10-10 22:29:47,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:29:47,332 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:29:47,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-10-10 22:29:47,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4e3028e14/9a6cb99af0d24665a8f5200869a9538c/FLAG04385f80a [2024-10-10 22:29:47,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4e3028e14/9a6cb99af0d24665a8f5200869a9538c [2024-10-10 22:29:47,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:29:47,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:29:47,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:29:47,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:29:47,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:29:47,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,367 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b08ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47, skipping insertion in model container [2024-10-10 22:29:47,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:29:47,535 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-10-10 22:29:47,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:29:47,591 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:29:47,599 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-10-10 22:29:47,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:29:47,641 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:29:47,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47 WrapperNode [2024-10-10 22:29:47,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:29:47,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:29:47,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:29:47,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:29:47,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,674 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 189 [2024-10-10 22:29:47,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:29:47,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:29:47,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:29:47,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:29:47,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,708 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:29:47,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:29:47,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:29:47,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:29:47,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:29:47,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (1/1) ... [2024-10-10 22:29:47,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:29:47,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:47,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:29:47,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:29:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:29:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:29:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-10 22:29:47,819 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-10 22:29:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:29:47,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:29:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-10 22:29:47,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-10 22:29:47,920 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:29:47,922 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:29:48,263 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2024-10-10 22:29:48,264 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:29:48,283 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:29:48,284 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 22:29:48,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:48 BoogieIcfgContainer [2024-10-10 22:29:48,285 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:29:48,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:29:48,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:29:48,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:29:48,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:29:47" (1/3) ... [2024-10-10 22:29:48,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f9b3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:29:48, skipping insertion in model container [2024-10-10 22:29:48,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:29:47" (2/3) ... [2024-10-10 22:29:48,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42f9b3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:29:48, skipping insertion in model container [2024-10-10 22:29:48,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:48" (3/3) ... [2024-10-10 22:29:48,290 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2024-10-10 22:29:48,301 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:29:48,301 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:29:48,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:29:48,348 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3486d500, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:29:48,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:29:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 81 states have internal predecessors, (126), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-10 22:29:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 22:29:48,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:48,359 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:48,359 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:48,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1567352257, now seen corresponding path program 1 times [2024-10-10 22:29:48,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:48,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061794950] [2024-10-10 22:29:48,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:48,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:48,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:48,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:48,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061794950] [2024-10-10 22:29:48,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061794950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:48,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:48,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:48,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567343858] [2024-10-10 22:29:48,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:48,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:48,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:48,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:48,621 INFO L87 Difference]: Start difference. First operand has 91 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 81 states have internal predecessors, (126), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:48,674 INFO L93 Difference]: Finished difference Result 215 states and 353 transitions. [2024-10-10 22:29:48,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:48,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-10 22:29:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:48,683 INFO L225 Difference]: With dead ends: 215 [2024-10-10 22:29:48,683 INFO L226 Difference]: Without dead ends: 124 [2024-10-10 22:29:48,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:48,688 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 40 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:48,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 258 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:48,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-10 22:29:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-10-10 22:29:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 111 states have internal predecessors, (163), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-10 22:29:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 186 transitions. [2024-10-10 22:29:48,725 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 186 transitions. Word has length 32 [2024-10-10 22:29:48,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:48,726 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 186 transitions. [2024-10-10 22:29:48,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 186 transitions. [2024-10-10 22:29:48,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 22:29:48,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:48,728 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:48,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:29:48,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:48,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:48,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1750998188, now seen corresponding path program 1 times [2024-10-10 22:29:48,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:48,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375426995] [2024-10-10 22:29:48,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:48,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:49,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:49,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375426995] [2024-10-10 22:29:49,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375426995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:49,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:49,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-10 22:29:49,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652931808] [2024-10-10 22:29:49,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:49,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:29:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:49,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:29:49,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:29:49,095 INFO L87 Difference]: Start difference. First operand 124 states and 186 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:49,226 INFO L93 Difference]: Finished difference Result 256 states and 388 transitions. [2024-10-10 22:29:49,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:29:49,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-10 22:29:49,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:49,229 INFO L225 Difference]: With dead ends: 256 [2024-10-10 22:29:49,229 INFO L226 Difference]: Without dead ends: 165 [2024-10-10 22:29:49,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:29:49,231 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 35 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:49,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 699 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-10 22:29:49,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2024-10-10 22:29:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 145 states have (on average 1.4620689655172414) internal successors, (212), 148 states have internal predecessors, (212), 14 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-10-10 22:29:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2024-10-10 22:29:49,247 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 32 [2024-10-10 22:29:49,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:49,247 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2024-10-10 22:29:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:49,247 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2024-10-10 22:29:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 22:29:49,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:49,249 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:49,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:29:49,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:49,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:49,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1749327092, now seen corresponding path program 1 times [2024-10-10 22:29:49,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:49,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123658806] [2024-10-10 22:29:49,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:49,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:49,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:49,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123658806] [2024-10-10 22:29:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123658806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:49,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:49,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:49,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723723724] [2024-10-10 22:29:49,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:49,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:49,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:49,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:49,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:49,325 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:49,350 INFO L93 Difference]: Finished difference Result 297 states and 442 transitions. [2024-10-10 22:29:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:49,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-10-10 22:29:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:49,352 INFO L225 Difference]: With dead ends: 297 [2024-10-10 22:29:49,354 INFO L226 Difference]: Without dead ends: 241 [2024-10-10 22:29:49,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:49,355 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 52 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:49,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 256 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-10 22:29:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2024-10-10 22:29:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 203 states have (on average 1.4285714285714286) internal successors, (290), 207 states have internal predecessors, (290), 20 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2024-10-10 22:29:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 331 transitions. [2024-10-10 22:29:49,383 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 331 transitions. Word has length 34 [2024-10-10 22:29:49,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:49,384 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 331 transitions. [2024-10-10 22:29:49,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 331 transitions. [2024-10-10 22:29:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:29:49,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:49,385 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:49,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:29:49,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:49,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1316389598, now seen corresponding path program 1 times [2024-10-10 22:29:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:49,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428914232] [2024-10-10 22:29:49,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:49,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:49,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:49,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428914232] [2024-10-10 22:29:49,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428914232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:49,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:49,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:29:49,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50914622] [2024-10-10 22:29:49,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:49,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:29:49,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:49,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:29:49,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:49,462 INFO L87 Difference]: Start difference. First operand 227 states and 331 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:49,494 INFO L93 Difference]: Finished difference Result 357 states and 523 transitions. [2024-10-10 22:29:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:29:49,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-10 22:29:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:49,496 INFO L225 Difference]: With dead ends: 357 [2024-10-10 22:29:49,496 INFO L226 Difference]: Without dead ends: 315 [2024-10-10 22:29:49,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:49,497 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 52 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:49,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 475 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:49,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-10 22:29:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2024-10-10 22:29:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 258 states have (on average 1.426356589147287) internal successors, (368), 264 states have internal predecessors, (368), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (28), 26 states have call predecessors, (28), 25 states have call successors, (28) [2024-10-10 22:29:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 423 transitions. [2024-10-10 22:29:49,522 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 423 transitions. Word has length 35 [2024-10-10 22:29:49,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:49,523 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 423 transitions. [2024-10-10 22:29:49,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:49,523 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 423 transitions. [2024-10-10 22:29:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 22:29:49,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:49,528 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:49,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:29:49,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:49,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:49,529 INFO L85 PathProgramCache]: Analyzing trace with hash 36525920, now seen corresponding path program 1 times [2024-10-10 22:29:49,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:49,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433471996] [2024-10-10 22:29:49,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:49,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,572 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:49,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:49,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433471996] [2024-10-10 22:29:49,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433471996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:49,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:49,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:29:49,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475403084] [2024-10-10 22:29:49,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:49,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:49,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:49,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:49,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:49,575 INFO L87 Difference]: Start difference. First operand 289 states and 423 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:49,592 INFO L93 Difference]: Finished difference Result 298 states and 433 transitions. [2024-10-10 22:29:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:49,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-10 22:29:49,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:49,595 INFO L225 Difference]: With dead ends: 298 [2024-10-10 22:29:49,595 INFO L226 Difference]: Without dead ends: 291 [2024-10-10 22:29:49,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:49,597 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:49,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:49,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-10-10 22:29:49,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-10-10 22:29:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 260 states have (on average 1.4230769230769231) internal successors, (370), 266 states have internal predecessors, (370), 27 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (28), 26 states have call predecessors, (28), 25 states have call successors, (28) [2024-10-10 22:29:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2024-10-10 22:29:49,613 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 35 [2024-10-10 22:29:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:49,614 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2024-10-10 22:29:49,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:49,615 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2024-10-10 22:29:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-10 22:29:49,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:49,616 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:49,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:29:49,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:49,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash 728624225, now seen corresponding path program 1 times [2024-10-10 22:29:49,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:49,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601977109] [2024-10-10 22:29:49,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:49,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:49,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:49,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601977109] [2024-10-10 22:29:49,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601977109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:49,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:49,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:29:49,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928457475] [2024-10-10 22:29:49,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:49,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:29:49,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:49,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:29:49,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:49,676 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:49,703 INFO L93 Difference]: Finished difference Result 452 states and 666 transitions. [2024-10-10 22:29:49,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:29:49,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-10 22:29:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:49,706 INFO L225 Difference]: With dead ends: 452 [2024-10-10 22:29:49,706 INFO L226 Difference]: Without dead ends: 392 [2024-10-10 22:29:49,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:49,708 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 53 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:49,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 467 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-10-10 22:29:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 341. [2024-10-10 22:29:49,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 312 states have internal predecessors, (435), 29 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (30), 28 states have call predecessors, (30), 27 states have call successors, (30) [2024-10-10 22:29:49,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 494 transitions. [2024-10-10 22:29:49,722 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 494 transitions. Word has length 36 [2024-10-10 22:29:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:49,722 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 494 transitions. [2024-10-10 22:29:49,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:49,723 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 494 transitions. [2024-10-10 22:29:49,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-10 22:29:49,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:49,723 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:49,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:29:49,724 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:49,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2050222011, now seen corresponding path program 1 times [2024-10-10 22:29:49,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:49,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107593405] [2024-10-10 22:29:49,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:49,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:49,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:49,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107593405] [2024-10-10 22:29:49,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107593405] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:49,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409689903] [2024-10-10 22:29:49,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:49,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:49,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:49,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:49,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:29:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:49,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-10 22:29:49,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:49,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409689903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:49,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:49,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-10-10 22:29:49,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125660226] [2024-10-10 22:29:49,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:49,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:29:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:49,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:29:49,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:29:49,993 INFO L87 Difference]: Start difference. First operand 341 states and 494 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:50,076 INFO L93 Difference]: Finished difference Result 625 states and 918 transitions. [2024-10-10 22:29:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:29:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-10 22:29:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:50,078 INFO L225 Difference]: With dead ends: 625 [2024-10-10 22:29:50,078 INFO L226 Difference]: Without dead ends: 545 [2024-10-10 22:29:50,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:29:50,079 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 71 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:50,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 718 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-10-10 22:29:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 544. [2024-10-10 22:29:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 491 states have (on average 1.4215885947046842) internal successors, (698), 497 states have internal predecessors, (698), 48 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (52), 48 states have call predecessors, (52), 46 states have call successors, (52) [2024-10-10 22:29:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 798 transitions. [2024-10-10 22:29:50,092 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 798 transitions. Word has length 36 [2024-10-10 22:29:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:50,093 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 798 transitions. [2024-10-10 22:29:50,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:50,093 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 798 transitions. [2024-10-10 22:29:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-10 22:29:50,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:50,094 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:50,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:29:50,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:50,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:50,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:50,295 INFO L85 PathProgramCache]: Analyzing trace with hash -351134278, now seen corresponding path program 1 times [2024-10-10 22:29:50,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:50,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227650075] [2024-10-10 22:29:50,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:50,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,333 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:50,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:50,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227650075] [2024-10-10 22:29:50,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227650075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:50,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:50,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:29:50,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405845022] [2024-10-10 22:29:50,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:50,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:29:50,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:50,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:29:50,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:50,335 INFO L87 Difference]: Start difference. First operand 544 states and 798 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:50,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:50,354 INFO L93 Difference]: Finished difference Result 557 states and 813 transitions. [2024-10-10 22:29:50,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:29:50,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-10 22:29:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:50,357 INFO L225 Difference]: With dead ends: 557 [2024-10-10 22:29:50,357 INFO L226 Difference]: Without dead ends: 550 [2024-10-10 22:29:50,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:50,359 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:50,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:50,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-10-10 22:29:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 547. [2024-10-10 22:29:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 494 states have (on average 1.4190283400809716) internal successors, (701), 500 states have internal predecessors, (701), 48 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (52), 48 states have call predecessors, (52), 46 states have call successors, (52) [2024-10-10 22:29:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 801 transitions. [2024-10-10 22:29:50,376 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 801 transitions. Word has length 37 [2024-10-10 22:29:50,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:50,376 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 801 transitions. [2024-10-10 22:29:50,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 801 transitions. [2024-10-10 22:29:50,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-10 22:29:50,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:50,377 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:50,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:29:50,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:50,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1423873084, now seen corresponding path program 1 times [2024-10-10 22:29:50,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:50,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345458346] [2024-10-10 22:29:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:50,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:50,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345458346] [2024-10-10 22:29:50,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345458346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:50,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:50,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:29:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624552177] [2024-10-10 22:29:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:50,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:29:50,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:29:50,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:29:50,449 INFO L87 Difference]: Start difference. First operand 547 states and 801 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:50,482 INFO L93 Difference]: Finished difference Result 554 states and 807 transitions. [2024-10-10 22:29:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:29:50,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2024-10-10 22:29:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:50,486 INFO L225 Difference]: With dead ends: 554 [2024-10-10 22:29:50,486 INFO L226 Difference]: Without dead ends: 547 [2024-10-10 22:29:50,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:29:50,486 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 3 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:50,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 507 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-10 22:29:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 541. [2024-10-10 22:29:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 488 states have (on average 1.415983606557377) internal successors, (691), 494 states have internal predecessors, (691), 48 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (52), 48 states have call predecessors, (52), 46 states have call successors, (52) [2024-10-10 22:29:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 791 transitions. [2024-10-10 22:29:50,506 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 791 transitions. Word has length 37 [2024-10-10 22:29:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:50,506 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 791 transitions. [2024-10-10 22:29:50,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 791 transitions. [2024-10-10 22:29:50,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:29:50,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:50,508 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:50,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:29:50,508 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:50,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:50,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2073787745, now seen corresponding path program 1 times [2024-10-10 22:29:50,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:50,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294738555] [2024-10-10 22:29:50,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:50,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:50,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294738555] [2024-10-10 22:29:50,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294738555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146917244] [2024-10-10 22:29:50,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:50,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:50,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:50,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:50,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:29:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:50,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:29:50,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:50,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:50,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146917244] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:50,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2024-10-10 22:29:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67491453] [2024-10-10 22:29:50,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:50,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-10 22:29:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:50,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-10 22:29:50,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:29:50,851 INFO L87 Difference]: Start difference. First operand 541 states and 791 transitions. Second operand has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-10 22:29:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:50,936 INFO L93 Difference]: Finished difference Result 928 states and 1353 transitions. [2024-10-10 22:29:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:29:50,936 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 38 [2024-10-10 22:29:50,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:50,939 INFO L225 Difference]: With dead ends: 928 [2024-10-10 22:29:50,939 INFO L226 Difference]: Without dead ends: 592 [2024-10-10 22:29:50,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:29:50,940 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 13 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:50,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 984 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:50,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-10 22:29:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 570. [2024-10-10 22:29:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 514 states have (on average 1.3988326848249026) internal successors, (719), 514 states have internal predecessors, (719), 51 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (61), 57 states have call predecessors, (61), 49 states have call successors, (61) [2024-10-10 22:29:50,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 831 transitions. [2024-10-10 22:29:50,952 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 831 transitions. Word has length 38 [2024-10-10 22:29:50,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:50,952 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 831 transitions. [2024-10-10 22:29:50,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-10 22:29:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 831 transitions. [2024-10-10 22:29:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:29:50,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:50,954 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:50,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:29:51,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:51,158 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:51,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash -994054258, now seen corresponding path program 1 times [2024-10-10 22:29:51,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:51,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530507993] [2024-10-10 22:29:51,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:51,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:51,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:51,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530507993] [2024-10-10 22:29:51,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530507993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:51,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:51,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:29:51,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063682935] [2024-10-10 22:29:51,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:51,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:29:51,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:51,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:29:51,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:51,201 INFO L87 Difference]: Start difference. First operand 570 states and 831 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:51,228 INFO L93 Difference]: Finished difference Result 604 states and 876 transitions. [2024-10-10 22:29:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:29:51,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-10-10 22:29:51,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:51,231 INFO L225 Difference]: With dead ends: 604 [2024-10-10 22:29:51,231 INFO L226 Difference]: Without dead ends: 547 [2024-10-10 22:29:51,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:51,232 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 38 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:51,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 468 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:51,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-10 22:29:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 445. [2024-10-10 22:29:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 402 states have (on average 1.373134328358209) internal successors, (552), 400 states have internal predecessors, (552), 38 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (48), 44 states have call predecessors, (48), 36 states have call successors, (48) [2024-10-10 22:29:51,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 638 transitions. [2024-10-10 22:29:51,243 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 638 transitions. Word has length 40 [2024-10-10 22:29:51,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:51,243 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 638 transitions. [2024-10-10 22:29:51,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:51,243 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 638 transitions. [2024-10-10 22:29:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:29:51,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:51,244 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:51,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:29:51,244 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:51,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1177700189, now seen corresponding path program 1 times [2024-10-10 22:29:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953155301] [2024-10-10 22:29:51,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953155301] [2024-10-10 22:29:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953155301] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:51,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936845298] [2024-10-10 22:29:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:51,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:51,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:51,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:51,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:29:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-10 22:29:51,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:51,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:51,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936845298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:51,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:51,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2024-10-10 22:29:51,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702225171] [2024-10-10 22:29:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:51,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 22:29:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 22:29:51,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:29:51,518 INFO L87 Difference]: Start difference. First operand 445 states and 638 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:51,636 INFO L93 Difference]: Finished difference Result 589 states and 846 transitions. [2024-10-10 22:29:51,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:29:51,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-10-10 22:29:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:51,638 INFO L225 Difference]: With dead ends: 589 [2024-10-10 22:29:51,638 INFO L226 Difference]: Without dead ends: 477 [2024-10-10 22:29:51,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:29:51,639 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 79 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:51,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 945 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-10 22:29:51,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 469. [2024-10-10 22:29:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 426 states have (on average 1.3615023474178405) internal successors, (580), 424 states have internal predecessors, (580), 38 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (48), 44 states have call predecessors, (48), 36 states have call successors, (48) [2024-10-10 22:29:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 666 transitions. [2024-10-10 22:29:51,648 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 666 transitions. Word has length 40 [2024-10-10 22:29:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:51,649 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 666 transitions. [2024-10-10 22:29:51,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 666 transitions. [2024-10-10 22:29:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:29:51,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:51,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:51,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:29:51,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:51,851 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:51,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:51,851 INFO L85 PathProgramCache]: Analyzing trace with hash -784673179, now seen corresponding path program 1 times [2024-10-10 22:29:51,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:51,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44421545] [2024-10-10 22:29:51,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:51,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:51,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44421545] [2024-10-10 22:29:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44421545] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:51,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493317070] [2024-10-10 22:29:51,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:51,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:51,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:51,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:51,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:29:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:52,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-10 22:29:52,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:52,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:52,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493317070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:52,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:52,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 15 [2024-10-10 22:29:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318030333] [2024-10-10 22:29:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:52,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:29:52,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:52,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:29:52,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-10-10 22:29:52,101 INFO L87 Difference]: Start difference. First operand 469 states and 666 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:52,267 INFO L93 Difference]: Finished difference Result 685 states and 982 transitions. [2024-10-10 22:29:52,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:29:52,268 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-10-10 22:29:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:52,270 INFO L225 Difference]: With dead ends: 685 [2024-10-10 22:29:52,270 INFO L226 Difference]: Without dead ends: 557 [2024-10-10 22:29:52,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-10-10 22:29:52,271 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 117 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1231 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:52,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1231 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-10-10 22:29:52,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 469. [2024-10-10 22:29:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 426 states have (on average 1.352112676056338) internal successors, (576), 424 states have internal predecessors, (576), 38 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (48), 44 states have call predecessors, (48), 36 states have call successors, (48) [2024-10-10 22:29:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 662 transitions. [2024-10-10 22:29:52,283 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 662 transitions. Word has length 40 [2024-10-10 22:29:52,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:52,283 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 662 transitions. [2024-10-10 22:29:52,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 662 transitions. [2024-10-10 22:29:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-10 22:29:52,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:52,284 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:52,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:29:52,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-10 22:29:52,488 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:52,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:52,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1466403823, now seen corresponding path program 1 times [2024-10-10 22:29:52,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:52,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422697597] [2024-10-10 22:29:52,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:52,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:52,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:52,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:52,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422697597] [2024-10-10 22:29:52,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422697597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:52,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:52,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:29:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239643313] [2024-10-10 22:29:52,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:52,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:29:52,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:52,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:29:52,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:29:52,556 INFO L87 Difference]: Start difference. First operand 469 states and 662 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:52,663 INFO L93 Difference]: Finished difference Result 548 states and 770 transitions. [2024-10-10 22:29:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:29:52,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-10-10 22:29:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:52,665 INFO L225 Difference]: With dead ends: 548 [2024-10-10 22:29:52,665 INFO L226 Difference]: Without dead ends: 535 [2024-10-10 22:29:52,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:29:52,666 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 47 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:52,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 483 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:52,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-10 22:29:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 524. [2024-10-10 22:29:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 477 states have (on average 1.3480083857442349) internal successors, (643), 475 states have internal predecessors, (643), 42 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (52), 48 states have call predecessors, (52), 40 states have call successors, (52) [2024-10-10 22:29:52,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 737 transitions. [2024-10-10 22:29:52,678 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 737 transitions. Word has length 41 [2024-10-10 22:29:52,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:52,678 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 737 transitions. [2024-10-10 22:29:52,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 737 transitions. [2024-10-10 22:29:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:29:52,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:52,679 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:52,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:29:52,679 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:52,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2140496160, now seen corresponding path program 1 times [2024-10-10 22:29:52,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:52,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276020908] [2024-10-10 22:29:52,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:52,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:52,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:52,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:52,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:52,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276020908] [2024-10-10 22:29:52,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276020908] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:52,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870484592] [2024-10-10 22:29:52,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:52,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:52,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:52,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:52,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:29:52,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:52,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-10 22:29:52,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:29:52,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:29:53,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870484592] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:53,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:53,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 12] total 23 [2024-10-10 22:29:53,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912620889] [2024-10-10 22:29:53,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:53,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-10 22:29:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:53,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-10 22:29:53,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-10-10 22:29:53,135 INFO L87 Difference]: Start difference. First operand 524 states and 737 transitions. Second operand has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:29:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:53,570 INFO L93 Difference]: Finished difference Result 1292 states and 1834 transitions. [2024-10-10 22:29:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-10 22:29:53,571 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2024-10-10 22:29:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:53,575 INFO L225 Difference]: With dead ends: 1292 [2024-10-10 22:29:53,575 INFO L226 Difference]: Without dead ends: 898 [2024-10-10 22:29:53,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2024-10-10 22:29:53,576 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 464 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:53,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1828 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:29:53,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-10 22:29:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 694. [2024-10-10 22:29:53,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 634 states have (on average 1.3470031545741326) internal successors, (854), 629 states have internal predecessors, (854), 55 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (67), 64 states have call predecessors, (67), 53 states have call successors, (67) [2024-10-10 22:29:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 976 transitions. [2024-10-10 22:29:53,597 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 976 transitions. Word has length 42 [2024-10-10 22:29:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:53,597 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 976 transitions. [2024-10-10 22:29:53,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 19 states have internal predecessors, (58), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-10 22:29:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 976 transitions. [2024-10-10 22:29:53,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:29:53,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:53,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:53,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 22:29:53,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 22:29:53,803 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:53,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:53,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1493198398, now seen corresponding path program 1 times [2024-10-10 22:29:53,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:53,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270344680] [2024-10-10 22:29:53,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:53,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:53,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:53,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270344680] [2024-10-10 22:29:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270344680] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479824775] [2024-10-10 22:29:53,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:53,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:53,903 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:53,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:29:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:53,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-10 22:29:53,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:53,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:54,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479824775] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:54,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:29:54,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-10 22:29:54,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187465728] [2024-10-10 22:29:54,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:54,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 22:29:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:54,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 22:29:54,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:29:54,070 INFO L87 Difference]: Start difference. First operand 694 states and 976 transitions. Second operand has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:29:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:54,189 INFO L93 Difference]: Finished difference Result 775 states and 1072 transitions. [2024-10-10 22:29:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:29:54,189 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-10-10 22:29:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:54,191 INFO L225 Difference]: With dead ends: 775 [2024-10-10 22:29:54,191 INFO L226 Difference]: Without dead ends: 612 [2024-10-10 22:29:54,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:29:54,192 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 16 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:54,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1163 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:54,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2024-10-10 22:29:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 586. [2024-10-10 22:29:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 538 states have (on average 1.328996282527881) internal successors, (715), 533 states have internal predecessors, (715), 43 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (55), 52 states have call predecessors, (55), 41 states have call successors, (55) [2024-10-10 22:29:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 813 transitions. [2024-10-10 22:29:54,219 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 813 transitions. Word has length 42 [2024-10-10 22:29:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:54,219 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 813 transitions. [2024-10-10 22:29:54,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:29:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 813 transitions. [2024-10-10 22:29:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 22:29:54,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:54,221 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:54,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 22:29:54,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 22:29:54,421 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:54,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:54,422 INFO L85 PathProgramCache]: Analyzing trace with hash 114584649, now seen corresponding path program 1 times [2024-10-10 22:29:54,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:54,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221713754] [2024-10-10 22:29:54,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:54,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:54,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:54,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:54,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:54,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221713754] [2024-10-10 22:29:54,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221713754] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:54,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191553941] [2024-10-10 22:29:54,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:54,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:54,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:54,531 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:54,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:29:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:54,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-10 22:29:54,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:54,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:54,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191553941] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:54,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:29:54,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 10] total 13 [2024-10-10 22:29:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638517368] [2024-10-10 22:29:54,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:54,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:29:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:54,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:29:54,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:29:54,684 INFO L87 Difference]: Start difference. First operand 586 states and 813 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:54,777 INFO L93 Difference]: Finished difference Result 954 states and 1341 transitions. [2024-10-10 22:29:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:29:54,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-10-10 22:29:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:54,781 INFO L225 Difference]: With dead ends: 954 [2024-10-10 22:29:54,781 INFO L226 Difference]: Without dead ends: 906 [2024-10-10 22:29:54,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:29:54,782 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 45 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:54,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 473 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:54,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-10-10 22:29:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 776. [2024-10-10 22:29:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 705 states have (on average 1.3134751773049644) internal successors, (926), 702 states have internal predecessors, (926), 66 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (78), 75 states have call predecessors, (78), 64 states have call successors, (78) [2024-10-10 22:29:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1070 transitions. [2024-10-10 22:29:54,801 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1070 transitions. Word has length 43 [2024-10-10 22:29:54,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:54,802 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1070 transitions. [2024-10-10 22:29:54,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:54,802 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1070 transitions. [2024-10-10 22:29:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 22:29:54,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:54,803 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:54,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-10 22:29:55,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:55,007 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:55,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash 815649227, now seen corresponding path program 1 times [2024-10-10 22:29:55,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962583171] [2024-10-10 22:29:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:55,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:55,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962583171] [2024-10-10 22:29:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962583171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:55,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:55,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:29:55,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844376379] [2024-10-10 22:29:55,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:55,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:29:55,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:55,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:29:55,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:55,040 INFO L87 Difference]: Start difference. First operand 776 states and 1070 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:55,061 INFO L93 Difference]: Finished difference Result 798 states and 1094 transitions. [2024-10-10 22:29:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:29:55,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-10-10 22:29:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:55,064 INFO L225 Difference]: With dead ends: 798 [2024-10-10 22:29:55,064 INFO L226 Difference]: Without dead ends: 732 [2024-10-10 22:29:55,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:55,065 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:55,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 380 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-10 22:29:55,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 715. [2024-10-10 22:29:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 644 states have (on average 1.3183229813664596) internal successors, (849), 644 states have internal predecessors, (849), 66 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (76), 73 states have call predecessors, (76), 64 states have call successors, (76) [2024-10-10 22:29:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 991 transitions. [2024-10-10 22:29:55,082 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 991 transitions. Word has length 43 [2024-10-10 22:29:55,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:55,082 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 991 transitions. [2024-10-10 22:29:55,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:55,083 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 991 transitions. [2024-10-10 22:29:55,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 22:29:55,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:55,083 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:55,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-10 22:29:55,084 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:55,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash -562500669, now seen corresponding path program 1 times [2024-10-10 22:29:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:55,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557263039] [2024-10-10 22:29:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:55,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:29:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:55,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557263039] [2024-10-10 22:29:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557263039] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:55,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011934455] [2024-10-10 22:29:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:55,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:55,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:55,183 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:55,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 22:29:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:55,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-10 22:29:55,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:55,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:55,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011934455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:55,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:55,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 13 [2024-10-10 22:29:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350037877] [2024-10-10 22:29:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:55,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-10 22:29:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:55,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-10 22:29:55,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:29:55,322 INFO L87 Difference]: Start difference. First operand 715 states and 991 transitions. Second operand has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:29:55,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:55,670 INFO L93 Difference]: Finished difference Result 1562 states and 2181 transitions. [2024-10-10 22:29:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-10 22:29:55,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2024-10-10 22:29:55,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:55,674 INFO L225 Difference]: With dead ends: 1562 [2024-10-10 22:29:55,675 INFO L226 Difference]: Without dead ends: 1070 [2024-10-10 22:29:55,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:29:55,677 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 183 mSDsluCounter, 1388 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:55,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1547 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:29:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-10-10 22:29:55,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 954. [2024-10-10 22:29:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 860 states have (on average 1.3104651162790697) internal successors, (1127), 858 states have internal predecessors, (1127), 89 states have call successors, (89), 2 states have call predecessors, (89), 4 states have return successors, (100), 98 states have call predecessors, (100), 86 states have call successors, (100) [2024-10-10 22:29:55,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1316 transitions. [2024-10-10 22:29:55,706 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1316 transitions. Word has length 44 [2024-10-10 22:29:55,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:55,706 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1316 transitions. [2024-10-10 22:29:55,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:29:55,706 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1316 transitions. [2024-10-10 22:29:55,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 22:29:55,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:55,707 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:55,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-10 22:29:55,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:55,908 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:55,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1349313630, now seen corresponding path program 1 times [2024-10-10 22:29:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:55,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575839537] [2024-10-10 22:29:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:56,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:56,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575839537] [2024-10-10 22:29:56,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575839537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:56,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:56,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-10 22:29:56,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454801157] [2024-10-10 22:29:56,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:56,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:29:56,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:56,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:29:56,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:29:56,035 INFO L87 Difference]: Start difference. First operand 954 states and 1316 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:56,229 INFO L93 Difference]: Finished difference Result 1211 states and 1683 transitions. [2024-10-10 22:29:56,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:29:56,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-10-10 22:29:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:56,233 INFO L225 Difference]: With dead ends: 1211 [2024-10-10 22:29:56,233 INFO L226 Difference]: Without dead ends: 1191 [2024-10-10 22:29:56,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:29:56,234 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 61 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:56,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 788 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:29:56,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-10-10 22:29:56,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1034. [2024-10-10 22:29:56,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 932 states have (on average 1.3015021459227467) internal successors, (1213), 931 states have internal predecessors, (1213), 97 states have call successors, (97), 2 states have call predecessors, (97), 4 states have return successors, (108), 106 states have call predecessors, (108), 94 states have call successors, (108) [2024-10-10 22:29:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1418 transitions. [2024-10-10 22:29:56,266 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1418 transitions. Word has length 45 [2024-10-10 22:29:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:56,266 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1418 transitions. [2024-10-10 22:29:56,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1418 transitions. [2024-10-10 22:29:56,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:29:56,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:56,268 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:56,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 22:29:56,268 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:56,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:56,268 INFO L85 PathProgramCache]: Analyzing trace with hash 523807891, now seen corresponding path program 1 times [2024-10-10 22:29:56,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:56,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553635828] [2024-10-10 22:29:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:56,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:29:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:56,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:56,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553635828] [2024-10-10 22:29:56,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553635828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:56,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028813785] [2024-10-10 22:29:56,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:56,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:56,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:56,382 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:56,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 22:29:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:56,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-10 22:29:56,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:56,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:56,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028813785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:56,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:56,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 15 [2024-10-10 22:29:56,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677059558] [2024-10-10 22:29:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:56,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-10 22:29:56,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:56,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-10 22:29:56,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-10 22:29:56,560 INFO L87 Difference]: Start difference. First operand 1034 states and 1418 transitions. Second operand has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:29:56,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:56,869 INFO L93 Difference]: Finished difference Result 1136 states and 1549 transitions. [2024-10-10 22:29:56,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:29:56,870 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-10-10 22:29:56,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:56,873 INFO L225 Difference]: With dead ends: 1136 [2024-10-10 22:29:56,873 INFO L226 Difference]: Without dead ends: 1134 [2024-10-10 22:29:56,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:29:56,874 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 128 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:56,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1777 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:29:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2024-10-10 22:29:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1042. [2024-10-10 22:29:56,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 938 states have (on average 1.2995735607675907) internal successors, (1219), 938 states have internal predecessors, (1219), 98 states have call successors, (98), 3 states have call predecessors, (98), 5 states have return successors, (109), 106 states have call predecessors, (109), 95 states have call successors, (109) [2024-10-10 22:29:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1426 transitions. [2024-10-10 22:29:56,904 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1426 transitions. Word has length 46 [2024-10-10 22:29:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:56,904 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1426 transitions. [2024-10-10 22:29:56,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:29:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1426 transitions. [2024-10-10 22:29:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-10 22:29:56,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:56,905 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:56,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-10 22:29:57,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:57,110 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:57,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:57,110 INFO L85 PathProgramCache]: Analyzing trace with hash -948734854, now seen corresponding path program 1 times [2024-10-10 22:29:57,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:57,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487027070] [2024-10-10 22:29:57,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:57,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:29:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:57,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:57,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487027070] [2024-10-10 22:29:57,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487027070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:57,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:57,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:29:57,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206612788] [2024-10-10 22:29:57,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:57,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:29:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:57,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:29:57,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:57,139 INFO L87 Difference]: Start difference. First operand 1042 states and 1426 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:57,166 INFO L93 Difference]: Finished difference Result 1051 states and 1434 transitions. [2024-10-10 22:29:57,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:29:57,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-10-10 22:29:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:57,171 INFO L225 Difference]: With dead ends: 1051 [2024-10-10 22:29:57,171 INFO L226 Difference]: Without dead ends: 1005 [2024-10-10 22:29:57,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:57,172 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:57,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 377 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-10-10 22:29:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 934. [2024-10-10 22:29:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 842 states have (on average 1.314726840855107) internal successors, (1107), 843 states have internal predecessors, (1107), 86 states have call successors, (86), 3 states have call predecessors, (86), 5 states have return successors, (95), 92 states have call predecessors, (95), 83 states have call successors, (95) [2024-10-10 22:29:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1288 transitions. [2024-10-10 22:29:57,204 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1288 transitions. Word has length 47 [2024-10-10 22:29:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:57,204 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1288 transitions. [2024-10-10 22:29:57,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1288 transitions. [2024-10-10 22:29:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-10 22:29:57,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:57,206 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:57,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-10 22:29:57,206 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:57,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1804400504, now seen corresponding path program 1 times [2024-10-10 22:29:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550042710] [2024-10-10 22:29:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-10 22:29:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:29:57,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:57,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550042710] [2024-10-10 22:29:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550042710] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652308925] [2024-10-10 22:29:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:57,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:57,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:57,233 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:57,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-10 22:29:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:29:57,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:29:57,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:57,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652308925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:57,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:57,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-10 22:29:57,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908058370] [2024-10-10 22:29:57,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:57,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:57,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:57,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:57,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:57,291 INFO L87 Difference]: Start difference. First operand 934 states and 1288 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:29:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:57,351 INFO L93 Difference]: Finished difference Result 1865 states and 2576 transitions. [2024-10-10 22:29:57,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:57,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-10-10 22:29:57,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:57,354 INFO L225 Difference]: With dead ends: 1865 [2024-10-10 22:29:57,354 INFO L226 Difference]: Without dead ends: 939 [2024-10-10 22:29:57,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:29:57,356 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 5 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:57,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 231 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2024-10-10 22:29:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 937. [2024-10-10 22:29:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 845 states have (on average 1.314792899408284) internal successors, (1111), 846 states have internal predecessors, (1111), 86 states have call successors, (86), 3 states have call predecessors, (86), 5 states have return successors, (95), 92 states have call predecessors, (95), 83 states have call successors, (95) [2024-10-10 22:29:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1292 transitions. [2024-10-10 22:29:57,393 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1292 transitions. Word has length 47 [2024-10-10 22:29:57,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:57,393 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1292 transitions. [2024-10-10 22:29:57,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:29:57,393 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1292 transitions. [2024-10-10 22:29:57,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-10 22:29:57,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:57,395 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:57,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-10 22:29:57,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-10 22:29:57,599 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:57,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1029342362, now seen corresponding path program 1 times [2024-10-10 22:29:57,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:57,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992108171] [2024-10-10 22:29:57,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:57,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-10 22:29:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:29:57,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:57,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992108171] [2024-10-10 22:29:57,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992108171] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:57,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975061511] [2024-10-10 22:29:57,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:57,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:57,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:57,638 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:57,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-10 22:29:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:57,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:29:57,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:29:57,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:57,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975061511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:57,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:57,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-10-10 22:29:57,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599253835] [2024-10-10 22:29:57,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:57,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:29:57,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:57,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:29:57,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:57,700 INFO L87 Difference]: Start difference. First operand 937 states and 1292 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:29:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:57,742 INFO L93 Difference]: Finished difference Result 1871 states and 2586 transitions. [2024-10-10 22:29:57,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:29:57,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2024-10-10 22:29:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:57,745 INFO L225 Difference]: With dead ends: 1871 [2024-10-10 22:29:57,745 INFO L226 Difference]: Without dead ends: 942 [2024-10-10 22:29:57,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:29:57,747 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:57,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 232 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-10-10 22:29:57,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 939. [2024-10-10 22:29:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 847 states have (on average 1.3140495867768596) internal successors, (1113), 848 states have internal predecessors, (1113), 86 states have call successors, (86), 3 states have call predecessors, (86), 5 states have return successors, (95), 92 states have call predecessors, (95), 83 states have call successors, (95) [2024-10-10 22:29:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1294 transitions. [2024-10-10 22:29:57,772 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1294 transitions. Word has length 48 [2024-10-10 22:29:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:57,772 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1294 transitions. [2024-10-10 22:29:57,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:29:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1294 transitions. [2024-10-10 22:29:57,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 22:29:57,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:57,773 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:57,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-10 22:29:57,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-10 22:29:57,975 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:57,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:57,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1553852437, now seen corresponding path program 1 times [2024-10-10 22:29:57,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:57,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207215489] [2024-10-10 22:29:57,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:57,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 22:29:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:29:58,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:58,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207215489] [2024-10-10 22:29:58,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207215489] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:29:58,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174425965] [2024-10-10 22:29:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:58,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:29:58,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:29:58,294 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:29:58,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-10 22:29:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:58,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-10 22:29:58,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:29:58,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:29:58,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174425965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:58,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:29:58,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2024-10-10 22:29:58,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638980559] [2024-10-10 22:29:58,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:58,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:29:58,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:58,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:29:58,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2024-10-10 22:29:58,461 INFO L87 Difference]: Start difference. First operand 939 states and 1294 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:58,682 INFO L93 Difference]: Finished difference Result 1200 states and 1642 transitions. [2024-10-10 22:29:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:29:58,682 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-10-10 22:29:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:58,686 INFO L225 Difference]: With dead ends: 1200 [2024-10-10 22:29:58,686 INFO L226 Difference]: Without dead ends: 1132 [2024-10-10 22:29:58,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2024-10-10 22:29:58,687 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 147 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:58,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1436 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2024-10-10 22:29:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 983. [2024-10-10 22:29:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 883 states have (on average 1.2989807474518686) internal successors, (1147), 885 states have internal predecessors, (1147), 94 states have call successors, (94), 3 states have call predecessors, (94), 5 states have return successors, (103), 100 states have call predecessors, (103), 91 states have call successors, (103) [2024-10-10 22:29:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1344 transitions. [2024-10-10 22:29:58,719 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1344 transitions. Word has length 49 [2024-10-10 22:29:58,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:58,719 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1344 transitions. [2024-10-10 22:29:58,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1344 transitions. [2024-10-10 22:29:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-10 22:29:58,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:58,720 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:58,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-10 22:29:58,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-10 22:29:58,921 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:58,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1883052330, now seen corresponding path program 1 times [2024-10-10 22:29:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235708420] [2024-10-10 22:29:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:29:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:29:59,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:59,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235708420] [2024-10-10 22:29:59,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235708420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:59,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:59,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-10 22:29:59,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551247989] [2024-10-10 22:29:59,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:59,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:29:59,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:59,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:29:59,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:29:59,094 INFO L87 Difference]: Start difference. First operand 983 states and 1344 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:59,172 INFO L93 Difference]: Finished difference Result 989 states and 1349 transitions. [2024-10-10 22:29:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:29:59,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2024-10-10 22:29:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:59,176 INFO L225 Difference]: With dead ends: 989 [2024-10-10 22:29:59,176 INFO L226 Difference]: Without dead ends: 987 [2024-10-10 22:29:59,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:29:59,177 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 14 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:59,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 679 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-10-10 22:29:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2024-10-10 22:29:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 886 states have (on average 1.2979683972911964) internal successors, (1150), 888 states have internal predecessors, (1150), 94 states have call successors, (94), 4 states have call predecessors, (94), 6 states have return successors, (103), 100 states have call predecessors, (103), 91 states have call successors, (103) [2024-10-10 22:29:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1347 transitions. [2024-10-10 22:29:59,209 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1347 transitions. Word has length 49 [2024-10-10 22:29:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:59,209 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1347 transitions. [2024-10-10 22:29:59,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1347 transitions. [2024-10-10 22:29:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-10 22:29:59,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:59,210 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:59,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-10 22:29:59,211 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:59,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:59,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1625605915, now seen corresponding path program 1 times [2024-10-10 22:29:59,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:59,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385976843] [2024-10-10 22:29:59,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:59,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 22:29:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:29:59,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:59,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385976843] [2024-10-10 22:29:59,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385976843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:59,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:59,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:29:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467429944] [2024-10-10 22:29:59,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:59,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:29:59,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:59,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:29:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:29:59,265 INFO L87 Difference]: Start difference. First operand 987 states and 1347 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:59,325 INFO L93 Difference]: Finished difference Result 1024 states and 1387 transitions. [2024-10-10 22:29:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:29:59,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-10-10 22:29:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:59,328 INFO L225 Difference]: With dead ends: 1024 [2024-10-10 22:29:59,328 INFO L226 Difference]: Without dead ends: 1022 [2024-10-10 22:29:59,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:29:59,329 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 20 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:59,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 708 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2024-10-10 22:29:59,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 993. [2024-10-10 22:29:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 890 states have (on average 1.296629213483146) internal successors, (1154), 893 states have internal predecessors, (1154), 95 states have call successors, (95), 5 states have call predecessors, (95), 7 states have return successors, (104), 100 states have call predecessors, (104), 92 states have call successors, (104) [2024-10-10 22:29:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1353 transitions. [2024-10-10 22:29:59,359 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1353 transitions. Word has length 51 [2024-10-10 22:29:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:59,359 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 1353 transitions. [2024-10-10 22:29:59,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1353 transitions. [2024-10-10 22:29:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-10 22:29:59,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:59,364 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:59,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-10 22:29:59,365 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:59,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1682864217, now seen corresponding path program 1 times [2024-10-10 22:29:59,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:59,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564184614] [2024-10-10 22:29:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:59,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 22:29:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:29:59,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:59,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564184614] [2024-10-10 22:29:59,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564184614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:59,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:59,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:29:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989556158] [2024-10-10 22:29:59,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:59,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:29:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:59,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:29:59,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:29:59,424 INFO L87 Difference]: Start difference. First operand 993 states and 1353 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:59,479 INFO L93 Difference]: Finished difference Result 1032 states and 1399 transitions. [2024-10-10 22:29:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:29:59,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2024-10-10 22:29:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:59,483 INFO L225 Difference]: With dead ends: 1032 [2024-10-10 22:29:59,483 INFO L226 Difference]: Without dead ends: 1030 [2024-10-10 22:29:59,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:29:59,484 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 17 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:59,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 665 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:29:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2024-10-10 22:29:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 999. [2024-10-10 22:29:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 893 states have (on average 1.295632698768197) internal successors, (1157), 898 states have internal predecessors, (1157), 97 states have call successors, (97), 6 states have call predecessors, (97), 8 states have return successors, (106), 100 states have call predecessors, (106), 94 states have call successors, (106) [2024-10-10 22:29:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1360 transitions. [2024-10-10 22:29:59,514 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1360 transitions. Word has length 51 [2024-10-10 22:29:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:59,515 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1360 transitions. [2024-10-10 22:29:59,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:29:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1360 transitions. [2024-10-10 22:29:59,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-10 22:29:59,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:59,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:29:59,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-10 22:29:59,517 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:59,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash 863721945, now seen corresponding path program 1 times [2024-10-10 22:29:59,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:29:59,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015335884] [2024-10-10 22:29:59,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:59,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:29:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:29:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:29:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:29:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-10 22:29:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:59,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:29:59,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:29:59,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015335884] [2024-10-10 22:29:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015335884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:29:59,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:29:59,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-10 22:29:59,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593558899] [2024-10-10 22:29:59,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:29:59,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-10 22:29:59,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:29:59,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-10 22:29:59,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:29:59,832 INFO L87 Difference]: Start difference. First operand 999 states and 1360 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:00,094 INFO L93 Difference]: Finished difference Result 1213 states and 1647 transitions. [2024-10-10 22:30:00,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:30:00,094 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-10-10 22:30:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:00,098 INFO L225 Difference]: With dead ends: 1213 [2024-10-10 22:30:00,098 INFO L226 Difference]: Without dead ends: 1032 [2024-10-10 22:30:00,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:30:00,100 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 90 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:00,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1280 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2024-10-10 22:30:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1000. [2024-10-10 22:30:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 892 states have (on average 1.289237668161435) internal successors, (1150), 896 states have internal predecessors, (1150), 98 states have call successors, (98), 7 states have call predecessors, (98), 9 states have return successors, (107), 102 states have call predecessors, (107), 95 states have call successors, (107) [2024-10-10 22:30:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1355 transitions. [2024-10-10 22:30:00,135 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1355 transitions. Word has length 52 [2024-10-10 22:30:00,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:00,135 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1355 transitions. [2024-10-10 22:30:00,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-10 22:30:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1355 transitions. [2024-10-10 22:30:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-10 22:30:00,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:00,138 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:00,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-10 22:30:00,138 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:00,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1721720478, now seen corresponding path program 1 times [2024-10-10 22:30:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:00,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752486167] [2024-10-10 22:30:00,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:00,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:30:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:30:00,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:00,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752486167] [2024-10-10 22:30:00,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752486167] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:00,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170410865] [2024-10-10 22:30:00,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:00,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:00,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:00,421 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:00,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-10 22:30:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:00,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-10 22:30:00,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:00,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:00,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170410865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:00,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:00,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2024-10-10 22:30:00,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321891869] [2024-10-10 22:30:00,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:00,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:30:00,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:00,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:30:00,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-10-10 22:30:00,592 INFO L87 Difference]: Start difference. First operand 1000 states and 1355 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:00,743 INFO L93 Difference]: Finished difference Result 1482 states and 1991 transitions. [2024-10-10 22:30:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:30:00,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-10-10 22:30:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:00,748 INFO L225 Difference]: With dead ends: 1482 [2024-10-10 22:30:00,748 INFO L226 Difference]: Without dead ends: 1370 [2024-10-10 22:30:00,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-10-10 22:30:00,749 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 113 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:00,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 703 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2024-10-10 22:30:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1025. [2024-10-10 22:30:00,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 916 states have (on average 1.2805676855895196) internal successors, (1173), 920 states have internal predecessors, (1173), 99 states have call successors, (99), 7 states have call predecessors, (99), 9 states have return successors, (108), 102 states have call predecessors, (108), 96 states have call successors, (108) [2024-10-10 22:30:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1380 transitions. [2024-10-10 22:30:00,783 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1380 transitions. Word has length 52 [2024-10-10 22:30:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:00,783 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1380 transitions. [2024-10-10 22:30:00,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1380 transitions. [2024-10-10 22:30:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-10 22:30:00,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:00,785 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:00,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-10 22:30:00,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:00,992 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:00,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:00,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1755598368, now seen corresponding path program 1 times [2024-10-10 22:30:00,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:00,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551323431] [2024-10-10 22:30:00,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:00,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-10 22:30:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:30:01,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551323431] [2024-10-10 22:30:01,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551323431] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473181763] [2024-10-10 22:30:01,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:01,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:01,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:01,373 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:01,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-10 22:30:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:01,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-10 22:30:01,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:01,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:01,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473181763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:01,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:01,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2024-10-10 22:30:01,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009987768] [2024-10-10 22:30:01,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:01,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:30:01,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:01,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:30:01,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2024-10-10 22:30:01,603 INFO L87 Difference]: Start difference. First operand 1025 states and 1380 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:01,927 INFO L93 Difference]: Finished difference Result 1440 states and 1943 transitions. [2024-10-10 22:30:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-10 22:30:01,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2024-10-10 22:30:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:01,932 INFO L225 Difference]: With dead ends: 1440 [2024-10-10 22:30:01,932 INFO L226 Difference]: Without dead ends: 1265 [2024-10-10 22:30:01,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2024-10-10 22:30:01,933 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 105 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:01,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1067 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:30:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2024-10-10 22:30:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 947. [2024-10-10 22:30:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 843 states have (on average 1.2775800711743772) internal successors, (1077), 850 states have internal predecessors, (1077), 94 states have call successors, (94), 7 states have call predecessors, (94), 9 states have return successors, (100), 94 states have call predecessors, (100), 91 states have call successors, (100) [2024-10-10 22:30:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1271 transitions. [2024-10-10 22:30:01,981 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1271 transitions. Word has length 52 [2024-10-10 22:30:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:01,981 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1271 transitions. [2024-10-10 22:30:01,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1271 transitions. [2024-10-10 22:30:01,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-10 22:30:01,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:01,983 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:01,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-10 22:30:02,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-10 22:30:02,188 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:02,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash -601729851, now seen corresponding path program 1 times [2024-10-10 22:30:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:02,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749424639] [2024-10-10 22:30:02,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:02,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-10 22:30:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:30:02,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:02,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749424639] [2024-10-10 22:30:02,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749424639] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:02,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636217526] [2024-10-10 22:30:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:02,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:02,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:02,521 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:02,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-10 22:30:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:02,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-10 22:30:02,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:30:02,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:02,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636217526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:02,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:02,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2024-10-10 22:30:02,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848665483] [2024-10-10 22:30:02,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:02,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:30:02,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:02,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:30:02,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-10-10 22:30:02,652 INFO L87 Difference]: Start difference. First operand 947 states and 1271 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:02,768 INFO L93 Difference]: Finished difference Result 1156 states and 1547 transitions. [2024-10-10 22:30:02,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:30:02,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2024-10-10 22:30:02,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:02,775 INFO L225 Difference]: With dead ends: 1156 [2024-10-10 22:30:02,775 INFO L226 Difference]: Without dead ends: 1108 [2024-10-10 22:30:02,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-10-10 22:30:02,776 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 128 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:02,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 485 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:02,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2024-10-10 22:30:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 947. [2024-10-10 22:30:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 843 states have (on average 1.2740213523131672) internal successors, (1074), 850 states have internal predecessors, (1074), 94 states have call successors, (94), 7 states have call predecessors, (94), 9 states have return successors, (100), 94 states have call predecessors, (100), 91 states have call successors, (100) [2024-10-10 22:30:02,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1268 transitions. [2024-10-10 22:30:02,821 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1268 transitions. Word has length 54 [2024-10-10 22:30:02,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:02,822 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1268 transitions. [2024-10-10 22:30:02,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:02,822 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1268 transitions. [2024-10-10 22:30:02,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-10 22:30:02,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:02,823 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:02,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-10 22:30:03,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:03,025 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:03,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash 105625904, now seen corresponding path program 1 times [2024-10-10 22:30:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:03,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717845806] [2024-10-10 22:30:03,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:03,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-10 22:30:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-10 22:30:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:30:03,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:03,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717845806] [2024-10-10 22:30:03,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717845806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:03,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871119832] [2024-10-10 22:30:03,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:03,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:03,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:03,138 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:03,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-10 22:30:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-10 22:30:03,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-10 22:30:03,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:03,333 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-10 22:30:03,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871119832] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:03,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:30:03,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-10-10 22:30:03,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003475121] [2024-10-10 22:30:03,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:03,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 22:30:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:03,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 22:30:03,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:30:03,335 INFO L87 Difference]: Start difference. First operand 947 states and 1268 transitions. Second operand has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-10 22:30:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:03,531 INFO L93 Difference]: Finished difference Result 1329 states and 1791 transitions. [2024-10-10 22:30:03,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:30:03,531 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 55 [2024-10-10 22:30:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:03,535 INFO L225 Difference]: With dead ends: 1329 [2024-10-10 22:30:03,535 INFO L226 Difference]: Without dead ends: 1074 [2024-10-10 22:30:03,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:30:03,538 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 130 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:03,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1219 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2024-10-10 22:30:03,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 949. [2024-10-10 22:30:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 845 states have (on average 1.2650887573964498) internal successors, (1069), 852 states have internal predecessors, (1069), 94 states have call successors, (94), 7 states have call predecessors, (94), 9 states have return successors, (100), 94 states have call predecessors, (100), 91 states have call successors, (100) [2024-10-10 22:30:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1263 transitions. [2024-10-10 22:30:03,576 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1263 transitions. Word has length 55 [2024-10-10 22:30:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:03,576 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1263 transitions. [2024-10-10 22:30:03,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-10 22:30:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1263 transitions. [2024-10-10 22:30:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-10 22:30:03,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:03,577 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:03,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-10 22:30:03,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-10 22:30:03,778 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:03,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:03,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1790889133, now seen corresponding path program 1 times [2024-10-10 22:30:03,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:03,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706069595] [2024-10-10 22:30:03,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:03,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-10 22:30:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-10 22:30:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-10 22:30:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:30:03,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:30:03,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706069595] [2024-10-10 22:30:03,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706069595] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:03,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246101469] [2024-10-10 22:30:03,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:03,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:03,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:03,816 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:30:03,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-10 22:30:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:03,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:30:03,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:03,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:30:03,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:03,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246101469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:03,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:03,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-10 22:30:03,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583625014] [2024-10-10 22:30:03,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:03,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:30:03,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:30:03,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:30:03,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:03,898 INFO L87 Difference]: Start difference. First operand 949 states and 1263 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:03,953 INFO L93 Difference]: Finished difference Result 1885 states and 2512 transitions. [2024-10-10 22:30:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:30:03,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2024-10-10 22:30:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:03,957 INFO L225 Difference]: With dead ends: 1885 [2024-10-10 22:30:03,960 INFO L226 Difference]: Without dead ends: 960 [2024-10-10 22:30:03,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:03,961 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 14 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:03,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 330 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-10 22:30:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 952. [2024-10-10 22:30:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 847 states have (on average 1.2656434474616294) internal successors, (1072), 855 states have internal predecessors, (1072), 94 states have call successors, (94), 7 states have call predecessors, (94), 10 states have return successors, (106), 94 states have call predecessors, (106), 91 states have call successors, (106) [2024-10-10 22:30:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1272 transitions. [2024-10-10 22:30:03,999 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1272 transitions. Word has length 54 [2024-10-10 22:30:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:03,999 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1272 transitions. [2024-10-10 22:30:03,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1272 transitions. [2024-10-10 22:30:04,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-10 22:30:04,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:04,001 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:04,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-10 22:30:04,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:30:04,206 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:04,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:04,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1719554675, now seen corresponding path program 1 times [2024-10-10 22:30:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:30:04,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772657884] [2024-10-10 22:30:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:04,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:30:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:04,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 22:30:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:04,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-10 22:30:04,286 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 22:30:04,286 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:30:04,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-10 22:30:04,290 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:04,322 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:30:04,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:30:04 BoogieIcfgContainer [2024-10-10 22:30:04,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:30:04,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:30:04,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:30:04,325 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:30:04,326 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:29:48" (3/4) ... [2024-10-10 22:30:04,327 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-10 22:30:04,328 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:30:04,328 INFO L158 Benchmark]: Toolchain (without parser) took 16971.30ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 133.2MB in the beginning and 218.6MB in the end (delta: -85.5MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. [2024-10-10 22:30:04,328 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 100.7MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:04,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.67ms. Allocated memory is still 174.1MB. Free memory was 133.2MB in the beginning and 117.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 22:30:04,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.66ms. Allocated memory is still 174.1MB. Free memory was 117.4MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:04,330 INFO L158 Benchmark]: Boogie Preprocessor took 53.96ms. Allocated memory is still 174.1MB. Free memory was 115.4MB in the beginning and 112.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:04,330 INFO L158 Benchmark]: RCFGBuilder took 555.15ms. Allocated memory is still 174.1MB. Free memory was 112.7MB in the beginning and 121.5MB in the end (delta: -8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 22:30:04,331 INFO L158 Benchmark]: TraceAbstraction took 16038.93ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 120.9MB in the beginning and 218.6MB in the end (delta: -97.8MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2024-10-10 22:30:04,331 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 362.8MB. Free memory is still 218.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:04,331 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.08ms. Allocated memory is still 100.7MB. Free memory is still 69.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.67ms. Allocated memory is still 174.1MB. Free memory was 133.2MB in the beginning and 117.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.66ms. Allocated memory is still 174.1MB. Free memory was 117.4MB in the beginning and 115.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.96ms. Allocated memory is still 174.1MB. Free memory was 115.4MB in the beginning and 112.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 555.15ms. Allocated memory is still 174.1MB. Free memory was 112.7MB in the beginning and 121.5MB in the end (delta: -8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16038.93ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 120.9MB in the beginning and 218.6MB in the end (delta: -97.8MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 362.8MB. Free memory is still 218.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: 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 110, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=-127, eb=127] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); [L251] RET, EXPR base2flt(0, 0) VAL [ea=-127, eb=127] [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=33554431] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=33554431, e=-127, m=33554431] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=33554431, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=33554431] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=33554431, __retres4=16777216] [L80] return (__retres4); [L252] RET, EXPR base2flt(ma, ea) VAL [ea=-127, eb=127, ma=33554431, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L80] return (__retres4); [L253] RET, EXPR base2flt(mb, eb) VAL [a=16777216, ea=-127, eb=127, ma=33554431, mb=33554432, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, tmp=1, zero=0] [L263] sa = tmp VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, tmp___0=1] [L273] sb = tmp___0 VAL [a=16777216, b=4294967295, ea=-127, eb=127, ma=33554431, mb=33554432, sa=1, sb=1] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [a=16777216, b=4294967295] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [a=4294967295, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [a=4294967295, b=16777216, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [a=4294967295, b=16777216, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [a=4294967295, ea=127, eb=-127, ma=16777216, mb=0] [L113] EXPR mb | (1U << 24U) VAL [a=4294967295, ea=127, eb=-127, ma=16777216] [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [a=4294967295, ea=127, eb=-127, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [a=4294967295, delta=254, ea=127, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.0s, OverallIterations: 35, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2405 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2284 mSDsluCounter, 25501 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20750 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4747 IncrementalHoareTripleChecker+Invalid, 4904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 4751 mSDtfsCounter, 4747 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1502 GetRequests, 1184 SyntacticMatches, 2 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1042occurred in iteration=21, InterpolantAutomatonStates: 247, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 2350 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2318 NumberOfCodeBlocks, 2318 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 2425 ConstructedInterpolants, 0 QuantifiedInterpolants, 5748 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2493 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 56 InterpolantComputations, 30 PerfectInterpolantSequences, 677/760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-10 22:30:04,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:30:06,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:30:06,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-10 22:30:06,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:30:06,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:30:06,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:30:06,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:30:06,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:30:06,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:30:06,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:30:06,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:30:06,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:30:06,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:30:06,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:30:06,258 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:30:06,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:30:06,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:30:06,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:30:06,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:30:06,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:30:06,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:30:06,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:30:06,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:30:06,264 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-10 22:30:06,264 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-10 22:30:06,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:30:06,265 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-10 22:30:06,265 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:30:06,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:30:06,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:30:06,266 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:30:06,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:30:06,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:30:06,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:30:06,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:06,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:30:06,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:30:06,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:30:06,267 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-10 22:30:06,268 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-10 22:30:06,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:30:06,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:30:06,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:30:06,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:30:06,270 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-10 22:30:06,270 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2024-10-10 22:30:06,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:30:06,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:30:06,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:30:06,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:30:06,569 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:30:06,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-10-10 22:30:07,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:30:07,999 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:30:08,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-10-10 22:30:08,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5638c97e/0254dc22cd2d4acc9db7369df43d17e5/FLAG76941a780 [2024-10-10 22:30:08,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5638c97e/0254dc22cd2d4acc9db7369df43d17e5 [2024-10-10 22:30:08,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:30:08,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:30:08,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:08,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:30:08,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:30:08,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28edb2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08, skipping insertion in model container [2024-10-10 22:30:08,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:30:08,563 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-10-10 22:30:08,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:08,619 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:30:08,629 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c[730,743] [2024-10-10 22:30:08,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:30:08,680 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:30:08,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08 WrapperNode [2024-10-10 22:30:08,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:30:08,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:08,682 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:30:08,682 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:30:08,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,716 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 148 [2024-10-10 22:30:08,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:30:08,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:30:08,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:30:08,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:30:08,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,738 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:30:08,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:30:08,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:30:08,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:30:08,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:30:08,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (1/1) ... [2024-10-10 22:30:08,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:30:08,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:30:08,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:30:08,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:30:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:30:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-10 22:30:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-10-10 22:30:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-10-10 22:30:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:30:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:30:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-10 22:30:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-10 22:30:08,890 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:30:08,892 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:30:09,197 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-10-10 22:30:09,197 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:30:09,225 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:30:09,225 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 22:30:09,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:09 BoogieIcfgContainer [2024-10-10 22:30:09,225 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:30:09,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:30:09,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:30:09,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:30:09,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:30:08" (1/3) ... [2024-10-10 22:30:09,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b29bbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:09, skipping insertion in model container [2024-10-10 22:30:09,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:30:08" (2/3) ... [2024-10-10 22:30:09,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b29bbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:30:09, skipping insertion in model container [2024-10-10 22:30:09,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:09" (3/3) ... [2024-10-10 22:30:09,235 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2024-10-10 22:30:09,249 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:30:09,249 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:30:09,302 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:30:09,308 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1207346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:30:09,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:30:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 57 states have internal predecessors, (89), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-10 22:30:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:30:09,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:09,319 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:09,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:09,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:09,324 INFO L85 PathProgramCache]: Analyzing trace with hash -821609906, now seen corresponding path program 1 times [2024-10-10 22:30:09,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:09,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046667718] [2024-10-10 22:30:09,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:09,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:09,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:09,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:09,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-10 22:30:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:09,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:30:09,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:09,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:09,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:09,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046667718] [2024-10-10 22:30:09,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046667718] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:09,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-10 22:30:09,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508592812] [2024-10-10 22:30:09,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:09,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:09,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:09,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:09,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:09,618 INFO L87 Difference]: Start difference. First operand has 67 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 57 states have internal predecessors, (89), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:09,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:09,700 INFO L93 Difference]: Finished difference Result 144 states and 244 transitions. [2024-10-10 22:30:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:09,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-10-10 22:30:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:09,709 INFO L225 Difference]: With dead ends: 144 [2024-10-10 22:30:09,709 INFO L226 Difference]: Without dead ends: 77 [2024-10-10 22:30:09,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:09,714 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:09,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 497 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:09,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-10 22:30:09,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-10-10 22:30:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 63 states have internal predecessors, (91), 11 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2024-10-10 22:30:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2024-10-10 22:30:09,747 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 28 [2024-10-10 22:30:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:09,747 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2024-10-10 22:30:09,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2024-10-10 22:30:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 22:30:09,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:09,749 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:09,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-10 22:30:09,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:09,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:09,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1583015404, now seen corresponding path program 1 times [2024-10-10 22:30:09,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:09,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515121644] [2024-10-10 22:30:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:09,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:09,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:09,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:09,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-10 22:30:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:30:10,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:10,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:10,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:10,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515121644] [2024-10-10 22:30:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515121644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:10,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:10,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:30:10,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903399736] [2024-10-10 22:30:10,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:10,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:10,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:10,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:10,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:10,078 INFO L87 Difference]: Start difference. First operand 76 states and 117 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:10,167 INFO L93 Difference]: Finished difference Result 161 states and 251 transitions. [2024-10-10 22:30:10,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:10,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-10 22:30:10,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:10,171 INFO L225 Difference]: With dead ends: 161 [2024-10-10 22:30:10,171 INFO L226 Difference]: Without dead ends: 120 [2024-10-10 22:30:10,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:10,173 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 44 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:10,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 417 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-10 22:30:10,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-10-10 22:30:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.489795918367347) internal successors, (146), 99 states have internal predecessors, (146), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (20), 18 states have call predecessors, (20), 15 states have call successors, (20) [2024-10-10 22:30:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 182 transitions. [2024-10-10 22:30:10,193 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 182 transitions. Word has length 32 [2024-10-10 22:30:10,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:10,193 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 182 transitions. [2024-10-10 22:30:10,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 182 transitions. [2024-10-10 22:30:10,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-10 22:30:10,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:10,195 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:10,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-10 22:30:10,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:10,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:10,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:10,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2031893522, now seen corresponding path program 1 times [2024-10-10 22:30:10,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:10,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692299709] [2024-10-10 22:30:10,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:10,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:10,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:10,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:10,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-10 22:30:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:30:10,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:10,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:10,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:10,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692299709] [2024-10-10 22:30:10,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692299709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:10,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:10,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-10 22:30:10,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540554906] [2024-10-10 22:30:10,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:10,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:30:10,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:10,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:30:10,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:30:10,503 INFO L87 Difference]: Start difference. First operand 118 states and 182 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:10,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:10,595 INFO L93 Difference]: Finished difference Result 149 states and 227 transitions. [2024-10-10 22:30:10,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:30:10,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-10 22:30:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:10,598 INFO L225 Difference]: With dead ends: 149 [2024-10-10 22:30:10,599 INFO L226 Difference]: Without dead ends: 111 [2024-10-10 22:30:10,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:30:10,600 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 32 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:10,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 490 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-10 22:30:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-10-10 22:30:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 93 states have internal predecessors, (135), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (17), 15 states have call predecessors, (17), 12 states have call successors, (17) [2024-10-10 22:30:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 165 transitions. [2024-10-10 22:30:10,611 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 165 transitions. Word has length 32 [2024-10-10 22:30:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:10,612 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 165 transitions. [2024-10-10 22:30:10,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 165 transitions. [2024-10-10 22:30:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-10 22:30:10,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:10,617 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:10,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:10,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:10,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:10,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:10,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1482211659, now seen corresponding path program 1 times [2024-10-10 22:30:10,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:10,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203050602] [2024-10-10 22:30:10,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:10,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:10,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:10,822 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:10,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-10 22:30:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:10,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:30:10,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:10,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:10,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:10,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203050602] [2024-10-10 22:30:10,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203050602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:10,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:10,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:30:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231860991] [2024-10-10 22:30:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:30:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:10,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:30:10,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:10,886 INFO L87 Difference]: Start difference. First operand 109 states and 165 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:10,915 INFO L93 Difference]: Finished difference Result 184 states and 278 transitions. [2024-10-10 22:30:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:30:10,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-10 22:30:10,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:10,916 INFO L225 Difference]: With dead ends: 184 [2024-10-10 22:30:10,916 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 22:30:10,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:10,917 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 14 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:10,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 308 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 22:30:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 22:30:10,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 122 states have (on average 1.4180327868852458) internal successors, (173), 123 states have internal predecessors, (173), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (20), 18 states have call predecessors, (20), 15 states have call successors, (20) [2024-10-10 22:30:10,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 209 transitions. [2024-10-10 22:30:10,926 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 209 transitions. Word has length 36 [2024-10-10 22:30:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:10,926 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 209 transitions. [2024-10-10 22:30:10,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 209 transitions. [2024-10-10 22:30:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-10 22:30:10,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:10,928 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:10,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-10 22:30:11,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:11,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:11,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1791687283, now seen corresponding path program 1 times [2024-10-10 22:30:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:11,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455449337] [2024-10-10 22:30:11,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:11,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:11,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:11,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:11,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-10 22:30:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:30:11,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:11,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:11,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:11,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455449337] [2024-10-10 22:30:11,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455449337] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:11,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:11,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2024-10-10 22:30:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661609464] [2024-10-10 22:30:11,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:11,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:11,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:11,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:11,255 INFO L87 Difference]: Start difference. First operand 142 states and 209 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:11,319 INFO L93 Difference]: Finished difference Result 315 states and 471 transitions. [2024-10-10 22:30:11,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:11,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-10-10 22:30:11,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:11,321 INFO L225 Difference]: With dead ends: 315 [2024-10-10 22:30:11,321 INFO L226 Difference]: Without dead ends: 242 [2024-10-10 22:30:11,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:11,322 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 40 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:11,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 417 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:11,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-10 22:30:11,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2024-10-10 22:30:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 208 states have (on average 1.3846153846153846) internal successors, (288), 207 states have internal predecessors, (288), 28 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (34), 34 states have call predecessors, (34), 27 states have call successors, (34) [2024-10-10 22:30:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 350 transitions. [2024-10-10 22:30:11,340 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 350 transitions. Word has length 36 [2024-10-10 22:30:11,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:11,340 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 350 transitions. [2024-10-10 22:30:11,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:11,340 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 350 transitions. [2024-10-10 22:30:11,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-10 22:30:11,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:11,342 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:11,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:11,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:11,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:11,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:11,543 INFO L85 PathProgramCache]: Analyzing trace with hash -827400927, now seen corresponding path program 1 times [2024-10-10 22:30:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003974822] [2024-10-10 22:30:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:11,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:11,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:11,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:11,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-10 22:30:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:11,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:30:11,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:11,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:11,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:11,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003974822] [2024-10-10 22:30:11,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003974822] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:11,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:11,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-10 22:30:11,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756770196] [2024-10-10 22:30:11,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:11,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-10 22:30:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:11,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-10 22:30:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:30:11,679 INFO L87 Difference]: Start difference. First operand 240 states and 350 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:11,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:11,794 INFO L93 Difference]: Finished difference Result 275 states and 401 transitions. [2024-10-10 22:30:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:30:11,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-10-10 22:30:11,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:11,796 INFO L225 Difference]: With dead ends: 275 [2024-10-10 22:30:11,796 INFO L226 Difference]: Without dead ends: 226 [2024-10-10 22:30:11,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:30:11,797 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 27 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:11,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 566 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:11,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-10 22:30:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 222. [2024-10-10 22:30:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 196 states have (on average 1.3673469387755102) internal successors, (268), 195 states have internal predecessors, (268), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (28), 28 states have call predecessors, (28), 21 states have call successors, (28) [2024-10-10 22:30:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 318 transitions. [2024-10-10 22:30:11,810 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 318 transitions. Word has length 36 [2024-10-10 22:30:11,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:11,810 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 318 transitions. [2024-10-10 22:30:11,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 318 transitions. [2024-10-10 22:30:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-10 22:30:11,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:11,815 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:11,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-10 22:30:12,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:12,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:12,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:12,017 INFO L85 PathProgramCache]: Analyzing trace with hash 872052806, now seen corresponding path program 1 times [2024-10-10 22:30:12,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:12,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095330922] [2024-10-10 22:30:12,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:12,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:12,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:12,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:12,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-10 22:30:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:30:12,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:30:12,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:12,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:12,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095330922] [2024-10-10 22:30:12,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095330922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:12,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:12,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:30:12,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916040226] [2024-10-10 22:30:12,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:12,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:30:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:12,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:30:12,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:12,097 INFO L87 Difference]: Start difference. First operand 222 states and 318 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:12,149 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2024-10-10 22:30:12,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:30:12,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-10-10 22:30:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:12,153 INFO L225 Difference]: With dead ends: 386 [2024-10-10 22:30:12,153 INFO L226 Difference]: Without dead ends: 166 [2024-10-10 22:30:12,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:30:12,154 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 25 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:12,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 239 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-10 22:30:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2024-10-10 22:30:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 136 states have (on average 1.3308823529411764) internal successors, (181), 138 states have internal predecessors, (181), 15 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2024-10-10 22:30:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 216 transitions. [2024-10-10 22:30:12,166 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 216 transitions. Word has length 38 [2024-10-10 22:30:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:12,166 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 216 transitions. [2024-10-10 22:30:12,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 216 transitions. [2024-10-10 22:30:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 22:30:12,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:12,168 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:12,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-10 22:30:12,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:12,368 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:12,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:12,369 INFO L85 PathProgramCache]: Analyzing trace with hash 883826431, now seen corresponding path program 1 times [2024-10-10 22:30:12,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:12,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334635624] [2024-10-10 22:30:12,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:12,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:12,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:12,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:12,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-10 22:30:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:30:12,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:12,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:12,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:12,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334635624] [2024-10-10 22:30:12,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334635624] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:12,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:12,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-10 22:30:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35873024] [2024-10-10 22:30:12,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:12,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:30:12,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:30:12,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:30:12,560 INFO L87 Difference]: Start difference. First operand 156 states and 216 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:12,680 INFO L93 Difference]: Finished difference Result 237 states and 339 transitions. [2024-10-10 22:30:12,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:30:12,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-10-10 22:30:12,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:12,682 INFO L225 Difference]: With dead ends: 237 [2024-10-10 22:30:12,683 INFO L226 Difference]: Without dead ends: 201 [2024-10-10 22:30:12,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:30:12,684 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 23 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:12,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 286 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:12,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-10 22:30:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 191. [2024-10-10 22:30:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 165 states have (on average 1.3272727272727274) internal successors, (219), 168 states have internal predecessors, (219), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-10-10 22:30:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 266 transitions. [2024-10-10 22:30:12,693 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 266 transitions. Word has length 39 [2024-10-10 22:30:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:12,694 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 266 transitions. [2024-10-10 22:30:12,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 266 transitions. [2024-10-10 22:30:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 22:30:12,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:12,695 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:12,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-10 22:30:12,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:12,896 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:12,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:12,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1636133503, now seen corresponding path program 1 times [2024-10-10 22:30:12,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:12,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978989605] [2024-10-10 22:30:12,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:12,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:12,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:12,899 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:12,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-10 22:30:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:12,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:30:12,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:12,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:12,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:12,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978989605] [2024-10-10 22:30:12,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978989605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:12,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:12,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:30:12,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282686033] [2024-10-10 22:30:12,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:12,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:30:12,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:12,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:30:12,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:30:12,966 INFO L87 Difference]: Start difference. First operand 191 states and 266 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:13,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:13,011 INFO L93 Difference]: Finished difference Result 198 states and 272 transitions. [2024-10-10 22:30:13,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:30:13,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-10-10 22:30:13,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:13,012 INFO L225 Difference]: With dead ends: 198 [2024-10-10 22:30:13,012 INFO L226 Difference]: Without dead ends: 191 [2024-10-10 22:30:13,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:13,013 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:13,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 359 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-10 22:30:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-10-10 22:30:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 165 states have (on average 1.309090909090909) internal successors, (216), 168 states have internal predecessors, (216), 21 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (26), 23 states have call predecessors, (26), 20 states have call successors, (26) [2024-10-10 22:30:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 263 transitions. [2024-10-10 22:30:13,019 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 263 transitions. Word has length 39 [2024-10-10 22:30:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:13,020 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 263 transitions. [2024-10-10 22:30:13,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:13,020 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 263 transitions. [2024-10-10 22:30:13,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:30:13,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:13,021 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:13,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:13,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:13,221 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:13,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1292111742, now seen corresponding path program 1 times [2024-10-10 22:30:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:13,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637925790] [2024-10-10 22:30:13,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:13,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:13,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:13,224 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:13,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-10 22:30:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:13,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:30:13,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:13,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:13,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:13,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:13,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637925790] [2024-10-10 22:30:13,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637925790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:13,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:13,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:30:13,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667727790] [2024-10-10 22:30:13,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:13,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:30:13,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:30:13,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:13,277 INFO L87 Difference]: Start difference. First operand 191 states and 263 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:13,298 INFO L93 Difference]: Finished difference Result 318 states and 446 transitions. [2024-10-10 22:30:13,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:30:13,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-10-10 22:30:13,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:13,300 INFO L225 Difference]: With dead ends: 318 [2024-10-10 22:30:13,300 INFO L226 Difference]: Without dead ends: 266 [2024-10-10 22:30:13,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:13,301 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 27 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:13,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 275 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:13,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-10 22:30:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 208. [2024-10-10 22:30:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 179 states have (on average 1.318435754189944) internal successors, (236), 181 states have internal predecessors, (236), 24 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2024-10-10 22:30:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 289 transitions. [2024-10-10 22:30:13,308 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 289 transitions. Word has length 40 [2024-10-10 22:30:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:13,308 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 289 transitions. [2024-10-10 22:30:13,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 289 transitions. [2024-10-10 22:30:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:30:13,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:13,309 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:13,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-10 22:30:13,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:13,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:13,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash -327825386, now seen corresponding path program 2 times [2024-10-10 22:30:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:13,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484283440] [2024-10-10 22:30:13,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:30:13,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:13,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:13,513 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:13,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-10 22:30:13,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-10 22:30:13,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:30:13,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:30:13,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:13,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:13,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:13,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484283440] [2024-10-10 22:30:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484283440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:13,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:13,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:30:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828129769] [2024-10-10 22:30:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:13,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:13,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:13,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:13,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:13,660 INFO L87 Difference]: Start difference. First operand 208 states and 289 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:13,769 INFO L93 Difference]: Finished difference Result 214 states and 294 transitions. [2024-10-10 22:30:13,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:13,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-10-10 22:30:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:13,771 INFO L225 Difference]: With dead ends: 214 [2024-10-10 22:30:13,771 INFO L226 Difference]: Without dead ends: 212 [2024-10-10 22:30:13,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:30:13,772 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 3 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:13,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 431 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-10 22:30:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2024-10-10 22:30:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 184 states have internal predecessors, (239), 24 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2024-10-10 22:30:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 292 transitions. [2024-10-10 22:30:13,780 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 292 transitions. Word has length 40 [2024-10-10 22:30:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:13,781 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 292 transitions. [2024-10-10 22:30:13,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:13,781 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 292 transitions. [2024-10-10 22:30:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:30:13,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:13,782 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:13,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:13,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:13,983 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:13,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash -270567084, now seen corresponding path program 1 times [2024-10-10 22:30:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642787294] [2024-10-10 22:30:13,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:13,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:13,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:13,986 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:13,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-10 22:30:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-10 22:30:14,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:14,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:14,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642787294] [2024-10-10 22:30:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642787294] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-10 22:30:14,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:30:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-10-10 22:30:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872323182] [2024-10-10 22:30:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:14,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:30:14,254 INFO L87 Difference]: Start difference. First operand 212 states and 292 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:14,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:14,316 INFO L93 Difference]: Finished difference Result 218 states and 297 transitions. [2024-10-10 22:30:14,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:14,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-10-10 22:30:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:14,318 INFO L225 Difference]: With dead ends: 218 [2024-10-10 22:30:14,318 INFO L226 Difference]: Without dead ends: 216 [2024-10-10 22:30:14,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:30:14,319 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:14,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 426 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-10 22:30:14,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-10-10 22:30:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 185 states have (on average 1.308108108108108) internal successors, (242), 187 states have internal predecessors, (242), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (29), 26 states have call predecessors, (29), 23 states have call successors, (29) [2024-10-10 22:30:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 295 transitions. [2024-10-10 22:30:14,327 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 295 transitions. Word has length 40 [2024-10-10 22:30:14,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:14,328 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 295 transitions. [2024-10-10 22:30:14,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:14,328 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 295 transitions. [2024-10-10 22:30:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-10 22:30:14,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:14,329 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:14,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-10 22:30:14,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:14,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:14,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:14,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1475591700, now seen corresponding path program 1 times [2024-10-10 22:30:14,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:14,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909417813] [2024-10-10 22:30:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:14,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:14,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:14,533 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:14,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-10 22:30:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:30:14,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:14,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:14,578 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:14,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909417813] [2024-10-10 22:30:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909417813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:14,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:14,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:30:14,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4747687] [2024-10-10 22:30:14,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:14,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:30:14,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:14,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:30:14,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:14,579 INFO L87 Difference]: Start difference. First operand 216 states and 295 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:14,595 INFO L93 Difference]: Finished difference Result 231 states and 311 transitions. [2024-10-10 22:30:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:30:14,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-10-10 22:30:14,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:14,601 INFO L225 Difference]: With dead ends: 231 [2024-10-10 22:30:14,601 INFO L226 Difference]: Without dead ends: 194 [2024-10-10 22:30:14,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:14,601 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:14,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-10 22:30:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-10-10 22:30:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 163 states have (on average 1.3251533742331287) internal successors, (216), 166 states have internal predecessors, (216), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2024-10-10 22:30:14,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 267 transitions. [2024-10-10 22:30:14,611 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 267 transitions. Word has length 43 [2024-10-10 22:30:14,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:14,611 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 267 transitions. [2024-10-10 22:30:14,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:14,611 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 267 transitions. [2024-10-10 22:30:14,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 22:30:14,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:14,612 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:14,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:14,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:14,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:14,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:14,813 INFO L85 PathProgramCache]: Analyzing trace with hash 868602743, now seen corresponding path program 1 times [2024-10-10 22:30:14,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:14,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128249489] [2024-10-10 22:30:14,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:14,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:14,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:14,814 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:14,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-10 22:30:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:14,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:30:14,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:14,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:14,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:14,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128249489] [2024-10-10 22:30:14,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128249489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:14,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:14,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:30:14,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406068000] [2024-10-10 22:30:14,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:14,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:30:14,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:14,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:30:14,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:30:14,870 INFO L87 Difference]: Start difference. First operand 194 states and 267 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:14,961 INFO L93 Difference]: Finished difference Result 245 states and 339 transitions. [2024-10-10 22:30:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:14,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-10-10 22:30:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:14,963 INFO L225 Difference]: With dead ends: 245 [2024-10-10 22:30:14,963 INFO L226 Difference]: Without dead ends: 205 [2024-10-10 22:30:14,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:30:14,964 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:14,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 344 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-10 22:30:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 194. [2024-10-10 22:30:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 163 states have (on average 1.312883435582822) internal successors, (214), 166 states have internal predecessors, (214), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2024-10-10 22:30:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 265 transitions. [2024-10-10 22:30:14,979 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 265 transitions. Word has length 44 [2024-10-10 22:30:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:14,979 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 265 transitions. [2024-10-10 22:30:14,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 265 transitions. [2024-10-10 22:30:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-10 22:30:14,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:14,980 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:14,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-10 22:30:15,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:15,181 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:15,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash 475575733, now seen corresponding path program 1 times [2024-10-10 22:30:15,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:15,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618558597] [2024-10-10 22:30:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:15,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:15,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:15,183 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:15,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-10 22:30:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:15,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:30:15,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-10 22:30:15,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:15,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:15,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618558597] [2024-10-10 22:30:15,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618558597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:15,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:15,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:30:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016286752] [2024-10-10 22:30:15,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:15,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:30:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:15,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:30:15,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:15,235 INFO L87 Difference]: Start difference. First operand 194 states and 265 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:15,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:15,277 INFO L93 Difference]: Finished difference Result 267 states and 364 transitions. [2024-10-10 22:30:15,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:30:15,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-10-10 22:30:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:15,279 INFO L225 Difference]: With dead ends: 267 [2024-10-10 22:30:15,279 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:30:15,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:30:15,280 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 38 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:15,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 264 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:30:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 198. [2024-10-10 22:30:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.3053892215568863) internal successors, (218), 170 states have internal predecessors, (218), 24 states have call successors, (24), 4 states have call predecessors, (24), 6 states have return successors, (27), 25 states have call predecessors, (27), 23 states have call successors, (27) [2024-10-10 22:30:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 269 transitions. [2024-10-10 22:30:15,288 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 269 transitions. Word has length 44 [2024-10-10 22:30:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:15,289 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 269 transitions. [2024-10-10 22:30:15,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 269 transitions. [2024-10-10 22:30:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 22:30:15,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:15,289 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:15,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-10 22:30:15,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:15,492 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:15,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:15,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1102878043, now seen corresponding path program 1 times [2024-10-10 22:30:15,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:15,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658735540] [2024-10-10 22:30:15,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:15,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:15,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:15,494 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:15,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-10 22:30:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:15,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:30:15,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:15,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:15,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:15,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658735540] [2024-10-10 22:30:15,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658735540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:15,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:15,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:30:15,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814796840] [2024-10-10 22:30:15,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:15,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:30:15,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:15,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:30:15,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:15,565 INFO L87 Difference]: Start difference. First operand 198 states and 269 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:15,692 INFO L93 Difference]: Finished difference Result 271 states and 375 transitions. [2024-10-10 22:30:15,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:30:15,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-10-10 22:30:15,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:15,694 INFO L225 Difference]: With dead ends: 271 [2024-10-10 22:30:15,694 INFO L226 Difference]: Without dead ends: 247 [2024-10-10 22:30:15,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:30:15,695 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 25 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:15,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 354 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:15,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-10 22:30:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 232. [2024-10-10 22:30:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 197 states have (on average 1.299492385786802) internal successors, (256), 201 states have internal predecessors, (256), 28 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (31), 29 states have call predecessors, (31), 27 states have call successors, (31) [2024-10-10 22:30:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 315 transitions. [2024-10-10 22:30:15,703 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 315 transitions. Word has length 45 [2024-10-10 22:30:15,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:15,703 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 315 transitions. [2024-10-10 22:30:15,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 315 transitions. [2024-10-10 22:30:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 22:30:15,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:15,704 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:15,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-10 22:30:15,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:15,907 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:15,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1603492059, now seen corresponding path program 1 times [2024-10-10 22:30:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:15,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808652606] [2024-10-10 22:30:15,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:15,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:15,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:15,910 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:15,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-10 22:30:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:15,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:30:15,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:16,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:30:16,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:16,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808652606] [2024-10-10 22:30:16,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808652606] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:16,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:16,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-10-10 22:30:16,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484250153] [2024-10-10 22:30:16,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:16,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:30:16,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:16,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:30:16,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:30:16,062 INFO L87 Difference]: Start difference. First operand 232 states and 315 transitions. Second operand has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:16,132 INFO L93 Difference]: Finished difference Result 255 states and 341 transitions. [2024-10-10 22:30:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:30:16,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2024-10-10 22:30:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:16,134 INFO L225 Difference]: With dead ends: 255 [2024-10-10 22:30:16,134 INFO L226 Difference]: Without dead ends: 223 [2024-10-10 22:30:16,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:30:16,134 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 19 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:16,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 500 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-10 22:30:16,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 213. [2024-10-10 22:30:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 178 states have (on average 1.3089887640449438) internal successors, (233), 182 states have internal predecessors, (233), 28 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (31), 29 states have call predecessors, (31), 27 states have call successors, (31) [2024-10-10 22:30:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 292 transitions. [2024-10-10 22:30:16,143 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 292 transitions. Word has length 45 [2024-10-10 22:30:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:16,143 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 292 transitions. [2024-10-10 22:30:16,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-10 22:30:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 292 transitions. [2024-10-10 22:30:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-10 22:30:16,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:16,144 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:16,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-10 22:30:16,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:16,345 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:16,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:16,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1180790233, now seen corresponding path program 1 times [2024-10-10 22:30:16,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:16,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304842182] [2024-10-10 22:30:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:16,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:16,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:16,347 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:16,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-10 22:30:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:30:16,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:16,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:30:16,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:16,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304842182] [2024-10-10 22:30:16,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304842182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:30:16,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:30:16,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:30:16,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381803529] [2024-10-10 22:30:16,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:30:16,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:30:16,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:16,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:30:16,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:16,399 INFO L87 Difference]: Start difference. First operand 213 states and 292 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:16,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:16,421 INFO L93 Difference]: Finished difference Result 247 states and 333 transitions. [2024-10-10 22:30:16,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:30:16,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-10-10 22:30:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:16,423 INFO L225 Difference]: With dead ends: 247 [2024-10-10 22:30:16,423 INFO L226 Difference]: Without dead ends: 213 [2024-10-10 22:30:16,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:30:16,424 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 25 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:16,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 266 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:30:16,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-10 22:30:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-10-10 22:30:16,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 178 states have (on average 1.2415730337078652) internal successors, (221), 182 states have internal predecessors, (221), 28 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (31), 29 states have call predecessors, (31), 27 states have call successors, (31) [2024-10-10 22:30:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 280 transitions. [2024-10-10 22:30:16,440 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 280 transitions. Word has length 45 [2024-10-10 22:30:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:16,441 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 280 transitions. [2024-10-10 22:30:16,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-10 22:30:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 280 transitions. [2024-10-10 22:30:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:30:16,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:16,441 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:16,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-10 22:30:16,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:16,642 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:16,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash 678469660, now seen corresponding path program 1 times [2024-10-10 22:30:16,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:16,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380121154] [2024-10-10 22:30:16,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:16,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:16,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:16,644 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:16,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-10 22:30:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:30:16,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-10 22:30:16,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:30:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:30:16,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:30:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:30:16,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:30:16,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380121154] [2024-10-10 22:30:16,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380121154] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:30:16,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:30:16,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-10-10 22:30:16,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15742229] [2024-10-10 22:30:16,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:30:16,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:30:16,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:30:16,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:30:16,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:30:16,797 INFO L87 Difference]: Start difference. First operand 213 states and 280 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:30:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:30:16,907 INFO L93 Difference]: Finished difference Result 245 states and 311 transitions. [2024-10-10 22:30:16,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-10 22:30:16,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2024-10-10 22:30:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:30:16,908 INFO L225 Difference]: With dead ends: 245 [2024-10-10 22:30:16,908 INFO L226 Difference]: Without dead ends: 195 [2024-10-10 22:30:16,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:30:16,909 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 16 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:30:16,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 617 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:30:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-10 22:30:16,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2024-10-10 22:30:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 157 states have (on average 1.2356687898089171) internal successors, (194), 161 states have internal predecessors, (194), 23 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (26), 24 states have call predecessors, (26), 22 states have call successors, (26) [2024-10-10 22:30:16,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 243 transitions. [2024-10-10 22:30:16,917 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 243 transitions. Word has length 46 [2024-10-10 22:30:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:30:16,918 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 243 transitions. [2024-10-10 22:30:16,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-10 22:30:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 243 transitions. [2024-10-10 22:30:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-10 22:30:16,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:30:16,919 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:16,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:17,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:17,120 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:30:17,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:30:17,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1622352930, now seen corresponding path program 1 times [2024-10-10 22:30:17,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:30:17,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768188134] [2024-10-10 22:30:17,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:30:17,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:17,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:30:17,121 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-10 22:30:17,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-10 22:30:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:17,160 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 22:30:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:30:17,212 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-10 22:30:17,213 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 22:30:17,213 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:30:17,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-10 22:30:17,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-10 22:30:17,417 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:30:17,439 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:30:17,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:30:17 BoogieIcfgContainer [2024-10-10 22:30:17,441 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:30:17,441 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:30:17,441 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:30:17,441 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:30:17,441 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:30:09" (3/4) ... [2024-10-10 22:30:17,442 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-10 22:30:17,485 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:30:17,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:30:17,486 INFO L158 Benchmark]: Toolchain (without parser) took 9108.33ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 44.0MB in the beginning and 33.7MB in the end (delta: 10.3MB). Peak memory consumption was 45.8MB. Max. memory is 16.1GB. [2024-10-10 22:30:17,486 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory was 33.2MB in the beginning and 33.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:30:17,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.00ms. Allocated memory is still 77.6MB. Free memory was 43.9MB in the beginning and 48.0MB in the end (delta: -4.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-10-10 22:30:17,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.13ms. Allocated memory is still 77.6MB. Free memory was 48.0MB in the beginning and 45.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:17,487 INFO L158 Benchmark]: Boogie Preprocessor took 34.55ms. Allocated memory is still 77.6MB. Free memory was 45.9MB in the beginning and 43.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:17,487 INFO L158 Benchmark]: RCFGBuilder took 473.13ms. Allocated memory is still 77.6MB. Free memory was 43.5MB in the beginning and 45.0MB in the end (delta: -1.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-10-10 22:30:17,488 INFO L158 Benchmark]: TraceAbstraction took 8212.73ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 44.4MB in the beginning and 36.9MB in the end (delta: 7.6MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2024-10-10 22:30:17,488 INFO L158 Benchmark]: Witness Printer took 44.09ms. Allocated memory is still 113.2MB. Free memory was 36.9MB in the beginning and 33.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:30:17,489 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.15ms. Allocated memory is still 54.5MB. Free memory was 33.2MB in the beginning and 33.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.00ms. Allocated memory is still 77.6MB. Free memory was 43.9MB in the beginning and 48.0MB in the end (delta: -4.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.13ms. Allocated memory is still 77.6MB. Free memory was 48.0MB in the beginning and 45.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.55ms. Allocated memory is still 77.6MB. Free memory was 45.9MB in the beginning and 43.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.13ms. Allocated memory is still 77.6MB. Free memory was 43.5MB in the beginning and 45.0MB in the end (delta: -1.5MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8212.73ms. Allocated memory was 77.6MB in the beginning and 113.2MB in the end (delta: 35.7MB). Free memory was 44.4MB in the beginning and 36.9MB in the end (delta: 7.6MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * Witness Printer took 44.09ms. Allocated memory is still 113.2MB. Free memory was 36.9MB in the beginning and 33.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); [L251] RET, EXPR base2flt(0, 0) [L251] zero = base2flt(0, 0) [L252] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=-2147483648] [L80] return (__retres4); [L252] RET, EXPR base2flt(ma, ea) VAL [ea=0, ma=16777216, zero=0] [L252] a = base2flt(ma, ea) [L253] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=-1073741824] [L80] return (__retres4); [L253] RET, EXPR base2flt(mb, eb) VAL [a=-2147483648, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L253] b = base2flt(mb, eb) [L255] COND FALSE !(a < zero) VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, zero=0] [L258] COND TRUE a > zero [L259] tmp = 1 VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, tmp=1, zero=0] [L263] sa = tmp VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, zero=0] [L265] COND FALSE !(b < zero) VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, zero=0] [L268] COND TRUE b > zero [L269] tmp___0 = 1 VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, tmp___0=1] [L273] sb = tmp___0 VAL [a=-2147483648, b=-1073741824, ea=0, eb=64, ma=16777216, mb=16777216, sa=1, sb=1] [L276] CALL addflt(a, b) [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [a=-2147483648, b=-1073741824] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [a=-1073741824, b=-2147483648] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [a=-1073741824, delta=64, ea=64, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422 mSDsluCounter, 7325 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5618 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1306 IncrementalHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 1707 mSDtfsCounter, 1306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1008 GetRequests, 903 SyntacticMatches, 4 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240occurred in iteration=5, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 173 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 794 NumberOfCodeBlocks, 778 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 992 ConstructedInterpolants, 2 QuantifiedInterpolants, 1663 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1452 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 26 InterpolantComputations, 14 PerfectInterpolantSequences, 306/344 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 proved your program to be incorrect! [2024-10-10 22:30:17,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE