./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:14:52,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:14:52,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:14:52,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:14:52,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:14:52,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:14:52,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:14:52,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:14:52,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:14:52,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:14:52,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:14:52,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:14:52,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:14:52,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:14:52,894 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:14:52,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:14:52,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:14:52,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:14:52,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:14:52,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:14:52,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:14:52,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:14:52,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:14:52,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:14:52,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:14:52,897 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:14:52,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:14:52,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:14:52,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:14:52,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:14:52,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:14:52,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:14:52,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:14:52,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:14:52,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:14:52,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:14:52,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:14:52,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:14:52,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:14:52,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:14:52,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:14:52,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:14:52,901 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-11-21 21:14:53,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:14:53,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:14:53,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:14:53,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:14:53,127 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:14:53,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-21 21:14:54,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:14:54,537 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:14:54,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-21 21:14:54,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46699407/2cccd33d8094466cab0633c763eab591/FLAGd685d375c [2024-11-21 21:14:54,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b46699407/2cccd33d8094466cab0633c763eab591 [2024-11-21 21:14:54,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:14:54,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:14:54,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:14:54,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:14:54,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:14:54,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:14:54" (1/1) ... [2024-11-21 21:14:54,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35bea00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:54, skipping insertion in model container [2024-11-21 21:14:54,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:14:54" (1/1) ... [2024-11-21 21:14:54,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:14:55,099 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-21 21:14:55,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:14:55,139 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:14:55,148 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-21 21:14:55,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:14:55,181 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:14:55,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55 WrapperNode [2024-11-21 21:14:55,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:14:55,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:14:55,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:14:55,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:14:55,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,209 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-21 21:14:55,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:14:55,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:14:55,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:14:55,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:14:55,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,225 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,237 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-21 21:14:55,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,247 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:14:55,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:14:55,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:14:55,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:14:55,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (1/1) ... [2024-11-21 21:14:55,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:14:55,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:14:55,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 21:14:55,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 21:14:55,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:14:55,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:14:55,311 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-21 21:14:55,311 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-21 21:14:55,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:14:55,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:14:55,311 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-21 21:14:55,313 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-21 21:14:55,313 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-21 21:14:55,313 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-21 21:14:55,363 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:14:55,364 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:14:55,606 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-21 21:14:55,606 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:14:55,619 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:14:55,620 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-21 21:14:55,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:14:55 BoogieIcfgContainer [2024-11-21 21:14:55,621 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:14:55,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:14:55,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:14:55,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:14:55,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:14:54" (1/3) ... [2024-11-21 21:14:55,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4100ab37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:14:55, skipping insertion in model container [2024-11-21 21:14:55,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:14:55" (2/3) ... [2024-11-21 21:14:55,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4100ab37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:14:55, skipping insertion in model container [2024-11-21 21:14:55,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:14:55" (3/3) ... [2024-11-21 21:14:55,629 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-11-21 21:14:55,645 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:14:55,645 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:14:55,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:14:55,692 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;@1a50851e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:14:55,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:14:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 64 states have (on average 1.5) internal successors, (96), 65 states have internal predecessors, (96), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-21 21:14:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-21 21:14:55,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:14:55,705 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:14:55,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:14:55,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:14:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash 453789429, now seen corresponding path program 1 times [2024-11-21 21:14:55,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:14:55,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713507141] [2024-11-21 21:14:55,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:14:55,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:14:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:14:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:14:56,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:14:56,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713507141] [2024-11-21 21:14:56,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713507141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:14:56,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241717938] [2024-11-21 21:14:56,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:14:56,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:14:56,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:14:56,198 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:14:56,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-21 21:14:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:14:56,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-21 21:14:56,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:14:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:14:56,318 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:14:56,493 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:14:56,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241717938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:14:56,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 21:14:56,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-21 21:14:56,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438722236] [2024-11-21 21:14:56,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 21:14:56,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-21 21:14:56,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:14:56,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-21 21:14:56,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-21 21:14:56,524 INFO L87 Difference]: Start difference. First operand has 78 states, 64 states have (on average 1.5) internal successors, (96), 65 states have internal predecessors, (96), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-21 21:14:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:14:56,691 INFO L93 Difference]: Finished difference Result 176 states and 271 transitions. [2024-11-21 21:14:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 21:14:56,693 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2024-11-21 21:14:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:14:56,700 INFO L225 Difference]: With dead ends: 176 [2024-11-21 21:14:56,701 INFO L226 Difference]: Without dead ends: 95 [2024-11-21 21:14:56,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-21 21:14:56,709 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 24 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:14:56,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1279 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:14:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-21 21:14:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2024-11-21 21:14:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 72 states have internal predecessors, (96), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-21 21:14:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-11-21 21:14:56,751 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 35 [2024-11-21 21:14:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:14:56,751 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-21 21:14:56,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-21 21:14:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2024-11-21 21:14:56,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-21 21:14:56,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:14:56,754 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:14:56,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-21 21:14:56,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-21 21:14:56,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:14:56,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:14:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1079320092, now seen corresponding path program 1 times [2024-11-21 21:14:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:14:56,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433381231] [2024-11-21 21:14:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:14:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:14:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:14:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:14:57,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:14:57,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433381231] [2024-11-21 21:14:57,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433381231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:14:57,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:14:57,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-21 21:14:57,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751615301] [2024-11-21 21:14:57,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:14:57,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 21:14:57,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:14:57,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 21:14:57,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-21 21:14:57,093 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:14:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:14:57,156 INFO L93 Difference]: Finished difference Result 159 states and 216 transitions. [2024-11-21 21:14:57,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 21:14:57,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-21 21:14:57,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:14:57,159 INFO L225 Difference]: With dead ends: 159 [2024-11-21 21:14:57,161 INFO L226 Difference]: Without dead ends: 110 [2024-11-21 21:14:57,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-21 21:14:57,163 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 13 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:14:57,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 670 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:14:57,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-21 21:14:57,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-11-21 21:14:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 78 states have internal predecessors, (102), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-21 21:14:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2024-11-21 21:14:57,173 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 39 [2024-11-21 21:14:57,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:14:57,174 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2024-11-21 21:14:57,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:14:57,174 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2024-11-21 21:14:57,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-21 21:14:57,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:14:57,176 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:14:57,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:14:57,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:14:57,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:14:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash -879159838, now seen corresponding path program 1 times [2024-11-21 21:14:57,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:14:57,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8385391] [2024-11-21 21:14:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:14:57,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:14:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:14:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:14:57,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:14:57,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8385391] [2024-11-21 21:14:57,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8385391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:14:57,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:14:57,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-21 21:14:57,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862620133] [2024-11-21 21:14:57,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:14:57,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 21:14:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:14:57,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 21:14:57,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-21 21:14:57,368 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:14:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:14:57,469 INFO L93 Difference]: Finished difference Result 178 states and 244 transitions. [2024-11-21 21:14:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 21:14:57,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-11-21 21:14:57,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:14:57,471 INFO L225 Difference]: With dead ends: 178 [2024-11-21 21:14:57,471 INFO L226 Difference]: Without dead ends: 138 [2024-11-21 21:14:57,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-21 21:14:57,473 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 83 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:14:57,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 789 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:14:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-21 21:14:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2024-11-21 21:14:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 108 states have internal predecessors, (144), 16 states have call successors, (16), 6 states have call predecessors, (16), 7 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-21 21:14:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2024-11-21 21:14:57,491 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 43 [2024-11-21 21:14:57,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:14:57,492 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2024-11-21 21:14:57,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:14:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2024-11-21 21:14:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-21 21:14:57,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:14:57,494 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:14:57,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:14:57,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:14:57,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:14:57,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1272186848, now seen corresponding path program 1 times [2024-11-21 21:14:57,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:14:57,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94510502] [2024-11-21 21:14:57,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:14:57,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:14:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:14:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:14:57,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:14:57,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94510502] [2024-11-21 21:14:57,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94510502] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:14:57,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803709090] [2024-11-21 21:14:57,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:14:57,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:14:57,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:14:57,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:14:57,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-21 21:14:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:14:57,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-21 21:14:57,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:14:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:14:57,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:14:57,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:14:57,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803709090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:14:57,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 21:14:57,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-21 21:14:57,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191156703] [2024-11-21 21:14:57,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 21:14:57,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-21 21:14:57,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:14:57,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-21 21:14:57,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-21 21:14:57,809 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-21 21:14:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:14:57,879 INFO L93 Difference]: Finished difference Result 224 states and 308 transitions. [2024-11-21 21:14:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 21:14:57,880 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2024-11-21 21:14:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:14:57,882 INFO L225 Difference]: With dead ends: 224 [2024-11-21 21:14:57,883 INFO L226 Difference]: Without dead ends: 153 [2024-11-21 21:14:57,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-21 21:14:57,884 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 16 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:14:57,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 997 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:14:57,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-21 21:14:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2024-11-21 21:14:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 113 states have (on average 1.336283185840708) internal successors, (151), 115 states have internal predecessors, (151), 18 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-21 21:14:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2024-11-21 21:14:57,900 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 43 [2024-11-21 21:14:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:14:57,900 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2024-11-21 21:14:57,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-21 21:14:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2024-11-21 21:14:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-21 21:14:57,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:14:57,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:14:57,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-21 21:14:58,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-21 21:14:58,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:14:58,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:14:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -642851046, now seen corresponding path program 1 times [2024-11-21 21:14:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:14:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596025577] [2024-11-21 21:14:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:14:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:14:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:14:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 21:14:58,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:14:58,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596025577] [2024-11-21 21:14:58,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596025577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:14:58,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:14:58,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-21 21:14:58,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034735471] [2024-11-21 21:14:58,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:14:58,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-21 21:14:58,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:14:58,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-21 21:14:58,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-21 21:14:58,375 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-21 21:14:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:14:58,586 INFO L93 Difference]: Finished difference Result 203 states and 273 transitions. [2024-11-21 21:14:58,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 21:14:58,587 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2024-11-21 21:14:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:14:58,589 INFO L225 Difference]: With dead ends: 203 [2024-11-21 21:14:58,590 INFO L226 Difference]: Without dead ends: 195 [2024-11-21 21:14:58,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-21 21:14:58,591 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:14:58,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1491 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:14:58,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-21 21:14:58,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2024-11-21 21:14:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 118 states have internal predecessors, (155), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (22), 19 states have call predecessors, (22), 18 states have call successors, (22) [2024-11-21 21:14:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 196 transitions. [2024-11-21 21:14:58,609 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 196 transitions. Word has length 44 [2024-11-21 21:14:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:14:58,610 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 196 transitions. [2024-11-21 21:14:58,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-21 21:14:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 196 transitions. [2024-11-21 21:14:58,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-21 21:14:58,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:14:58,612 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:14:58,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:14:58,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:14:58,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:14:58,613 INFO L85 PathProgramCache]: Analyzing trace with hash 879448533, now seen corresponding path program 2 times [2024-11-21 21:14:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:14:58,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213439800] [2024-11-21 21:14:58,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:14:58,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:14:58,644 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-21 21:14:58,646 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:14:58,880 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-21 21:14:58,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:14:58,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213439800] [2024-11-21 21:14:58,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213439800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:14:58,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:14:58,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-21 21:14:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276311773] [2024-11-21 21:14:58,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:14:58,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-21 21:14:58,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:14:58,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-21 21:14:58,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-21 21:14:58,882 INFO L87 Difference]: Start difference. First operand 145 states and 196 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:14:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:14:59,067 INFO L93 Difference]: Finished difference Result 290 states and 395 transitions. [2024-11-21 21:14:59,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-21 21:14:59,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-21 21:14:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:14:59,071 INFO L225 Difference]: With dead ends: 290 [2024-11-21 21:14:59,071 INFO L226 Difference]: Without dead ends: 233 [2024-11-21 21:14:59,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-21 21:14:59,073 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 131 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:14:59,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1360 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:14:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-21 21:14:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 204. [2024-11-21 21:14:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 166 states have (on average 1.3132530120481927) internal successors, (218), 169 states have internal predecessors, (218), 25 states have call successors, (25), 10 states have call predecessors, (25), 12 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-21 21:14:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 275 transitions. [2024-11-21 21:14:59,089 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 275 transitions. Word has length 43 [2024-11-21 21:14:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:14:59,089 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 275 transitions. [2024-11-21 21:14:59,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:14:59,089 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 275 transitions. [2024-11-21 21:14:59,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-21 21:14:59,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:14:59,090 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:14:59,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:14:59,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:14:59,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:14:59,091 INFO L85 PathProgramCache]: Analyzing trace with hash 486421523, now seen corresponding path program 1 times [2024-11-21 21:14:59,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:14:59,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996900662] [2024-11-21 21:14:59,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:14:59,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:14:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:14:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-21 21:14:59,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:14:59,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996900662] [2024-11-21 21:14:59,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996900662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:14:59,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:14:59,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-21 21:14:59,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991625646] [2024-11-21 21:14:59,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:14:59,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-21 21:14:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:14:59,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-21 21:14:59,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-21 21:14:59,425 INFO L87 Difference]: Start difference. First operand 204 states and 275 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:14:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:14:59,572 INFO L93 Difference]: Finished difference Result 219 states and 293 transitions. [2024-11-21 21:14:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 21:14:59,573 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-21 21:14:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:14:59,575 INFO L225 Difference]: With dead ends: 219 [2024-11-21 21:14:59,575 INFO L226 Difference]: Without dead ends: 217 [2024-11-21 21:14:59,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-21 21:14:59,576 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 72 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:14:59,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1191 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:14:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-21 21:14:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 208. [2024-11-21 21:14:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 172 states have internal predecessors, (221), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-21 21:14:59,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 278 transitions. [2024-11-21 21:14:59,589 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 278 transitions. Word has length 43 [2024-11-21 21:14:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:14:59,589 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 278 transitions. [2024-11-21 21:14:59,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:14:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 278 transitions. [2024-11-21 21:14:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-21 21:14:59,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:14:59,592 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:14:59,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:14:59,592 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:14:59,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:14:59,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1201861858, now seen corresponding path program 1 times [2024-11-21 21:14:59,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:14:59,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236265986] [2024-11-21 21:14:59,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:14:59,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:14:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:14:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-21 21:14:59,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:14:59,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236265986] [2024-11-21 21:14:59,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236265986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:14:59,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:14:59,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 21:14:59,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599894913] [2024-11-21 21:14:59,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:14:59,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 21:14:59,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:14:59,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 21:14:59,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:14:59,651 INFO L87 Difference]: Start difference. First operand 208 states and 278 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-21 21:14:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:14:59,678 INFO L93 Difference]: Finished difference Result 216 states and 285 transitions. [2024-11-21 21:14:59,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 21:14:59,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2024-11-21 21:14:59,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:14:59,681 INFO L225 Difference]: With dead ends: 216 [2024-11-21 21:14:59,681 INFO L226 Difference]: Without dead ends: 201 [2024-11-21 21:14:59,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-21 21:14:59,682 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:14:59,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 491 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:14:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-21 21:14:59,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-11-21 21:14:59,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 164 states have (on average 1.3109756097560976) internal successors, (215), 168 states have internal predecessors, (215), 23 states have call successors, (23), 11 states have call predecessors, (23), 13 states have return successors, (29), 21 states have call predecessors, (29), 22 states have call successors, (29) [2024-11-21 21:14:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 267 transitions. [2024-11-21 21:14:59,695 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 267 transitions. Word has length 46 [2024-11-21 21:14:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:14:59,696 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 267 transitions. [2024-11-21 21:14:59,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-21 21:14:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 267 transitions. [2024-11-21 21:14:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-21 21:14:59,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:14:59,699 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:14:59,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 21:14:59,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:14:59,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:14:59,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1225681735, now seen corresponding path program 1 times [2024-11-21 21:14:59,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:14:59,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740312414] [2024-11-21 21:14:59,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:14:59,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:14:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:14:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 21:14:59,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:14:59,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740312414] [2024-11-21 21:14:59,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740312414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:14:59,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560667663] [2024-11-21 21:14:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:14:59,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:14:59,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:14:59,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:14:59,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 21:14:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:14:59,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-21 21:14:59,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 21:15:00,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 21:15:00,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560667663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:00,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 21:15:00,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-21 21:15:00,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679190418] [2024-11-21 21:15:00,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:00,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-21 21:15:00,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:00,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-21 21:15:00,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-21 21:15:00,359 INFO L87 Difference]: Start difference. First operand 201 states and 267 transitions. Second operand has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-21 21:15:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:01,723 INFO L93 Difference]: Finished difference Result 408 states and 577 transitions. [2024-11-21 21:15:01,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-21 21:15:01,724 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2024-11-21 21:15:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:01,726 INFO L225 Difference]: With dead ends: 408 [2024-11-21 21:15:01,726 INFO L226 Difference]: Without dead ends: 383 [2024-11-21 21:15:01,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2024-11-21 21:15:01,728 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 232 mSDsluCounter, 4382 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 4591 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:01,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 4591 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-21 21:15:01,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-21 21:15:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 238. [2024-11-21 21:15:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 192 states have (on average 1.3020833333333333) internal successors, (250), 199 states have internal predecessors, (250), 28 states have call successors, (28), 10 states have call predecessors, (28), 17 states have return successors, (45), 28 states have call predecessors, (45), 27 states have call successors, (45) [2024-11-21 21:15:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 323 transitions. [2024-11-21 21:15:01,742 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 323 transitions. Word has length 48 [2024-11-21 21:15:01,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:01,742 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 323 transitions. [2024-11-21 21:15:01,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-21 21:15:01,743 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 323 transitions. [2024-11-21 21:15:01,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-21 21:15:01,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:01,744 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:01,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-21 21:15:01,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:01,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:01,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:01,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1683702903, now seen corresponding path program 2 times [2024-11-21 21:15:01,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:01,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500593008] [2024-11-21 21:15:01,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:15:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:01,961 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 21:15:01,961 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 21:15:02,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:02,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500593008] [2024-11-21 21:15:02,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500593008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:15:02,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782073577] [2024-11-21 21:15:02,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:15:02,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:02,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:02,096 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:15:02,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-21 21:15:02,136 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 21:15:02,136 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:02,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-21 21:15:02,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 21:15:02,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:02,539 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 21:15:02,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782073577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:02,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 21:15:02,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 30 [2024-11-21 21:15:02,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592579379] [2024-11-21 21:15:02,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:02,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-21 21:15:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:02,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-21 21:15:02,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2024-11-21 21:15:02,542 INFO L87 Difference]: Start difference. First operand 238 states and 323 transitions. Second operand has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-21 21:15:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:03,506 INFO L93 Difference]: Finished difference Result 441 states and 656 transitions. [2024-11-21 21:15:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-21 21:15:03,506 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2024-11-21 21:15:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:03,508 INFO L225 Difference]: With dead ends: 441 [2024-11-21 21:15:03,508 INFO L226 Difference]: Without dead ends: 426 [2024-11-21 21:15:03,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=2705, Unknown=0, NotChecked=0, Total=2970 [2024-11-21 21:15:03,510 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 300 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 3410 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:03,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 3410 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:15:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-21 21:15:03,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 261. [2024-11-21 21:15:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 206 states have (on average 1.2815533980582525) internal successors, (264), 215 states have internal predecessors, (264), 34 states have call successors, (34), 11 states have call predecessors, (34), 20 states have return successors, (69), 34 states have call predecessors, (69), 33 states have call successors, (69) [2024-11-21 21:15:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 367 transitions. [2024-11-21 21:15:03,529 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 367 transitions. Word has length 48 [2024-11-21 21:15:03,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:03,530 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 367 transitions. [2024-11-21 21:15:03,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-21 21:15:03,530 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 367 transitions. [2024-11-21 21:15:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-21 21:15:03,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:03,532 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:03,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-21 21:15:03,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:03,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:03,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash -192811591, now seen corresponding path program 1 times [2024-11-21 21:15:03,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:03,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992934962] [2024-11-21 21:15:03,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:03,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:03,761 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:15:03,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:03,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992934962] [2024-11-21 21:15:03,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992934962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:15:03,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932626992] [2024-11-21 21:15:03,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:03,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:03,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:03,764 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:15:03,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-21 21:15:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:03,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 21:15:03,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-21 21:15:03,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:15:03,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932626992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:03,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 21:15:03,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-21 21:15:03,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732115253] [2024-11-21 21:15:03,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:03,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:03,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:15:03,818 INFO L87 Difference]: Start difference. First operand 261 states and 367 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:03,853 INFO L93 Difference]: Finished difference Result 524 states and 741 transitions. [2024-11-21 21:15:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:03,853 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-11-21 21:15:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:03,854 INFO L225 Difference]: With dead ends: 524 [2024-11-21 21:15:03,854 INFO L226 Difference]: Without dead ends: 266 [2024-11-21 21:15:03,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 21:15:03,855 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:03,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-21 21:15:03,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2024-11-21 21:15:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 209 states have (on average 1.2822966507177034) internal successors, (268), 218 states have internal predecessors, (268), 34 states have call successors, (34), 11 states have call predecessors, (34), 20 states have return successors, (69), 34 states have call predecessors, (69), 33 states have call successors, (69) [2024-11-21 21:15:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 371 transitions. [2024-11-21 21:15:03,868 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 371 transitions. Word has length 52 [2024-11-21 21:15:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:03,868 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 371 transitions. [2024-11-21 21:15:03,869 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 371 transitions. [2024-11-21 21:15:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-21 21:15:03,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:03,870 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:03,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-21 21:15:04,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-21 21:15:04,071 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:04,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:04,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1514904809, now seen corresponding path program 1 times [2024-11-21 21:15:04,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:04,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967246488] [2024-11-21 21:15:04,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:04,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 21:15:04,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:04,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967246488] [2024-11-21 21:15:04,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967246488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:15:04,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486778923] [2024-11-21 21:15:04,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:04,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:04,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:04,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:15:04,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-21 21:15:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:04,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-21 21:15:04,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-21 21:15:04,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:15:04,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486778923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:04,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 21:15:04,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-21 21:15:04,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029974581] [2024-11-21 21:15:04,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:04,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:15:04,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:04,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:15:04,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:04,172 INFO L87 Difference]: Start difference. First operand 264 states and 371 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:04,199 INFO L93 Difference]: Finished difference Result 531 states and 751 transitions. [2024-11-21 21:15:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:15:04,200 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2024-11-21 21:15:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:04,202 INFO L225 Difference]: With dead ends: 531 [2024-11-21 21:15:04,202 INFO L226 Difference]: Without dead ends: 270 [2024-11-21 21:15:04,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:15:04,203 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:04,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:04,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-21 21:15:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2024-11-21 21:15:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 211 states have (on average 1.2796208530805686) internal successors, (270), 220 states have internal predecessors, (270), 34 states have call successors, (34), 11 states have call predecessors, (34), 20 states have return successors, (69), 34 states have call predecessors, (69), 33 states have call successors, (69) [2024-11-21 21:15:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2024-11-21 21:15:04,217 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 53 [2024-11-21 21:15:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:04,218 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2024-11-21 21:15:04,218 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:04,218 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2024-11-21 21:15:04,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-21 21:15:04,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:04,219 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:04,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-21 21:15:04,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:04,423 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:04,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2086490290, now seen corresponding path program 1 times [2024-11-21 21:15:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4308755] [2024-11-21 21:15:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:04,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-21 21:15:04,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:04,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4308755] [2024-11-21 21:15:04,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4308755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:15:04,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487043516] [2024-11-21 21:15:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:04,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:04,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:04,513 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:15:04,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-21 21:15:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:04,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-21 21:15:04,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 21:15:04,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:15:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487043516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:04,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 21:15:04,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 12 [2024-11-21 21:15:04,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269174261] [2024-11-21 21:15:04,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:04,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-21 21:15:04,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:04,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-21 21:15:04,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-21 21:15:04,607 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand has 10 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-21 21:15:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:04,679 INFO L93 Difference]: Finished difference Result 486 states and 686 transitions. [2024-11-21 21:15:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 21:15:04,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2024-11-21 21:15:04,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:04,681 INFO L225 Difference]: With dead ends: 486 [2024-11-21 21:15:04,681 INFO L226 Difference]: Without dead ends: 366 [2024-11-21 21:15:04,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-21 21:15:04,682 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 57 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:04,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1174 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:04,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-21 21:15:04,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 334. [2024-11-21 21:15:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 269 states have (on average 1.2936802973977695) internal successors, (348), 278 states have internal predecessors, (348), 42 states have call successors, (42), 13 states have call predecessors, (42), 22 states have return successors, (74), 42 states have call predecessors, (74), 41 states have call successors, (74) [2024-11-21 21:15:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 464 transitions. [2024-11-21 21:15:04,695 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 464 transitions. Word has length 49 [2024-11-21 21:15:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:04,696 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 464 transitions. [2024-11-21 21:15:04,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-21 21:15:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 464 transitions. [2024-11-21 21:15:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-21 21:15:04,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:04,697 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:04,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-21 21:15:04,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:04,902 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:04,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:04,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1187408652, now seen corresponding path program 1 times [2024-11-21 21:15:04,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:04,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775249593] [2024-11-21 21:15:04,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:04,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-21 21:15:05,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:05,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775249593] [2024-11-21 21:15:05,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775249593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:15:05,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913746712] [2024-11-21 21:15:05,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:05,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:05,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:05,024 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:15:05,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-21 21:15:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:05,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-21 21:15:05,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-21 21:15:05,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:15:05,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913746712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:05,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-21 21:15:05,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 18 [2024-11-21 21:15:05,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421571867] [2024-11-21 21:15:05,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:05,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-21 21:15:05,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:05,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-21 21:15:05,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-11-21 21:15:05,213 INFO L87 Difference]: Start difference. First operand 334 states and 464 transitions. Second operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-21 21:15:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:05,417 INFO L93 Difference]: Finished difference Result 431 states and 593 transitions. [2024-11-21 21:15:05,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-21 21:15:05,417 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2024-11-21 21:15:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:05,419 INFO L225 Difference]: With dead ends: 431 [2024-11-21 21:15:05,419 INFO L226 Difference]: Without dead ends: 358 [2024-11-21 21:15:05,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-11-21 21:15:05,420 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 63 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:05,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1963 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:15:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-21 21:15:05,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 340. [2024-11-21 21:15:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 273 states have (on average 1.2820512820512822) internal successors, (350), 282 states have internal predecessors, (350), 42 states have call successors, (42), 15 states have call predecessors, (42), 24 states have return successors, (74), 42 states have call predecessors, (74), 41 states have call successors, (74) [2024-11-21 21:15:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 466 transitions. [2024-11-21 21:15:05,434 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 466 transitions. Word has length 49 [2024-11-21 21:15:05,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:05,434 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 466 transitions. [2024-11-21 21:15:05,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-21 21:15:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 466 transitions. [2024-11-21 21:15:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-21 21:15:05,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:05,436 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:05,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:05,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-21 21:15:05,640 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:05,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:05,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1377180783, now seen corresponding path program 1 times [2024-11-21 21:15:05,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:05,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557470209] [2024-11-21 21:15:05,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 21:15:05,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557470209] [2024-11-21 21:15:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557470209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:15:05,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444388366] [2024-11-21 21:15:05,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:05,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:05,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:05,735 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:15:05,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-21 21:15:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:05,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-21 21:15:05,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 21:15:05,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 21:15:06,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444388366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:06,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 21:15:06,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 23 [2024-11-21 21:15:06,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020269041] [2024-11-21 21:15:06,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:06,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-21 21:15:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:06,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-21 21:15:06,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2024-11-21 21:15:06,081 INFO L87 Difference]: Start difference. First operand 340 states and 466 transitions. Second operand has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-21 21:15:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:06,498 INFO L93 Difference]: Finished difference Result 505 states and 726 transitions. [2024-11-21 21:15:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-21 21:15:06,498 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 50 [2024-11-21 21:15:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:06,500 INFO L225 Difference]: With dead ends: 505 [2024-11-21 21:15:06,500 INFO L226 Difference]: Without dead ends: 480 [2024-11-21 21:15:06,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2024-11-21 21:15:06,503 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 148 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:06,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1976 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 21:15:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-21 21:15:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 352. [2024-11-21 21:15:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 280 states have (on average 1.2678571428571428) internal successors, (355), 291 states have internal predecessors, (355), 45 states have call successors, (45), 15 states have call predecessors, (45), 26 states have return successors, (92), 45 states have call predecessors, (92), 44 states have call successors, (92) [2024-11-21 21:15:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 492 transitions. [2024-11-21 21:15:06,520 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 492 transitions. Word has length 50 [2024-11-21 21:15:06,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:06,521 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 492 transitions. [2024-11-21 21:15:06,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-21 21:15:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 492 transitions. [2024-11-21 21:15:06,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-21 21:15:06,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:06,524 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:06,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:06,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-21 21:15:06,728 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:06,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash 388201992, now seen corresponding path program 1 times [2024-11-21 21:15:06,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:06,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343164815] [2024-11-21 21:15:06,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:06,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:15:06,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343164815] [2024-11-21 21:15:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343164815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:06,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:06,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-21 21:15:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995440614] [2024-11-21 21:15:06,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:06,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 21:15:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:06,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 21:15:06,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-21 21:15:06,819 INFO L87 Difference]: Start difference. First operand 352 states and 492 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-21 21:15:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:06,868 INFO L93 Difference]: Finished difference Result 374 states and 513 transitions. [2024-11-21 21:15:06,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 21:15:06,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2024-11-21 21:15:06,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:06,870 INFO L225 Difference]: With dead ends: 374 [2024-11-21 21:15:06,870 INFO L226 Difference]: Without dead ends: 318 [2024-11-21 21:15:06,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-21 21:15:06,871 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 10 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:06,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 732 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-21 21:15:06,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 313. [2024-11-21 21:15:06,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 248 states have (on average 1.2580645161290323) internal successors, (312), 258 states have internal predecessors, (312), 40 states have call successors, (40), 14 states have call predecessors, (40), 24 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-11-21 21:15:06,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 435 transitions. [2024-11-21 21:15:06,885 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 435 transitions. Word has length 53 [2024-11-21 21:15:06,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:06,885 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 435 transitions. [2024-11-21 21:15:06,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-21 21:15:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 435 transitions. [2024-11-21 21:15:06,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-21 21:15:06,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:06,886 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:06,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-21 21:15:06,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:06,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:06,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1439175676, now seen corresponding path program 1 times [2024-11-21 21:15:06,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:06,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251499098] [2024-11-21 21:15:06,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:06,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 21:15:07,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:07,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251499098] [2024-11-21 21:15:07,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251499098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:07,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:07,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-21 21:15:07,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919149450] [2024-11-21 21:15:07,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:07,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-21 21:15:07,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:07,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-21 21:15:07,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-21 21:15:07,023 INFO L87 Difference]: Start difference. First operand 313 states and 435 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:07,151 INFO L93 Difference]: Finished difference Result 460 states and 639 transitions. [2024-11-21 21:15:07,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 21:15:07,151 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-21 21:15:07,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:07,153 INFO L225 Difference]: With dead ends: 460 [2024-11-21 21:15:07,153 INFO L226 Difference]: Without dead ends: 341 [2024-11-21 21:15:07,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-21 21:15:07,154 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 93 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:07,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1162 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:15:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-21 21:15:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 313. [2024-11-21 21:15:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 248 states have (on average 1.2540322580645162) internal successors, (311), 258 states have internal predecessors, (311), 40 states have call successors, (40), 14 states have call predecessors, (40), 24 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-11-21 21:15:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 434 transitions. [2024-11-21 21:15:07,170 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 434 transitions. Word has length 54 [2024-11-21 21:15:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:07,170 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 434 transitions. [2024-11-21 21:15:07,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 434 transitions. [2024-11-21 21:15:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-21 21:15:07,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:07,171 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:07,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-21 21:15:07,172 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:07,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash 418107322, now seen corresponding path program 1 times [2024-11-21 21:15:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:07,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322220852] [2024-11-21 21:15:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:07,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 21:15:07,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:07,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322220852] [2024-11-21 21:15:07,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322220852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:07,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:07,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-21 21:15:07,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186351721] [2024-11-21 21:15:07,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:07,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 21:15:07,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:07,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 21:15:07,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-21 21:15:07,285 INFO L87 Difference]: Start difference. First operand 313 states and 434 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:07,371 INFO L93 Difference]: Finished difference Result 502 states and 695 transitions. [2024-11-21 21:15:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-21 21:15:07,372 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-21 21:15:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:07,374 INFO L225 Difference]: With dead ends: 502 [2024-11-21 21:15:07,374 INFO L226 Difference]: Without dead ends: 324 [2024-11-21 21:15:07,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-21 21:15:07,375 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 59 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:07,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 820 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:15:07,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-21 21:15:07,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 313. [2024-11-21 21:15:07,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 248 states have (on average 1.2459677419354838) internal successors, (309), 258 states have internal predecessors, (309), 40 states have call successors, (40), 14 states have call predecessors, (40), 24 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-11-21 21:15:07,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 432 transitions. [2024-11-21 21:15:07,392 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 432 transitions. Word has length 54 [2024-11-21 21:15:07,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:07,392 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 432 transitions. [2024-11-21 21:15:07,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 432 transitions. [2024-11-21 21:15:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-21 21:15:07,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:07,393 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:07,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-21 21:15:07,394 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:07,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1317589488, now seen corresponding path program 2 times [2024-11-21 21:15:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:07,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642374557] [2024-11-21 21:15:07,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:15:07,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:07,434 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 21:15:07,435 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:15:07,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642374557] [2024-11-21 21:15:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642374557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:15:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668302874] [2024-11-21 21:15:07,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:15:07,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:07,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:07,668 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:15:07,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-21 21:15:07,730 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 21:15:07,730 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:07,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-21 21:15:07,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 21:15:07,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 21:15:07,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668302874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:07,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 21:15:07,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 9] total 22 [2024-11-21 21:15:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735948715] [2024-11-21 21:15:07,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:07,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-21 21:15:07,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:07,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-21 21:15:07,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2024-11-21 21:15:07,956 INFO L87 Difference]: Start difference. First operand 313 states and 432 transitions. Second operand has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-21 21:15:08,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:08,413 INFO L93 Difference]: Finished difference Result 512 states and 707 transitions. [2024-11-21 21:15:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-21 21:15:08,413 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 54 [2024-11-21 21:15:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:08,419 INFO L225 Difference]: With dead ends: 512 [2024-11-21 21:15:08,419 INFO L226 Difference]: Without dead ends: 431 [2024-11-21 21:15:08,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2024-11-21 21:15:08,421 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 194 mSDsluCounter, 2468 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:08,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 2626 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 21:15:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-21 21:15:08,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 351. [2024-11-21 21:15:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 280 states have (on average 1.2571428571428571) internal successors, (352), 292 states have internal predecessors, (352), 43 states have call successors, (43), 15 states have call predecessors, (43), 27 states have return successors, (84), 43 states have call predecessors, (84), 42 states have call successors, (84) [2024-11-21 21:15:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 479 transitions. [2024-11-21 21:15:08,441 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 479 transitions. Word has length 54 [2024-11-21 21:15:08,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:08,442 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 479 transitions. [2024-11-21 21:15:08,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 16 states have internal predecessors, (54), 5 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-21 21:15:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 479 transitions. [2024-11-21 21:15:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-21 21:15:08,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:08,443 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:08,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-21 21:15:08,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:08,643 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:08,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:08,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1956309454, now seen corresponding path program 2 times [2024-11-21 21:15:08,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:08,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442426174] [2024-11-21 21:15:08,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:15:08,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:08,664 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 21:15:08,665 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:15:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:09,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442426174] [2024-11-21 21:15:09,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442426174] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:15:09,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651770898] [2024-11-21 21:15:09,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:15:09,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:09,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:09,186 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:15:09,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-21 21:15:09,246 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 21:15:09,246 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:09,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-21 21:15:09,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:09,322 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 21:15:09,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:09,503 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 21:15:09,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651770898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:09,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 21:15:09,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 9] total 30 [2024-11-21 21:15:09,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815995385] [2024-11-21 21:15:09,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:09,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-21 21:15:09,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:09,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-21 21:15:09,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2024-11-21 21:15:09,506 INFO L87 Difference]: Start difference. First operand 351 states and 479 transitions. Second operand has 30 states, 28 states have (on average 2.25) internal successors, (63), 23 states have internal predecessors, (63), 7 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-21 21:15:10,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:10,049 INFO L93 Difference]: Finished difference Result 648 states and 905 transitions. [2024-11-21 21:15:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-21 21:15:10,050 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.25) internal successors, (63), 23 states have internal predecessors, (63), 7 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 54 [2024-11-21 21:15:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:10,052 INFO L225 Difference]: With dead ends: 648 [2024-11-21 21:15:10,052 INFO L226 Difference]: Without dead ends: 462 [2024-11-21 21:15:10,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2024-11-21 21:15:10,053 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 152 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 3715 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:10,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 3715 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:15:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-21 21:15:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 351. [2024-11-21 21:15:10,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 280 states have (on average 1.25) internal successors, (350), 292 states have internal predecessors, (350), 43 states have call successors, (43), 15 states have call predecessors, (43), 27 states have return successors, (84), 43 states have call predecessors, (84), 42 states have call successors, (84) [2024-11-21 21:15:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 477 transitions. [2024-11-21 21:15:10,096 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 477 transitions. Word has length 54 [2024-11-21 21:15:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:10,096 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 477 transitions. [2024-11-21 21:15:10,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.25) internal successors, (63), 23 states have internal predecessors, (63), 7 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-21 21:15:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 477 transitions. [2024-11-21 21:15:10,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-21 21:15:10,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:10,098 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:10,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:10,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:10,302 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:10,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1591446259, now seen corresponding path program 1 times [2024-11-21 21:15:10,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:10,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023269999] [2024-11-21 21:15:10,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:10,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 21:15:10,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:10,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023269999] [2024-11-21 21:15:10,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023269999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:15:10,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077604938] [2024-11-21 21:15:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:10,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:10,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:10,432 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:15:10,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-21 21:15:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:10,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-21 21:15:10,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 21:15:10,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 21:15:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077604938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:10,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 21:15:10,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-21 21:15:10,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288301427] [2024-11-21 21:15:10,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:10,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-21 21:15:10,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:10,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-21 21:15:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-11-21 21:15:10,754 INFO L87 Difference]: Start difference. First operand 351 states and 477 transitions. Second operand has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-21 21:15:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:11,206 INFO L93 Difference]: Finished difference Result 417 states and 583 transitions. [2024-11-21 21:15:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-21 21:15:11,206 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2024-11-21 21:15:11,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:11,208 INFO L225 Difference]: With dead ends: 417 [2024-11-21 21:15:11,208 INFO L226 Difference]: Without dead ends: 385 [2024-11-21 21:15:11,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-11-21 21:15:11,209 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 177 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:11,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1992 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 21:15:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-21 21:15:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 337. [2024-11-21 21:15:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 270 states have (on average 1.2592592592592593) internal successors, (340), 281 states have internal predecessors, (340), 41 states have call successors, (41), 13 states have call predecessors, (41), 25 states have return successors, (80), 42 states have call predecessors, (80), 40 states have call successors, (80) [2024-11-21 21:15:11,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 461 transitions. [2024-11-21 21:15:11,232 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 461 transitions. Word has length 55 [2024-11-21 21:15:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:11,232 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 461 transitions. [2024-11-21 21:15:11,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-21 21:15:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 461 transitions. [2024-11-21 21:15:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-21 21:15:11,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:11,235 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:11,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:11,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-21 21:15:11,440 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:11,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1131087777, now seen corresponding path program 2 times [2024-11-21 21:15:11,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:11,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261357083] [2024-11-21 21:15:11,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:15:11,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:11,454 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 21:15:11,454 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-21 21:15:11,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:15:11,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261357083] [2024-11-21 21:15:11,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261357083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 21:15:11,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154037621] [2024-11-21 21:15:11,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:15:11,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 21:15:11,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:11,982 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 21:15:11,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-21 21:15:12,032 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 21:15:12,032 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:12,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-21 21:15:12,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 21:15:12,248 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-21 21:15:13,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154037621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:13,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 21:15:13,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13, 14] total 42 [2024-11-21 21:15:13,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100903516] [2024-11-21 21:15:13,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:13,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-21 21:15:13,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:15:13,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-21 21:15:13,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1611, Unknown=0, NotChecked=0, Total=1722 [2024-11-21 21:15:13,141 INFO L87 Difference]: Start difference. First operand 337 states and 461 transitions. Second operand has 42 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-21 21:15:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:14,974 INFO L93 Difference]: Finished difference Result 470 states and 705 transitions. [2024-11-21 21:15:14,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-21 21:15:14,976 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 55 [2024-11-21 21:15:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:14,979 INFO L225 Difference]: With dead ends: 470 [2024-11-21 21:15:14,979 INFO L226 Difference]: Without dead ends: 423 [2024-11-21 21:15:14,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=298, Invalid=4124, Unknown=0, NotChecked=0, Total=4422 [2024-11-21 21:15:14,981 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 214 mSDsluCounter, 3205 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 3335 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:14,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 3335 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-21 21:15:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-21 21:15:15,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 329. [2024-11-21 21:15:15,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 263 states have (on average 1.2661596958174905) internal successors, (333), 276 states have internal predecessors, (333), 40 states have call successors, (40), 11 states have call predecessors, (40), 25 states have return successors, (79), 41 states have call predecessors, (79), 39 states have call successors, (79) [2024-11-21 21:15:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 452 transitions. [2024-11-21 21:15:15,007 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 452 transitions. Word has length 55 [2024-11-21 21:15:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:15,007 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 452 transitions. [2024-11-21 21:15:15,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-21 21:15:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 452 transitions. [2024-11-21 21:15:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-21 21:15:15,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:15,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:15,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-21 21:15:15,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-21 21:15:15,213 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:15,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:15,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1641792537, now seen corresponding path program 1 times [2024-11-21 21:15:15,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:15:15,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585969959] [2024-11-21 21:15:15,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:15:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 21:15:15,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 21:15:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 21:15:15,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 21:15:15,301 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 21:15:15,302 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 21:15:15,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-21 21:15:15,305 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:15,338 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 21:15:15,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:15:15 BoogieIcfgContainer [2024-11-21 21:15:15,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 21:15:15,341 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 21:15:15,341 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 21:15:15,342 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 21:15:15,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:14:55" (3/4) ... [2024-11-21 21:15:15,344 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-21 21:15:15,345 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 21:15:15,345 INFO L158 Benchmark]: Toolchain (without parser) took 20397.65ms. Allocated memory was 174.1MB in the beginning and 323.0MB in the end (delta: 148.9MB). Free memory was 143.2MB in the beginning and 187.3MB in the end (delta: -44.1MB). Peak memory consumption was 104.1MB. Max. memory is 16.1GB. [2024-11-21 21:15:15,346 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:15:15,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.17ms. Allocated memory is still 174.1MB. Free memory was 143.2MB in the beginning and 127.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 21:15:15,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.76ms. Allocated memory is still 174.1MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 21:15:15,348 INFO L158 Benchmark]: Boogie Preprocessor took 35.40ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 21:15:15,348 INFO L158 Benchmark]: RCFGBuilder took 370.79ms. Allocated memory is still 174.1MB. Free memory was 123.6MB in the beginning and 103.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-21 21:15:15,348 INFO L158 Benchmark]: TraceAbstraction took 19717.83ms. Allocated memory was 174.1MB in the beginning and 323.0MB in the end (delta: 148.9MB). Free memory was 102.6MB in the beginning and 188.3MB in the end (delta: -85.7MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2024-11-21 21:15:15,348 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 323.0MB. Free memory was 188.3MB in the beginning and 187.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:15:15,349 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.14ms. Allocated memory is still 119.5MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.17ms. Allocated memory is still 174.1MB. Free memory was 143.2MB in the beginning and 127.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.76ms. Allocated memory is still 174.1MB. Free memory was 127.8MB in the beginning and 125.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.40ms. Allocated memory is still 174.1MB. Free memory was 125.7MB in the beginning and 123.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.79ms. Allocated memory is still 174.1MB. Free memory was 123.6MB in the beginning and 103.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 19717.83ms. Allocated memory was 174.1MB in the beginning and 323.0MB in the end (delta: 148.9MB). Free memory was 102.6MB in the beginning and 188.3MB in the end (delta: -85.7MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 323.0MB. Free memory was 188.3MB in the beginning and 187.3MB in the end (delta: 1.0MB). 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_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=-127, eb=127] [L241] 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); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) VAL [ea=-127, eb=127] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=4311744512] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=4311744512] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=4311744512, __retres4=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=4311744512, \result=16777216] [L242] RET, EXPR base2flt(ma, ea) VAL [ea=-127, eb=127, ma=4311744512] [L242] a = base2flt(ma, ea) [L243] 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); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L243] RET, EXPR base2flt(mb, eb) VAL [a=16777216, ea=-127, eb=127, ma=4311744512, mb=33554432] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=16777216, \old(b)=4294967295] [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 [\old(a)=16777216, \old(b)=4294967295, a=16777216, b=4294967295] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, ea=127, eb=-127, ma=16777216, mb=0] [L113] EXPR mb | (1U << 24U) VAL [\old(a)=16777216, \old(b)=4294967295, 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 [\old(a)=16777216, \old(b)=4294967295, a=4294967295, ea=127, eb=-127, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=16777216, \old(b)=4294967295, 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 4 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.6s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2266 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2103 mSDsluCounter, 36131 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33318 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7947 IncrementalHoareTripleChecker+Invalid, 8258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 2813 mSDtfsCounter, 7947 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1485 GetRequests, 1007 SyntacticMatches, 4 SemanticMatches, 474 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=352occurred in iteration=15, InterpolantAutomatonStates: 365, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 1003 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1765 NumberOfCodeBlocks, 1747 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2107 ConstructedInterpolants, 1 QuantifiedInterpolants, 4769 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1999 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 44 InterpolantComputations, 13 PerfectInterpolantSequences, 738/871 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-21 21:15:15,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:15:17,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:15:17,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-21 21:15:17,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:15:17,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:15:17,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:15:17,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:15:17,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:15:17,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:15:17,262 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:15:17,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:15:17,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:15:17,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:15:17,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:15:17,264 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:15:17,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:15:17,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:15:17,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:15:17,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:15:17,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:15:17,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:15:17,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:15:17,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:15:17,269 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-21 21:15:17,269 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-21 21:15:17,269 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:15:17,270 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-21 21:15:17,270 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:15:17,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:15:17,270 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:15:17,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:15:17,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:15:17,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:15:17,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:15:17,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:15:17,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:15:17,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:15:17,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:15:17,273 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-21 21:15:17,273 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-21 21:15:17,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:15:17,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:15:17,274 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:15:17,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:15:17,274 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-11-21 21:15:17,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:15:17,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:15:17,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:15:17,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:15:17,575 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:15:17,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-21 21:15:18,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:15:19,036 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:15:19,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-21 21:15:19,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9be06935/a16473ec51b340eb91909906f2a32383/FLAGfff7ecc8e [2024-11-21 21:15:19,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9be06935/a16473ec51b340eb91909906f2a32383 [2024-11-21 21:15:19,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:15:19,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:15:19,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:15:19,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:15:19,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:15:19,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a44557b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19, skipping insertion in model container [2024-11-21 21:15:19,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:15:19,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-21 21:15:19,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:15:19,306 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:15:19,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-21 21:15:19,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:15:19,369 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:15:19,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19 WrapperNode [2024-11-21 21:15:19,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:15:19,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:15:19,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:15:19,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:15:19,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,400 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-21 21:15:19,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:15:19,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:15:19,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:15:19,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:15:19,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,433 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-21 21:15:19,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:15:19,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:15:19,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:15:19,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:15:19,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (1/1) ... [2024-11-21 21:15:19,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:15:19,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:15:19,483 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-21 21:15:19,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-21 21:15:19,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:15:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-21 21:15:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-21 21:15:19,520 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-21 21:15:19,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:15:19,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:15:19,522 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-21 21:15:19,522 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-21 21:15:19,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-21 21:15:19,522 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-21 21:15:19,579 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:15:19,587 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:15:19,798 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-21 21:15:19,799 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:15:19,812 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:15:19,812 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-21 21:15:19,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:19 BoogieIcfgContainer [2024-11-21 21:15:19,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:15:19,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:15:19,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:15:19,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:15:19,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:15:19" (1/3) ... [2024-11-21 21:15:19,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4835a684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:15:19, skipping insertion in model container [2024-11-21 21:15:19,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:15:19" (2/3) ... [2024-11-21 21:15:19,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4835a684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:15:19, skipping insertion in model container [2024-11-21 21:15:19,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:19" (3/3) ... [2024-11-21 21:15:19,822 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-11-21 21:15:19,834 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:15:19,835 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:15:19,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:15:19,893 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;@1539819, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:15:19,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:15:19,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-21 21:15:19,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-21 21:15:19,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:19,915 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:19,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:19,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:19,921 INFO L85 PathProgramCache]: Analyzing trace with hash 173410466, now seen corresponding path program 1 times [2024-11-21 21:15:19,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:19,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939820022] [2024-11-21 21:15:19,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:19,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:19,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:19,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 21:15:19,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-21 21:15:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:20,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-21 21:15:20,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:15:20,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:15:20,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:20,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939820022] [2024-11-21 21:15:20,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939820022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:20,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:20,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-21 21:15:20,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007300449] [2024-11-21 21:15:20,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:20,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 21:15:20,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:20,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 21:15:20,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-21 21:15:20,157 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:15:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:20,256 INFO L93 Difference]: Finished difference Result 125 states and 190 transitions. [2024-11-21 21:15:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 21:15:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-11-21 21:15:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:20,264 INFO L225 Difference]: With dead ends: 125 [2024-11-21 21:15:20,264 INFO L226 Difference]: Without dead ends: 68 [2024-11-21 21:15:20,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-21 21:15:20,272 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:20,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 452 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:15:20,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-21 21:15:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2024-11-21 21:15:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 47 states have internal predecessors, (59), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-21 21:15:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2024-11-21 21:15:20,304 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 31 [2024-11-21 21:15:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:20,305 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2024-11-21 21:15:20,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:15:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2024-11-21 21:15:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-21 21:15:20,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:20,307 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:20,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-21 21:15:20,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:20,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:20,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1707598935, now seen corresponding path program 1 times [2024-11-21 21:15:20,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:20,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880684004] [2024-11-21 21:15:20,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:20,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:20,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:20,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 21:15:20,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-21 21:15:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:20,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-21 21:15:20,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:15:20,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:15:20,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:20,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880684004] [2024-11-21 21:15:20,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880684004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:20,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:15:20,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-21 21:15:20,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824014924] [2024-11-21 21:15:20,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:20,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 21:15:20,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:20,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 21:15:20,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-21 21:15:20,747 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 21:15:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:20,845 INFO L93 Difference]: Finished difference Result 115 states and 153 transitions. [2024-11-21 21:15:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 21:15:20,845 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-21 21:15:20,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:20,846 INFO L225 Difference]: With dead ends: 115 [2024-11-21 21:15:20,847 INFO L226 Difference]: Without dead ends: 87 [2024-11-21 21:15:20,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-21 21:15:20,848 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 15 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:20,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 485 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:15:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-21 21:15:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2024-11-21 21:15:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 54 states have internal predecessors, (67), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-21 21:15:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-21 21:15:20,869 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 35 [2024-11-21 21:15:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:20,869 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-21 21:15:20,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-21 21:15:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-21 21:15:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-21 21:15:20,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:20,871 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:20,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-21 21:15:21,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:21,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:21,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:21,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1508244029, now seen corresponding path program 1 times [2024-11-21 21:15:21,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:21,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542612293] [2024-11-21 21:15:21,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:21,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:21,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:21,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 21:15:21,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-21 21:15:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:21,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-21 21:15:21,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:15:21,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 21:15:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-21 21:15:21,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542612293] [2024-11-21 21:15:21,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542612293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 21:15:21,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 21:15:21,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-21 21:15:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428188954] [2024-11-21 21:15:21,268 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 21:15:21,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 21:15:21,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:21,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 21:15:21,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-21 21:15:21,269 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:21,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:21,357 INFO L93 Difference]: Finished difference Result 110 states and 146 transitions. [2024-11-21 21:15:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-21 21:15:21,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2024-11-21 21:15:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:21,361 INFO L225 Difference]: With dead ends: 110 [2024-11-21 21:15:21,361 INFO L226 Difference]: Without dead ends: 86 [2024-11-21 21:15:21,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-21 21:15:21,362 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 12 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:21,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 453 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:15:21,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-21 21:15:21,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-21 21:15:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 61 states have internal predecessors, (74), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-21 21:15:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2024-11-21 21:15:21,381 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 39 [2024-11-21 21:15:21,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:21,382 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2024-11-21 21:15:21,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-21 21:15:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2024-11-21 21:15:21,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-21 21:15:21,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:21,384 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:21,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-21 21:15:21,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:21,585 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:21,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash -54729342, now seen corresponding path program 2 times [2024-11-21 21:15:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:21,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079812927] [2024-11-21 21:15:21,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 21:15:21,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:21,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:21,588 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 21:15:21,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-21 21:15:21,618 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-21 21:15:21,618 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 21:15:21,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-21 21:15:21,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-21 21:15:21,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:15:21,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:21,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079812927] [2024-11-21 21:15:21,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079812927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:21,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:21,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 21:15:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702944997] [2024-11-21 21:15:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:21,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 21:15:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:21,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 21:15:21,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:15:21,714 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:15:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:21,781 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2024-11-21 21:15:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 21:15:21,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-21 21:15:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:21,782 INFO L225 Difference]: With dead ends: 91 [2024-11-21 21:15:21,782 INFO L226 Difference]: Without dead ends: 89 [2024-11-21 21:15:21,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-21 21:15:21,783 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 313 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-11-21 21:15:21,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 313 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-21 21:15:21,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-21 21:15:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.253968253968254) internal successors, (79), 66 states have internal predecessors, (79), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-21 21:15:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2024-11-21 21:15:21,799 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 39 [2024-11-21 21:15:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:21,800 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2024-11-21 21:15:21,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:15:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2024-11-21 21:15:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-21 21:15:21,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:21,801 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:21,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:22,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:22,002 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:22,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:22,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2528960, now seen corresponding path program 1 times [2024-11-21 21:15:22,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:22,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306116779] [2024-11-21 21:15:22,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:22,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:22,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:22,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 21:15:22,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-21 21:15:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:22,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-21 21:15:22,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-21 21:15:22,133 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:15:22,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:22,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306116779] [2024-11-21 21:15:22,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306116779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:22,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:22,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 21:15:22,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924460651] [2024-11-21 21:15:22,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:22,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 21:15:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:22,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 21:15:22,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:15:22,135 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:15:22,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:22,202 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2024-11-21 21:15:22,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 21:15:22,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-21 21:15:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:22,204 INFO L225 Difference]: With dead ends: 93 [2024-11-21 21:15:22,204 INFO L226 Difference]: Without dead ends: 91 [2024-11-21 21:15:22,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-21 21:15:22,205 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:22,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 308 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 21:15:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-21 21:15:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-11-21 21:15:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 64 states have internal predecessors, (77), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-21 21:15:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2024-11-21 21:15:22,215 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 39 [2024-11-21 21:15:22,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:22,215 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2024-11-21 21:15:22,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-21 21:15:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2024-11-21 21:15:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-21 21:15:22,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:22,217 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:22,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:22,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:22,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:22,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:22,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1837968146, now seen corresponding path program 1 times [2024-11-21 21:15:22,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:22,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777800466] [2024-11-21 21:15:22,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:22,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:22,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:22,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 21:15:22,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-21 21:15:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:22,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-21 21:15:22,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-21 21:15:22,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:15:22,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777800466] [2024-11-21 21:15:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777800466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-21 21:15:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914660085] [2024-11-21 21:15:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:22,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-21 21:15:22,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-21 21:15:22,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-21 21:15:22,559 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 21:15:22,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:22,742 INFO L93 Difference]: Finished difference Result 124 states and 163 transitions. [2024-11-21 21:15:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-21 21:15:22,742 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2024-11-21 21:15:22,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:22,743 INFO L225 Difference]: With dead ends: 124 [2024-11-21 21:15:22,744 INFO L226 Difference]: Without dead ends: 117 [2024-11-21 21:15:22,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-21 21:15:22,744 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:22,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 579 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 21:15:22,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-21 21:15:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2024-11-21 21:15:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 74 states have internal predecessors, (89), 18 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-21 21:15:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2024-11-21 21:15:22,753 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 44 [2024-11-21 21:15:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:22,754 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2024-11-21 21:15:22,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 21:15:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2024-11-21 21:15:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-21 21:15:22,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:22,755 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:22,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-21 21:15:22,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:22,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:22,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash 595859751, now seen corresponding path program 1 times [2024-11-21 21:15:22,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:22,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271421644] [2024-11-21 21:15:22,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:22,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:22,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:22,961 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 21:15:22,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-21 21:15:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:15:23,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-21 21:15:23,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 21:15:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-21 21:15:23,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 21:15:23,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 21:15:23,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271421644] [2024-11-21 21:15:23,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271421644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:15:23,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:15:23,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-21 21:15:23,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222595979] [2024-11-21 21:15:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:15:23,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-21 21:15:23,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 21:15:23,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-21 21:15:23,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-21 21:15:23,070 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-21 21:15:23,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:15:23,163 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2024-11-21 21:15:23,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-21 21:15:23,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2024-11-21 21:15:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:15:23,164 INFO L225 Difference]: With dead ends: 158 [2024-11-21 21:15:23,167 INFO L226 Difference]: Without dead ends: 121 [2024-11-21 21:15:23,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-21 21:15:23,168 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 21:15:23,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 521 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 21:15:23,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-21 21:15:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2024-11-21 21:15:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 81 states have internal predecessors, (95), 16 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-21 21:15:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2024-11-21 21:15:23,184 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 49 [2024-11-21 21:15:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:15:23,186 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2024-11-21 21:15:23,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-21 21:15:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2024-11-21 21:15:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-21 21:15:23,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:15:23,188 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:23,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-21 21:15:23,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:23,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:15:23,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:15:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1849173563, now seen corresponding path program 1 times [2024-11-21 21:15:23,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 21:15:23,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [334764938] [2024-11-21 21:15:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:15:23,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:23,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 21:15:23,392 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 21:15:23,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-21 21:15:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 21:15:23,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 21:15:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 21:15:23,497 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-21 21:15:23,498 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 21:15:23,500 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 21:15:23,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-21 21:15:23,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 21:15:23,705 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-21 21:15:23,727 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 21:15:23,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:15:23 BoogieIcfgContainer [2024-11-21 21:15:23,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 21:15:23,729 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 21:15:23,729 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 21:15:23,729 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 21:15:23,730 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:15:19" (3/4) ... [2024-11-21 21:15:23,730 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-21 21:15:23,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 21:15:23,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 21:15:23,778 INFO L158 Benchmark]: Toolchain (without parser) took 4712.09ms. Allocated memory was 60.8MB in the beginning and 94.4MB in the end (delta: 33.6MB). Free memory was 38.4MB in the beginning and 64.5MB in the end (delta: -26.0MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-21 21:15:23,778 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 37.5MB in the beginning and 37.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:15:23,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.70ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 38.3MB in the beginning and 57.1MB in the end (delta: -18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-21 21:15:23,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.85ms. Allocated memory is still 77.6MB. Free memory was 56.8MB in the beginning and 55.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 21:15:23,779 INFO L158 Benchmark]: Boogie Preprocessor took 49.68ms. Allocated memory is still 77.6MB. Free memory was 55.5MB in the beginning and 53.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 21:15:23,779 INFO L158 Benchmark]: RCFGBuilder took 360.67ms. Allocated memory is still 77.6MB. Free memory was 53.0MB in the beginning and 37.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 21:15:23,779 INFO L158 Benchmark]: TraceAbstraction took 3914.48ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 36.6MB in the beginning and 67.8MB in the end (delta: -31.2MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2024-11-21 21:15:23,780 INFO L158 Benchmark]: Witness Printer took 48.24ms. Allocated memory is still 94.4MB. Free memory was 67.8MB in the beginning and 64.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 21:15:23,782 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 60.8MB. Free memory was 37.5MB in the beginning and 37.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.70ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 38.3MB in the beginning and 57.1MB in the end (delta: -18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.85ms. Allocated memory is still 77.6MB. Free memory was 56.8MB in the beginning and 55.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.68ms. Allocated memory is still 77.6MB. Free memory was 55.5MB in the beginning and 53.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 360.67ms. Allocated memory is still 77.6MB. Free memory was 53.0MB in the beginning and 37.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3914.48ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 36.6MB in the beginning and 67.8MB in the end (delta: -31.2MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Witness Printer took 48.24ms. Allocated memory is still 94.4MB. Free memory was 67.8MB in the beginning and 64.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. 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_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] 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); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) [L241] zero = base2flt(0, 0) [L242] 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); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648] [L242] RET, EXPR base2flt(ma, ea) VAL [ea=0, ma=16777216] [L242] a = base2flt(ma, ea) [L243] 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); VAL [\old(e)=64, \old(m)=16777216, \result=-1073741824] [L243] RET, EXPR base2flt(mb, eb) VAL [a=-2147483648, ea=0, eb=64, ma=16777216, mb=16777216] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=-2147483648, \old(b)=-1073741824] [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 [\old(a)=-2147483648, \old(b)=-1073741824, a=-2147483648, b=-1073741824] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=-2147483648, \old(b)=-1073741824, 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 [\old(a)=-2147483648, \old(b)=-1073741824, 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 [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=-2147483648, \old(b)=-1073741824, 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 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 3111 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2656 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 502 IncrementalHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 455 mSDtfsCounter, 502 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=7, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 321 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 341 ConstructedInterpolants, 2 QuantifiedInterpolants, 541 SizeOfPredicates, 10 NumberOfNonLiveVariables, 535 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 148/160 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-11-21 21:15:23,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE