./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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 /storage/repos/ultimate/releaseScripts/default/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-wip.dd.update-z3-fca748b-m [2024-11-19 17:14:17,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 17:14:17,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 17:14:17,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 17:14:17,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 17:14:17,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 17:14:17,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 17:14:17,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 17:14:17,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 17:14:17,936 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 17:14:17,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 17:14:17,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 17:14:17,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 17:14:17,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 17:14:17,939 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 17:14:17,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 17:14:17,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 17:14:17,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 17:14:17,940 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 17:14:17,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 17:14:17,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 17:14:17,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 17:14:17,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 17:14:17,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 17:14:17,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 17:14:17,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 17:14:17,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 17:14:17,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 17:14:17,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 17:14:17,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 17:14:17,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 17:14:17,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 17:14:17,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:14:17,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 17:14:17,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 17:14:17,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 17:14:17,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 17:14:17,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 17:14:17,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 17:14:17,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 17:14:17,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 17:14:17,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 17:14:17,949 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-19 17:14:18,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 17:14:18,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 17:14:18,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 17:14:18,160 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 17:14:18,163 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 17:14:18,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-19 17:14:19,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 17:14:19,780 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 17:14:19,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-19 17:14:19,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc2cc444/9f966dc111414a56a8771af909909580/FLAG77bb8d2ea [2024-11-19 17:14:19,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efc2cc444/9f966dc111414a56a8771af909909580 [2024-11-19 17:14:19,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 17:14:19,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 17:14:19,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 17:14:19,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 17:14:19,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 17:14:19,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:14:19" (1/1) ... [2024-11-19 17:14:19,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d58a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:19, skipping insertion in model container [2024-11-19 17:14:19,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:14:19" (1/1) ... [2024-11-19 17:14:19,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 17:14:19,971 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-19 17:14:20,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:14:20,017 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 17:14:20,026 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-19 17:14:20,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:14:20,063 INFO L204 MainTranslator]: Completed translation [2024-11-19 17:14:20,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20 WrapperNode [2024-11-19 17:14:20,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 17:14:20,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 17:14:20,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 17:14:20,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 17:14:20,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,101 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-19 17:14:20,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 17:14:20,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 17:14:20,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 17:14:20,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 17:14:20,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,141 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-19 17:14:20,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 17:14:20,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 17:14:20,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 17:14:20,165 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 17:14:20,166 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (1/1) ... [2024-11-19 17:14:20,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:14:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:20,199 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-19 17:14:20,201 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-19 17:14:20,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 17:14:20,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 17:14:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-19 17:14:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-19 17:14:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 17:14:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 17:14:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-19 17:14:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-19 17:14:20,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 17:14:20,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 17:14:20,328 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 17:14:20,330 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 17:14:20,621 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-19 17:14:20,621 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 17:14:20,636 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 17:14:20,637 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 17:14:20,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:20 BoogieIcfgContainer [2024-11-19 17:14:20,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 17:14:20,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 17:14:20,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 17:14:20,643 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 17:14:20,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:14:19" (1/3) ... [2024-11-19 17:14:20,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b569b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:14:20, skipping insertion in model container [2024-11-19 17:14:20,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:20" (2/3) ... [2024-11-19 17:14:20,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b569b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:14:20, skipping insertion in model container [2024-11-19 17:14:20,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:20" (3/3) ... [2024-11-19 17:14:20,646 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-11-19 17:14:20,658 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 17:14:20,659 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 17:14:20,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 17:14:20,711 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;@2ba4bd11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 17:14:20,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 17:14:20,716 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-19 17:14:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 17:14:20,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:20,724 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-19 17:14:20,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:20,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:20,730 INFO L85 PathProgramCache]: Analyzing trace with hash 453789429, now seen corresponding path program 1 times [2024-11-19 17:14:20,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:20,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591743636] [2024-11-19 17:14:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:20,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,267 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-19 17:14:21,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:21,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591743636] [2024-11-19 17:14:21,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591743636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:21,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52438330] [2024-11-19 17:14:21,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:21,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:21,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:21,278 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-19 17:14:21,282 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-19 17:14:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:21,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 17:14:21,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:21,435 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-19 17:14:21,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:21,561 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-19 17:14:21,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52438330] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:21,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:21,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-19 17:14:21,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643602288] [2024-11-19 17:14:21,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:21,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 17:14:21,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:21,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 17:14:21,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-19 17:14:21,591 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-19 17:14:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:21,808 INFO L93 Difference]: Finished difference Result 176 states and 271 transitions. [2024-11-19 17:14:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 17:14:21,812 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-19 17:14:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:21,821 INFO L225 Difference]: With dead ends: 176 [2024-11-19 17:14:21,821 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 17:14:21,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 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-19 17:14:21,827 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 25 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:21,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1281 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 17:14:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2024-11-19 17:14:21,874 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-19 17:14:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-11-19 17:14:21,882 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 35 [2024-11-19 17:14:21,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:21,883 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-19 17:14:21,887 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-19 17:14:21,887 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2024-11-19 17:14:21,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 17:14:21,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:21,890 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-19 17:14:21,898 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-19 17:14:22,093 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-19 17:14:22,094 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:22,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:22,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1079320092, now seen corresponding path program 1 times [2024-11-19 17:14:22,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:22,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386539145] [2024-11-19 17:14:22,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:22,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,354 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-19 17:14:22,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:22,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386539145] [2024-11-19 17:14:22,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386539145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:22,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:22,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 17:14:22,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069317342] [2024-11-19 17:14:22,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:22,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 17:14:22,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:22,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 17:14:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 17:14:22,361 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-19 17:14:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:22,463 INFO L93 Difference]: Finished difference Result 159 states and 216 transitions. [2024-11-19 17:14:22,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 17:14:22,464 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-19 17:14:22,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:22,469 INFO L225 Difference]: With dead ends: 159 [2024-11-19 17:14:22,469 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 17:14:22,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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-19 17:14:22,471 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:22,471 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.1s Time] [2024-11-19 17:14:22,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 17:14:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-11-19 17:14:22,492 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-19 17:14:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2024-11-19 17:14:22,493 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 39 [2024-11-19 17:14:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:22,493 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2024-11-19 17:14:22,494 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-19 17:14:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2024-11-19 17:14:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 17:14:22,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:22,496 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-19 17:14:22,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 17:14:22,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:22,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:22,497 INFO L85 PathProgramCache]: Analyzing trace with hash -879159838, now seen corresponding path program 1 times [2024-11-19 17:14:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:22,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008556785] [2024-11-19 17:14:22,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:22,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 17:14:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,675 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-19 17:14:22,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:22,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008556785] [2024-11-19 17:14:22,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008556785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:22,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:22,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 17:14:22,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108634635] [2024-11-19 17:14:22,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:22,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 17:14:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:22,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 17:14:22,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 17:14:22,680 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-19 17:14:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:22,781 INFO L93 Difference]: Finished difference Result 178 states and 244 transitions. [2024-11-19 17:14:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 17:14:22,781 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-19 17:14:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:22,783 INFO L225 Difference]: With dead ends: 178 [2024-11-19 17:14:22,784 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 17:14:22,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 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-19 17:14:22,786 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 83 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-19 17:14:22,787 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-19 17:14:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 17:14:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2024-11-19 17:14:22,803 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-19 17:14:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2024-11-19 17:14:22,805 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 43 [2024-11-19 17:14:22,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:22,805 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2024-11-19 17:14:22,805 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-19 17:14:22,805 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2024-11-19 17:14:22,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 17:14:22,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:22,810 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-19 17:14:22,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 17:14:22,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:22,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:22,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1272186848, now seen corresponding path program 1 times [2024-11-19 17:14:22,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481096629] [2024-11-19 17:14:22,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 17:14:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:22,983 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-19 17:14:22,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:22,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481096629] [2024-11-19 17:14:22,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481096629] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:22,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123342025] [2024-11-19 17:14:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:22,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:22,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:22,988 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-19 17:14:22,993 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-19 17:14:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 17:14:23,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:23,067 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-19 17:14:23,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:23,192 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-19 17:14:23,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123342025] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:23,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:23,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-19 17:14:23,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344448015] [2024-11-19 17:14:23,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:23,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 17:14:23,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:23,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 17:14:23,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-19 17:14:23,197 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-19 17:14:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:23,262 INFO L93 Difference]: Finished difference Result 224 states and 308 transitions. [2024-11-19 17:14:23,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 17:14:23,264 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-19 17:14:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:23,267 INFO L225 Difference]: With dead ends: 224 [2024-11-19 17:14:23,267 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 17:14:23,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 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-19 17:14:23,269 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 16 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:23,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1002 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 17:14:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 17:14:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2024-11-19 17:14:23,283 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-19 17:14:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2024-11-19 17:14:23,284 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 43 [2024-11-19 17:14:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:23,285 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2024-11-19 17:14:23,285 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-19 17:14:23,285 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2024-11-19 17:14:23,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 17:14:23,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:23,286 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-19 17:14:23,294 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-19 17:14:23,487 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-19 17:14:23,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:23,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:23,489 INFO L85 PathProgramCache]: Analyzing trace with hash -642851046, now seen corresponding path program 1 times [2024-11-19 17:14:23,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:23,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994155296] [2024-11-19 17:14:23,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:23,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 17:14:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 17:14:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:23,877 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-19 17:14:23,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:23,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994155296] [2024-11-19 17:14:23,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994155296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:23,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:23,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 17:14:23,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540807097] [2024-11-19 17:14:23,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:23,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 17:14:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:23,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 17:14:23,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-19 17:14:23,879 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-19 17:14:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:24,051 INFO L93 Difference]: Finished difference Result 203 states and 273 transitions. [2024-11-19 17:14:24,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 17:14:24,051 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-19 17:14:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:24,053 INFO L225 Difference]: With dead ends: 203 [2024-11-19 17:14:24,053 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 17:14:24,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-19 17:14:24,054 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 56 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:24,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1194 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 17:14:24,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2024-11-19 17:14:24,061 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-19 17:14:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 196 transitions. [2024-11-19 17:14:24,062 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 196 transitions. Word has length 44 [2024-11-19 17:14:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:24,063 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 196 transitions. [2024-11-19 17:14:24,063 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-19 17:14:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 196 transitions. [2024-11-19 17:14:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 17:14:24,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:24,064 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-19 17:14:24,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 17:14:24,064 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:24,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 879448533, now seen corresponding path program 2 times [2024-11-19 17:14:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:24,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748637917] [2024-11-19 17:14:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:24,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-19 17:14:24,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:24,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748637917] [2024-11-19 17:14:24,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748637917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:24,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547674240] [2024-11-19 17:14:24,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:14:24,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:24,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:24,165 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-19 17:14:24,170 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-19 17:14:24,210 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 17:14:24,210 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:14:24,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 17:14:24,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:24,307 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-19 17:14:24,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:24,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547674240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:24,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:24,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2024-11-19 17:14:24,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335636786] [2024-11-19 17:14:24,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:24,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 17:14:24,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:24,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 17:14:24,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-19 17:14:24,309 INFO L87 Difference]: Start difference. First operand 145 states and 196 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 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-19 17:14:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:24,471 INFO L93 Difference]: Finished difference Result 286 states and 391 transitions. [2024-11-19 17:14:24,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 17:14:24,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 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-19 17:14:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:24,473 INFO L225 Difference]: With dead ends: 286 [2024-11-19 17:14:24,473 INFO L226 Difference]: Without dead ends: 229 [2024-11-19 17:14:24,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-19 17:14:24,474 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 95 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:24,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1238 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-19 17:14:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 192. [2024-11-19 17:14:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 156 states have (on average 1.3205128205128205) internal successors, (206), 158 states have internal predecessors, (206), 24 states have call successors, (24), 9 states have call predecessors, (24), 11 states have return successors, (31), 24 states have call predecessors, (31), 23 states have call successors, (31) [2024-11-19 17:14:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 261 transitions. [2024-11-19 17:14:24,484 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 261 transitions. Word has length 43 [2024-11-19 17:14:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:24,484 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 261 transitions. [2024-11-19 17:14:24,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 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-19 17:14:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 261 transitions. [2024-11-19 17:14:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 17:14:24,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:24,486 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-19 17:14:24,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:24,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:24,687 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:24,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash 486421523, now seen corresponding path program 1 times [2024-11-19 17:14:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246384131] [2024-11-19 17:14:24,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:24,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,161 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-19 17:14:25,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:25,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246384131] [2024-11-19 17:14:25,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246384131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:25,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:25,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 17:14:25,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366868469] [2024-11-19 17:14:25,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:25,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 17:14:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:25,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 17:14:25,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 17:14:25,166 INFO L87 Difference]: Start difference. First operand 192 states and 261 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-19 17:14:25,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:25,337 INFO L93 Difference]: Finished difference Result 207 states and 279 transitions. [2024-11-19 17:14:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 17:14:25,338 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-19 17:14:25,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:25,339 INFO L225 Difference]: With dead ends: 207 [2024-11-19 17:14:25,339 INFO L226 Difference]: Without dead ends: 205 [2024-11-19 17:14:25,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 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-19 17:14:25,340 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-19 17:14:25,340 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-19 17:14:25,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-19 17:14:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2024-11-19 17:14:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 159 states have (on average 1.3144654088050314) internal successors, (209), 161 states have internal predecessors, (209), 24 states have call successors, (24), 10 states have call predecessors, (24), 12 states have return successors, (31), 24 states have call predecessors, (31), 23 states have call successors, (31) [2024-11-19 17:14:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 264 transitions. [2024-11-19 17:14:25,349 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 264 transitions. Word has length 43 [2024-11-19 17:14:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:25,350 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 264 transitions. [2024-11-19 17:14:25,350 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-19 17:14:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 264 transitions. [2024-11-19 17:14:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 17:14:25,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:25,351 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-19 17:14:25,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 17:14:25,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:25,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:25,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1201861858, now seen corresponding path program 1 times [2024-11-19 17:14:25,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:25,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666265308] [2024-11-19 17:14:25,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:25,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 17:14:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 17:14:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,408 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-19 17:14:25,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:25,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666265308] [2024-11-19 17:14:25,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666265308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:25,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:25,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 17:14:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42678228] [2024-11-19 17:14:25,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:25,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 17:14:25,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:25,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 17:14:25,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 17:14:25,414 INFO L87 Difference]: Start difference. First operand 196 states and 264 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-19 17:14:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:25,457 INFO L93 Difference]: Finished difference Result 204 states and 271 transitions. [2024-11-19 17:14:25,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 17:14:25,457 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-19 17:14:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:25,459 INFO L225 Difference]: With dead ends: 204 [2024-11-19 17:14:25,462 INFO L226 Difference]: Without dead ends: 189 [2024-11-19 17:14:25,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 17:14:25,463 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-19 17:14:25,463 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-19 17:14:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-19 17:14:25,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-19 17:14:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 154 states have (on average 1.3181818181818181) internal successors, (203), 157 states have internal predecessors, (203), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (28), 21 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-19 17:14:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 253 transitions. [2024-11-19 17:14:25,479 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 253 transitions. Word has length 46 [2024-11-19 17:14:25,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:25,479 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 253 transitions. [2024-11-19 17:14:25,479 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-19 17:14:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 253 transitions. [2024-11-19 17:14:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 17:14:25,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:25,480 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-19 17:14:25,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 17:14:25,480 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:25,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1225681735, now seen corresponding path program 1 times [2024-11-19 17:14:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:25,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637910883] [2024-11-19 17:14:25,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:25,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 17:14:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 17:14:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,762 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-19 17:14:25,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:25,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637910883] [2024-11-19 17:14:25,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637910883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:25,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716341750] [2024-11-19 17:14:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:25,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:25,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:25,766 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-19 17:14:25,767 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-19 17:14:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:25,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 17:14:25,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:25,983 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-19 17:14:25,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:26,315 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-19 17:14:26,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716341750] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:26,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:26,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-19 17:14:26,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545699035] [2024-11-19 17:14:26,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:26,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 17:14:26,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:26,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 17:14:26,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-19 17:14:26,317 INFO L87 Difference]: Start difference. First operand 189 states and 253 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-19 17:14:27,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:27,568 INFO L93 Difference]: Finished difference Result 404 states and 573 transitions. [2024-11-19 17:14:27,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-19 17:14:27,569 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-19 17:14:27,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:27,571 INFO L225 Difference]: With dead ends: 404 [2024-11-19 17:14:27,571 INFO L226 Difference]: Without dead ends: 379 [2024-11-19 17:14:27,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2024-11-19 17:14:27,573 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 282 mSDsluCounter, 4046 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:27,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 4243 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 17:14:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-19 17:14:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 234. [2024-11-19 17:14:27,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 189 states have (on average 1.3015873015873016) internal successors, (246), 196 states have internal predecessors, (246), 28 states have call successors, (28), 9 states have call predecessors, (28), 16 states have return successors, (45), 28 states have call predecessors, (45), 27 states have call successors, (45) [2024-11-19 17:14:27,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 319 transitions. [2024-11-19 17:14:27,591 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 319 transitions. Word has length 48 [2024-11-19 17:14:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:27,591 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 319 transitions. [2024-11-19 17:14:27,591 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-19 17:14:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2024-11-19 17:14:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 17:14:27,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:27,595 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:14:27,605 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-19 17:14:27,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:27,799 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:27,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1683702903, now seen corresponding path program 2 times [2024-11-19 17:14:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:27,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097592987] [2024-11-19 17:14:27,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 17:14:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 17:14:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:27,942 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-19 17:14:27,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:27,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097592987] [2024-11-19 17:14:27,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097592987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:27,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329254520] [2024-11-19 17:14:27,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:14:27,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:27,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:27,945 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-19 17:14:27,946 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-19 17:14:27,985 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 17:14:27,985 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:14:27,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 17:14:27,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:28,115 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-19 17:14:28,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:28,406 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-19 17:14:28,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329254520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:28,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:28,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-19 17:14:28,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795043399] [2024-11-19 17:14:28,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:28,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 17:14:28,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:28,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 17:14:28,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-19 17:14:28,408 INFO L87 Difference]: Start difference. First operand 234 states and 319 transitions. Second operand has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 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-19 17:14:29,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:29,509 INFO L93 Difference]: Finished difference Result 453 states and 683 transitions. [2024-11-19 17:14:29,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-19 17:14:29,509 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 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-19 17:14:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:29,511 INFO L225 Difference]: With dead ends: 453 [2024-11-19 17:14:29,511 INFO L226 Difference]: Without dead ends: 438 [2024-11-19 17:14:29,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=295, Invalid=3245, Unknown=0, NotChecked=0, Total=3540 [2024-11-19 17:14:29,513 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 361 mSDsluCounter, 3047 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 3217 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:29,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 3217 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 17:14:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-19 17:14:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 257. [2024-11-19 17:14:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 203 states have (on average 1.2807881773399015) internal successors, (260), 212 states have internal predecessors, (260), 34 states have call successors, (34), 10 states have call predecessors, (34), 19 states have return successors, (69), 34 states have call predecessors, (69), 33 states have call successors, (69) [2024-11-19 17:14:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 363 transitions. [2024-11-19 17:14:29,530 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 363 transitions. Word has length 48 [2024-11-19 17:14:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 363 transitions. [2024-11-19 17:14:29,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 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-19 17:14:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 363 transitions. [2024-11-19 17:14:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 17:14:29,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:29,532 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-19 17:14:29,541 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-19 17:14:29,735 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,SelfDestructingSolverStorable9 [2024-11-19 17:14:29,736 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:29,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:29,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1187408652, now seen corresponding path program 1 times [2024-11-19 17:14:29,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:29,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851506924] [2024-11-19 17:14:29,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:29,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:29,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 17:14:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:29,851 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-19 17:14:29,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:29,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851506924] [2024-11-19 17:14:29,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851506924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:29,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964659245] [2024-11-19 17:14:29,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:29,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:29,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:29,854 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-19 17:14:29,859 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-19 17:14:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:29,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 17:14:29,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:30,158 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-19 17:14:30,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:30,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964659245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:30,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:30,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 18 [2024-11-19 17:14:30,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966603315] [2024-11-19 17:14:30,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:30,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 17:14:30,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:30,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 17:14:30,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-11-19 17:14:30,160 INFO L87 Difference]: Start difference. First operand 257 states and 363 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-19 17:14:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:30,349 INFO L93 Difference]: Finished difference Result 487 states and 689 transitions. [2024-11-19 17:14:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 17:14:30,354 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-19 17:14:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:30,355 INFO L225 Difference]: With dead ends: 487 [2024-11-19 17:14:30,355 INFO L226 Difference]: Without dead ends: 363 [2024-11-19 17:14:30,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 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-19 17:14:30,356 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 63 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:30,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1819 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-19 17:14:30,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 331. [2024-11-19 17:14:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 265 states have (on average 1.2830188679245282) internal successors, (340), 274 states have internal predecessors, (340), 42 states have call successors, (42), 14 states have call predecessors, (42), 23 states have return successors, (74), 42 states have call predecessors, (74), 41 states have call successors, (74) [2024-11-19 17:14:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 456 transitions. [2024-11-19 17:14:30,394 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 456 transitions. Word has length 49 [2024-11-19 17:14:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:30,395 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 456 transitions. [2024-11-19 17:14:30,395 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-19 17:14:30,395 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 456 transitions. [2024-11-19 17:14:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-19 17:14:30,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:30,396 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-19 17:14:30,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:30,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:30,601 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:30,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:30,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1377180783, now seen corresponding path program 1 times [2024-11-19 17:14:30,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:30,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089803278] [2024-11-19 17:14:30,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:30,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 17:14:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 17:14:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,898 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-19 17:14:30,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:30,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089803278] [2024-11-19 17:14:30,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089803278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:30,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059314705] [2024-11-19 17:14:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:30,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:30,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:30,903 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-19 17:14:30,904 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-19 17:14:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:30,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 17:14:30,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:31,010 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-19 17:14:31,011 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:31,194 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-19 17:14:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059314705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:31,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:31,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 21 [2024-11-19 17:14:31,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890405713] [2024-11-19 17:14:31,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:31,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 17:14:31,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:31,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 17:14:31,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-19 17:14:31,195 INFO L87 Difference]: Start difference. First operand 331 states and 456 transitions. Second operand has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 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-19 17:14:31,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:31,625 INFO L93 Difference]: Finished difference Result 496 states and 716 transitions. [2024-11-19 17:14:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-19 17:14:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 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-19 17:14:31,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:31,628 INFO L225 Difference]: With dead ends: 496 [2024-11-19 17:14:31,628 INFO L226 Difference]: Without dead ends: 471 [2024-11-19 17:14:31,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2024-11-19 17:14:31,629 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 132 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:31,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 2074 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 17:14:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-19 17:14:31,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 343. [2024-11-19 17:14:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 272 states have (on average 1.2683823529411764) internal successors, (345), 283 states have internal predecessors, (345), 45 states have call successors, (45), 14 states have call predecessors, (45), 25 states have return successors, (92), 45 states have call predecessors, (92), 44 states have call successors, (92) [2024-11-19 17:14:31,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 482 transitions. [2024-11-19 17:14:31,650 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 482 transitions. Word has length 50 [2024-11-19 17:14:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:31,650 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 482 transitions. [2024-11-19 17:14:31,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 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-19 17:14:31,650 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 482 transitions. [2024-11-19 17:14:31,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 17:14:31,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:31,651 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-19 17:14:31,658 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-19 17:14:31,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:31,856 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:31,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1213879945, now seen corresponding path program 1 times [2024-11-19 17:14:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:31,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034852736] [2024-11-19 17:14:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:31,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:31,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 17:14:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 17:14:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:31,892 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-19 17:14:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:31,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034852736] [2024-11-19 17:14:31,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034852736] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:31,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535563526] [2024-11-19 17:14:31,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:31,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:31,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:31,896 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-19 17:14:31,897 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-19 17:14:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:31,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 17:14:31,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:31,950 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-19 17:14:31,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:31,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535563526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:31,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:31,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-19 17:14:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258086812] [2024-11-19 17:14:31,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:31,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:14:31,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:31,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:14:31,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 17:14:31,951 INFO L87 Difference]: Start difference. First operand 343 states and 482 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-19 17:14:31,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:31,982 INFO L93 Difference]: Finished difference Result 688 states and 971 transitions. [2024-11-19 17:14:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:14:31,982 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-19 17:14:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:31,984 INFO L225 Difference]: With dead ends: 688 [2024-11-19 17:14:31,984 INFO L226 Difference]: Without dead ends: 348 [2024-11-19 17:14:31,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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-19 17:14:31,985 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-19 17:14:31,986 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-19 17:14:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-19 17:14:31,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2024-11-19 17:14:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 275 states have (on average 1.269090909090909) internal successors, (349), 286 states have internal predecessors, (349), 45 states have call successors, (45), 14 states have call predecessors, (45), 25 states have return successors, (92), 45 states have call predecessors, (92), 44 states have call successors, (92) [2024-11-19 17:14:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 486 transitions. [2024-11-19 17:14:32,000 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 486 transitions. Word has length 52 [2024-11-19 17:14:32,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:32,000 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 486 transitions. [2024-11-19 17:14:32,000 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-19 17:14:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 486 transitions. [2024-11-19 17:14:32,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 17:14:32,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:32,001 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-19 17:14:32,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 17:14:32,201 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,SelfDestructingSolverStorable12 [2024-11-19 17:14:32,202 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:32,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:32,202 INFO L85 PathProgramCache]: Analyzing trace with hash 388201992, now seen corresponding path program 1 times [2024-11-19 17:14:32,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:32,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699709314] [2024-11-19 17:14:32,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:32,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 17:14:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 17:14:32,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,298 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-19 17:14:32,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699709314] [2024-11-19 17:14:32,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699709314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:32,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:32,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 17:14:32,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136003487] [2024-11-19 17:14:32,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:32,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 17:14:32,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:32,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 17:14:32,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 17:14:32,300 INFO L87 Difference]: Start difference. First operand 346 states and 486 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-19 17:14:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:32,385 INFO L93 Difference]: Finished difference Result 368 states and 507 transitions. [2024-11-19 17:14:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 17:14:32,386 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-19 17:14:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:32,387 INFO L225 Difference]: With dead ends: 368 [2024-11-19 17:14:32,387 INFO L226 Difference]: Without dead ends: 312 [2024-11-19 17:14:32,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-19 17:14:32,388 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-19 17:14:32,388 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-19 17:14:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-19 17:14:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 307. [2024-11-19 17:14:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 253 states have internal predecessors, (306), 40 states have call successors, (40), 13 states have call predecessors, (40), 23 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-11-19 17:14:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 429 transitions. [2024-11-19 17:14:32,403 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 429 transitions. Word has length 53 [2024-11-19 17:14:32,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:32,403 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 429 transitions. [2024-11-19 17:14:32,403 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-19 17:14:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 429 transitions. [2024-11-19 17:14:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 17:14:32,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:32,404 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-19 17:14:32,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 17:14:32,405 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:32,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:32,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1758994133, now seen corresponding path program 1 times [2024-11-19 17:14:32,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:32,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669342704] [2024-11-19 17:14:32,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:32,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 17:14:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 17:14:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,429 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-19 17:14:32,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:32,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669342704] [2024-11-19 17:14:32,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669342704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:32,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331326598] [2024-11-19 17:14:32,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:32,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:32,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:32,431 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-19 17:14:32,432 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-19 17:14:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 17:14:32,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:32,535 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-19 17:14:32,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:32,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331326598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:32,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:32,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-19 17:14:32,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805571794] [2024-11-19 17:14:32,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:32,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 17:14:32,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:32,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 17:14:32,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 17:14:32,536 INFO L87 Difference]: Start difference. First operand 307 states and 429 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-19 17:14:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:32,564 INFO L93 Difference]: Finished difference Result 617 states and 866 transitions. [2024-11-19 17:14:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 17:14:32,564 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-19 17:14:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:32,566 INFO L225 Difference]: With dead ends: 617 [2024-11-19 17:14:32,566 INFO L226 Difference]: Without dead ends: 313 [2024-11-19 17:14:32,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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-19 17:14:32,567 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-19 17:14:32,567 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-19 17:14:32,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-19 17:14:32,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2024-11-19 17:14:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 245 states have (on average 1.2571428571428571) internal successors, (308), 255 states have internal predecessors, (308), 40 states have call successors, (40), 13 states have call predecessors, (40), 23 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-11-19 17:14:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 431 transitions. [2024-11-19 17:14:32,579 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 431 transitions. Word has length 53 [2024-11-19 17:14:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:32,580 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 431 transitions. [2024-11-19 17:14:32,580 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-19 17:14:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 431 transitions. [2024-11-19 17:14:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 17:14:32,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:32,581 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-19 17:14:32,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 17:14:32,781 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-19 17:14:32,782 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:32,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash 418107322, now seen corresponding path program 1 times [2024-11-19 17:14:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:32,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478502436] [2024-11-19 17:14:32,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:33,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 17:14:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:33,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 17:14:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 17:14:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478502436] [2024-11-19 17:14:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478502436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698145372] [2024-11-19 17:14:33,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:33,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:33,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:33,065 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-19 17:14:33,066 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-19 17:14:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:33,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 17:14:33,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-19 17:14:33,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:33,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698145372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:33,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 17:14:33,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2024-11-19 17:14:33,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510893977] [2024-11-19 17:14:33,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:33,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 17:14:33,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:33,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 17:14:33,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2024-11-19 17:14:33,208 INFO L87 Difference]: Start difference. First operand 309 states and 431 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 17:14:33,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:33,330 INFO L93 Difference]: Finished difference Result 498 states and 692 transitions. [2024-11-19 17:14:33,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 17:14:33,330 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-19 17:14:33,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:33,332 INFO L225 Difference]: With dead ends: 498 [2024-11-19 17:14:33,332 INFO L226 Difference]: Without dead ends: 320 [2024-11-19 17:14:33,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2024-11-19 17:14:33,334 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-19 17:14:33,334 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-19 17:14:33,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-19 17:14:33,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 309. [2024-11-19 17:14:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 245 states have (on average 1.2489795918367348) internal successors, (306), 255 states have internal predecessors, (306), 40 states have call successors, (40), 13 states have call predecessors, (40), 23 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-11-19 17:14:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 429 transitions. [2024-11-19 17:14:33,356 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 429 transitions. Word has length 54 [2024-11-19 17:14:33,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:33,356 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 429 transitions. [2024-11-19 17:14:33,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 17:14:33,357 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 429 transitions. [2024-11-19 17:14:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 17:14:33,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:33,358 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-19 17:14:33,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 17:14:33,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 17:14:33,563 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:33,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1317589488, now seen corresponding path program 1 times [2024-11-19 17:14:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:33,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950903001] [2024-11-19 17:14:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:33,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:33,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 17:14:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:33,695 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-19 17:14:33,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950903001] [2024-11-19 17:14:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950903001] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545769999] [2024-11-19 17:14:33,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:33,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:33,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:33,697 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-19 17:14:33,701 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-19 17:14:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:33,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 17:14:33,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:33,784 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-19 17:14:33,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:33,913 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-19 17:14:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545769999] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:33,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:33,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2024-11-19 17:14:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609984723] [2024-11-19 17:14:33,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:33,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 17:14:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:33,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 17:14:33,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-19 17:14:33,915 INFO L87 Difference]: Start difference. First operand 309 states and 429 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-19 17:14:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:34,056 INFO L93 Difference]: Finished difference Result 448 states and 610 transitions. [2024-11-19 17:14:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 17:14:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2024-11-19 17:14:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:34,058 INFO L225 Difference]: With dead ends: 448 [2024-11-19 17:14:34,058 INFO L226 Difference]: Without dead ends: 367 [2024-11-19 17:14:34,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-19 17:14:34,059 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 93 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:34,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1266 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-19 17:14:34,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 347. [2024-11-19 17:14:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 277 states have (on average 1.259927797833935) internal successors, (349), 289 states have internal predecessors, (349), 43 states have call successors, (43), 14 states have call predecessors, (43), 26 states have return successors, (84), 43 states have call predecessors, (84), 42 states have call successors, (84) [2024-11-19 17:14:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 476 transitions. [2024-11-19 17:14:34,075 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 476 transitions. Word has length 54 [2024-11-19 17:14:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:34,075 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 476 transitions. [2024-11-19 17:14:34,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-19 17:14:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 476 transitions. [2024-11-19 17:14:34,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 17:14:34,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:34,076 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-19 17:14:34,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 17:14:34,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 17:14:34,277 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:34,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:34,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1956309454, now seen corresponding path program 2 times [2024-11-19 17:14:34,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:34,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981365957] [2024-11-19 17:14:34,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:34,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 17:14:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 17:14:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:34,427 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-19 17:14:34,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:34,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981365957] [2024-11-19 17:14:34,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981365957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429683085] [2024-11-19 17:14:34,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:14:34,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:34,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:34,430 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-19 17:14:34,430 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-19 17:14:34,487 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 17:14:34,488 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:14:34,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 17:14:34,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:34,522 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-19 17:14:34,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:34,647 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-19 17:14:34,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429683085] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:34,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:34,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-19 17:14:34,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534001913] [2024-11-19 17:14:34,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:34,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 17:14:34,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:34,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 17:14:34,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-19 17:14:34,649 INFO L87 Difference]: Start difference. First operand 347 states and 476 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-19 17:14:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:34,811 INFO L93 Difference]: Finished difference Result 580 states and 799 transitions. [2024-11-19 17:14:34,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 17:14:34,814 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2024-11-19 17:14:34,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:34,818 INFO L225 Difference]: With dead ends: 580 [2024-11-19 17:14:34,818 INFO L226 Difference]: Without dead ends: 394 [2024-11-19 17:14:34,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-19 17:14:34,819 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 133 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:34,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1251 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 17:14:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-19 17:14:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 347. [2024-11-19 17:14:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 277 states have (on average 1.2527075812274369) internal successors, (347), 289 states have internal predecessors, (347), 43 states have call successors, (43), 14 states have call predecessors, (43), 26 states have return successors, (84), 43 states have call predecessors, (84), 42 states have call successors, (84) [2024-11-19 17:14:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 474 transitions. [2024-11-19 17:14:34,835 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 474 transitions. Word has length 54 [2024-11-19 17:14:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:34,863 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 474 transitions. [2024-11-19 17:14:34,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-19 17:14:34,863 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 474 transitions. [2024-11-19 17:14:34,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 17:14:34,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:34,864 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-19 17:14:34,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-19 17:14:35,064 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,SelfDestructingSolverStorable17 [2024-11-19 17:14:35,064 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:35,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:35,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1591446259, now seen corresponding path program 1 times [2024-11-19 17:14:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:35,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779206472] [2024-11-19 17:14:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 17:14:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 17:14:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 17:14:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,264 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-19 17:14:35,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:35,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779206472] [2024-11-19 17:14:35,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779206472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:35,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621516057] [2024-11-19 17:14:35,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:35,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:35,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:35,266 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-19 17:14:35,267 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-19 17:14:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:35,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 17:14:35,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:35,409 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-19 17:14:35,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:35,742 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-19 17:14:35,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621516057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:35,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:35,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-19 17:14:35,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029609892] [2024-11-19 17:14:35,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:35,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-19 17:14:35,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:35,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-19 17:14:35,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-11-19 17:14:35,744 INFO L87 Difference]: Start difference. First operand 347 states and 474 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-19 17:14:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:36,268 INFO L93 Difference]: Finished difference Result 413 states and 580 transitions. [2024-11-19 17:14:36,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 17:14:36,269 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-19 17:14:36,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:36,271 INFO L225 Difference]: With dead ends: 413 [2024-11-19 17:14:36,271 INFO L226 Difference]: Without dead ends: 381 [2024-11-19 17:14:36,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-11-19 17:14:36,273 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 165 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:36,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 2269 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 17:14:36,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-19 17:14:36,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 333. [2024-11-19 17:14:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 267 states have (on average 1.2621722846441947) internal successors, (337), 278 states have internal predecessors, (337), 41 states have call successors, (41), 12 states have call predecessors, (41), 24 states have return successors, (80), 42 states have call predecessors, (80), 40 states have call successors, (80) [2024-11-19 17:14:36,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 458 transitions. [2024-11-19 17:14:36,288 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 458 transitions. Word has length 55 [2024-11-19 17:14:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:36,289 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 458 transitions. [2024-11-19 17:14:36,289 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-19 17:14:36,289 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 458 transitions. [2024-11-19 17:14:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 17:14:36,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:36,290 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-19 17:14:36,297 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-19 17:14:36,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:36,514 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:36,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1131087777, now seen corresponding path program 2 times [2024-11-19 17:14:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342041682] [2024-11-19 17:14:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:36,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 17:14:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:36,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 17:14:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:36,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 17:14:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:36,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 17:14:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:36,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 17:14:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:36,755 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-19 17:14:36,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 17:14:36,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342041682] [2024-11-19 17:14:36,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342041682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 17:14:36,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965047377] [2024-11-19 17:14:36,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:14:36,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:36,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:36,757 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 17:14:36,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-19 17:14:36,804 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 17:14:36,805 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:14:36,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-19 17:14:36,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:37,686 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-19 17:14:37,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:38,480 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-19 17:14:38,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965047377] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:38,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 17:14:38,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 13] total 36 [2024-11-19 17:14:38,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425031217] [2024-11-19 17:14:38,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:38,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-19 17:14:38,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 17:14:38,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-19 17:14:38,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 17:14:38,482 INFO L87 Difference]: Start difference. First operand 333 states and 458 transitions. Second operand has 36 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 29 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 17:14:39,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:39,715 INFO L93 Difference]: Finished difference Result 451 states and 683 transitions. [2024-11-19 17:14:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-19 17:14:39,715 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 29 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 55 [2024-11-19 17:14:39,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:39,718 INFO L225 Difference]: With dead ends: 451 [2024-11-19 17:14:39,718 INFO L226 Difference]: Without dead ends: 411 [2024-11-19 17:14:39,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2024-11-19 17:14:39,725 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 172 mSDsluCounter, 3128 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:39,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 3266 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 17:14:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-19 17:14:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 325. [2024-11-19 17:14:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 260 states have (on average 1.2692307692307692) internal successors, (330), 273 states have internal predecessors, (330), 40 states have call successors, (40), 10 states have call predecessors, (40), 24 states have return successors, (79), 41 states have call predecessors, (79), 39 states have call successors, (79) [2024-11-19 17:14:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 449 transitions. [2024-11-19 17:14:39,777 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 449 transitions. Word has length 55 [2024-11-19 17:14:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:39,778 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 449 transitions. [2024-11-19 17:14:39,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 29 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 17:14:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 449 transitions. [2024-11-19 17:14:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 17:14:39,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:39,783 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-19 17:14:39,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-19 17:14:39,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 17:14:39,983 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:39,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1641792537, now seen corresponding path program 1 times [2024-11-19 17:14:39,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 17:14:39,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327745440] [2024-11-19 17:14:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:39,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 17:14:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 17:14:40,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 17:14:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 17:14:40,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 17:14:40,114 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 17:14:40,115 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 17:14:40,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 17:14:40,122 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 17:14:40,184 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 17:14:40,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:14:40 BoogieIcfgContainer [2024-11-19 17:14:40,191 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 17:14:40,191 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 17:14:40,194 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 17:14:40,194 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 17:14:40,197 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:20" (3/4) ... [2024-11-19 17:14:40,199 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 17:14:40,200 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 17:14:40,201 INFO L158 Benchmark]: Toolchain (without parser) took 20398.88ms. Allocated memory was 178.3MB in the beginning and 432.0MB in the end (delta: 253.8MB). Free memory was 123.0MB in the beginning and 306.1MB in the end (delta: -183.1MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2024-11-19 17:14:40,201 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 17:14:40,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.31ms. Allocated memory is still 178.3MB. Free memory was 123.0MB in the beginning and 107.5MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 17:14:40,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.87ms. Allocated memory is still 178.3MB. Free memory was 107.5MB in the beginning and 105.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:14:40,201 INFO L158 Benchmark]: Boogie Preprocessor took 62.00ms. Allocated memory is still 178.3MB. Free memory was 105.8MB in the beginning and 103.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:14:40,203 INFO L158 Benchmark]: RCFGBuilder took 473.24ms. Allocated memory is still 178.3MB. Free memory was 103.3MB in the beginning and 142.7MB in the end (delta: -39.4MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-19 17:14:40,203 INFO L158 Benchmark]: TraceAbstraction took 19551.09ms. Allocated memory was 178.3MB in the beginning and 432.0MB in the end (delta: 253.8MB). Free memory was 142.7MB in the beginning and 307.2MB in the end (delta: -164.5MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2024-11-19 17:14:40,203 INFO L158 Benchmark]: Witness Printer took 9.10ms. Allocated memory is still 432.0MB. Free memory was 307.2MB in the beginning and 306.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 17:14:40,204 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 178.3MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.31ms. Allocated memory is still 178.3MB. Free memory was 123.0MB in the beginning and 107.5MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.87ms. Allocated memory is still 178.3MB. Free memory was 107.5MB in the beginning and 105.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.00ms. Allocated memory is still 178.3MB. Free memory was 105.8MB in the beginning and 103.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.24ms. Allocated memory is still 178.3MB. Free memory was 103.3MB in the beginning and 142.7MB in the end (delta: -39.4MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19551.09ms. Allocated memory was 178.3MB in the beginning and 432.0MB in the end (delta: 253.8MB). Free memory was 142.7MB in the beginning and 307.2MB in the end (delta: -164.5MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. * Witness Printer took 9.10ms. Allocated memory is still 432.0MB. Free memory was 307.2MB in the beginning and 306.1MB 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.4s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2002 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1844 mSDsluCounter, 29180 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26746 mSDsCounter, 296 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6151 IncrementalHoareTripleChecker+Invalid, 6447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 296 mSolverCounterUnsat, 2434 mSDtfsCounter, 6151 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1612 GetRequests, 1193 SyntacticMatches, 5 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2056 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=17, InterpolantAutomatonStates: 313, 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, 20 MinimizatonAttempts, 849 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1710 NumberOfCodeBlocks, 1692 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2053 ConstructedInterpolants, 1 QuantifiedInterpolants, 4816 SizeOfPredicates, 21 NumberOfNonLiveVariables, 2085 ConjunctsInSsa, 299 ConjunctsInUnsatCore, 43 InterpolantComputations, 11 PerfectInterpolantSequences, 708/848 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-19 17:14:40,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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 /storage/repos/ultimate/releaseScripts/default/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-wip.dd.update-z3-fca748b-m [2024-11-19 17:14:42,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 17:14:42,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 17:14:42,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 17:14:42,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 17:14:42,892 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 17:14:42,893 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 17:14:42,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 17:14:42,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 17:14:42,898 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 17:14:42,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 17:14:42,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 17:14:42,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 17:14:42,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 17:14:42,899 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 17:14:42,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 17:14:42,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 17:14:42,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 17:14:42,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 17:14:42,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 17:14:42,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 17:14:42,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 17:14:42,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 17:14:42,905 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 17:14:42,905 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 17:14:42,905 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 17:14:42,906 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 17:14:42,906 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 17:14:42,906 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 17:14:42,906 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 17:14:42,906 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 17:14:42,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 17:14:42,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 17:14:42,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 17:14:42,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:14:42,907 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 17:14:42,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 17:14:42,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 17:14:42,908 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 17:14:42,909 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 17:14:42,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 17:14:42,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 17:14:42,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 17:14:42,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 17:14:42,910 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-19 17:14:43,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 17:14:43,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 17:14:43,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 17:14:43,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 17:14:43,173 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 17:14:43,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-19 17:14:44,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 17:14:44,674 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 17:14:44,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-19 17:14:44,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3a75d8a/97900dbc1f6c48a19bee9ffa7f49bbfc/FLAGc1d34d07f [2024-11-19 17:14:44,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef3a75d8a/97900dbc1f6c48a19bee9ffa7f49bbfc [2024-11-19 17:14:44,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 17:14:44,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 17:14:44,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 17:14:44,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 17:14:44,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 17:14:44,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f1fec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44, skipping insertion in model container [2024-11-19 17:14:44,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:44,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 17:14:44,877 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-19 17:14:44,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:14:44,933 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 17:14:44,942 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-19 17:14:44,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 17:14:44,989 INFO L204 MainTranslator]: Completed translation [2024-11-19 17:14:44,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44 WrapperNode [2024-11-19 17:14:44,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 17:14:44,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 17:14:44,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 17:14:44,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 17:14:44,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,020 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-19 17:14:45,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 17:14:45,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 17:14:45,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 17:14:45,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 17:14:45,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,056 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-19 17:14:45,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,082 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 17:14:45,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 17:14:45,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 17:14:45,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 17:14:45,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (1/1) ... [2024-11-19 17:14:45,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 17:14:45,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 17:14:45,119 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-19 17:14:45,121 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-19 17:14:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 17:14:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 17:14:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-19 17:14:45,159 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-19 17:14:45,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 17:14:45,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 17:14:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-19 17:14:45,160 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-19 17:14:45,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 17:14:45,161 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 17:14:45,223 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 17:14:45,225 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 17:14:45,385 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-19 17:14:45,385 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 17:14:45,394 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 17:14:45,394 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 17:14:45,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:45 BoogieIcfgContainer [2024-11-19 17:14:45,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 17:14:45,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 17:14:45,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 17:14:45,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 17:14:45,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:14:44" (1/3) ... [2024-11-19 17:14:45,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9bf66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:14:45, skipping insertion in model container [2024-11-19 17:14:45,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:14:44" (2/3) ... [2024-11-19 17:14:45,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9bf66e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:14:45, skipping insertion in model container [2024-11-19 17:14:45,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:45" (3/3) ... [2024-11-19 17:14:45,407 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-11-19 17:14:45,419 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 17:14:45,419 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 17:14:45,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 17:14:45,492 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;@77c4546b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 17:14:45,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 17:14:45,496 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-19 17:14:45,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 17:14:45,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:45,503 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-19 17:14:45,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:45,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:45,508 INFO L85 PathProgramCache]: Analyzing trace with hash 173410466, now seen corresponding path program 1 times [2024-11-19 17:14:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:45,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046996090] [2024-11-19 17:14:45,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:45,518 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-19 17:14:45,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:45,521 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-19 17:14:45,522 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-19 17:14:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:45,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 17:14:45,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:45,719 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-19 17:14:45,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:45,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:45,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046996090] [2024-11-19 17:14:45,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046996090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:45,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:45,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 17:14:45,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153801036] [2024-11-19 17:14:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:45,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 17:14:45,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:45,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 17:14:45,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 17:14:45,750 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-19 17:14:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:45,855 INFO L93 Difference]: Finished difference Result 125 states and 190 transitions. [2024-11-19 17:14:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 17:14:45,857 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-19 17:14:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:45,864 INFO L225 Difference]: With dead ends: 125 [2024-11-19 17:14:45,864 INFO L226 Difference]: Without dead ends: 68 [2024-11-19 17:14:45,867 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-19 17:14:45,870 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-19 17:14:45,871 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-19 17:14:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-19 17:14:45,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2024-11-19 17:14:45,919 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-19 17:14:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2024-11-19 17:14:45,929 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 31 [2024-11-19 17:14:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:45,930 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2024-11-19 17:14:45,930 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-19 17:14:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2024-11-19 17:14:45,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 17:14:45,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:45,943 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-19 17:14:45,948 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-19 17:14:46,143 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-19 17:14:46,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:46,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1707598935, now seen corresponding path program 1 times [2024-11-19 17:14:46,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:46,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966317292] [2024-11-19 17:14:46,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:46,146 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-19 17:14:46,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:46,173 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-19 17:14:46,174 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-19 17:14:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:46,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 17:14:46,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:46,279 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-19 17:14:46,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:46,336 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-19 17:14:46,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:46,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966317292] [2024-11-19 17:14:46,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966317292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:46,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:14:46,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-19 17:14:46,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44326094] [2024-11-19 17:14:46,337 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:46,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 17:14:46,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:46,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 17:14:46,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 17:14:46,343 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-19 17:14:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:46,447 INFO L93 Difference]: Finished difference Result 115 states and 153 transitions. [2024-11-19 17:14:46,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 17:14:46,448 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-19 17:14:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:46,449 INFO L225 Difference]: With dead ends: 115 [2024-11-19 17:14:46,450 INFO L226 Difference]: Without dead ends: 87 [2024-11-19 17:14:46,450 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-19 17:14:46,451 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-19 17:14:46,453 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-19 17:14:46,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-19 17:14:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2024-11-19 17:14:46,466 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-19 17:14:46,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-19 17:14:46,470 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 35 [2024-11-19 17:14:46,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:46,471 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-19 17:14:46,471 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-19 17:14:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-19 17:14:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 17:14:46,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:46,473 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-19 17:14:46,477 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-19 17:14:46,675 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-19 17:14:46,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:46,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:46,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1508244029, now seen corresponding path program 1 times [2024-11-19 17:14:46,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:46,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039893306] [2024-11-19 17:14:46,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:46,681 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-19 17:14:46,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:46,683 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-19 17:14:46,685 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-19 17:14:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:46,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 17:14:46,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:46,823 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-19 17:14:46,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 17:14:46,873 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-19 17:14:46,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:46,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039893306] [2024-11-19 17:14:46,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039893306] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 17:14:46,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 17:14:46,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-19 17:14:46,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257255651] [2024-11-19 17:14:46,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 17:14:46,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 17:14:46,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:46,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 17:14:46,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 17:14:46,883 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-19 17:14:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:46,966 INFO L93 Difference]: Finished difference Result 110 states and 146 transitions. [2024-11-19 17:14:46,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 17:14:46,968 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-19 17:14:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:46,970 INFO L225 Difference]: With dead ends: 110 [2024-11-19 17:14:46,970 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 17:14:46,970 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-19 17:14:46,971 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-19 17:14:46,971 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-19 17:14:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 17:14:46,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-19 17:14:46,978 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-19 17:14:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2024-11-19 17:14:46,980 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 39 [2024-11-19 17:14:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:46,980 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2024-11-19 17:14:46,980 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-19 17:14:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2024-11-19 17:14:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 17:14:46,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:46,982 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-19 17:14:46,989 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-19 17:14:47,184 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-19 17:14:47,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:47,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:47,185 INFO L85 PathProgramCache]: Analyzing trace with hash -54729342, now seen corresponding path program 2 times [2024-11-19 17:14:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:47,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55120258] [2024-11-19 17:14:47,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 17:14:47,186 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-19 17:14:47,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:47,191 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-19 17:14:47,192 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-19 17:14:47,228 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 17:14:47,228 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 17:14:47,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 17:14:47,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:47,378 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-19 17:14:47,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:47,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:47,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55120258] [2024-11-19 17:14:47,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55120258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:47,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:47,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 17:14:47,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445108198] [2024-11-19 17:14:47,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:47,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 17:14:47,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:47,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 17:14:47,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 17:14:47,381 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-19 17:14:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:47,464 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2024-11-19 17:14:47,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 17:14:47,465 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-19 17:14:47,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:47,466 INFO L225 Difference]: With dead ends: 91 [2024-11-19 17:14:47,466 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 17:14:47,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 17:14:47,467 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:47,467 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.1s Time] [2024-11-19 17:14:47,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 17:14:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-19 17:14:47,474 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-19 17:14:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2024-11-19 17:14:47,475 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 39 [2024-11-19 17:14:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:47,475 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2024-11-19 17:14:47,476 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-19 17:14:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2024-11-19 17:14:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 17:14:47,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:47,480 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-19 17:14:47,485 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 (5)] Ended with exit code 0 [2024-11-19 17:14:47,681 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-19 17:14:47,681 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:47,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:47,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2528960, now seen corresponding path program 1 times [2024-11-19 17:14:47,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:47,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126295944] [2024-11-19 17:14:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:47,683 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-19 17:14:47,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:47,693 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-19 17:14:47,705 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-19 17:14:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:47,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 17:14:47,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:47,947 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-19 17:14:47,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:47,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:47,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126295944] [2024-11-19 17:14:47,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126295944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:47,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:47,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 17:14:47,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156023274] [2024-11-19 17:14:47,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:47,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 17:14:47,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:47,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 17:14:47,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 17:14:47,954 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-19 17:14:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:48,082 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2024-11-19 17:14:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 17:14:48,082 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-19 17:14:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:48,087 INFO L225 Difference]: With dead ends: 93 [2024-11-19 17:14:48,087 INFO L226 Difference]: Without dead ends: 91 [2024-11-19 17:14:48,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 17:14:48,088 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 17:14:48,091 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.1s Time] [2024-11-19 17:14:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-19 17:14:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-11-19 17:14:48,113 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-19 17:14:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2024-11-19 17:14:48,114 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 39 [2024-11-19 17:14:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:48,115 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2024-11-19 17:14:48,115 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-19 17:14:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2024-11-19 17:14:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 17:14:48,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:48,116 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-19 17:14:48,127 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-19 17:14:48,322 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-19 17:14:48,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:48,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:48,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1837968146, now seen corresponding path program 1 times [2024-11-19 17:14:48,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:48,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49059083] [2024-11-19 17:14:48,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:48,327 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-19 17:14:48,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:48,332 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-19 17:14:48,334 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-19 17:14:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:48,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 17:14:48,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:48,450 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-19 17:14:48,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:48,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:48,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49059083] [2024-11-19 17:14:48,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49059083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:48,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:48,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 17:14:48,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714900097] [2024-11-19 17:14:48,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:48,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 17:14:48,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 17:14:48,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 17:14:48,452 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-19 17:14:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:48,657 INFO L93 Difference]: Finished difference Result 124 states and 163 transitions. [2024-11-19 17:14:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 17:14:48,657 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-19 17:14:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:48,658 INFO L225 Difference]: With dead ends: 124 [2024-11-19 17:14:48,658 INFO L226 Difference]: Without dead ends: 117 [2024-11-19 17:14:48,659 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-19 17:14:48,659 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-19 17:14:48,659 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-19 17:14:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-19 17:14:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2024-11-19 17:14:48,668 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-19 17:14:48,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2024-11-19 17:14:48,669 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 44 [2024-11-19 17:14:48,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:48,670 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2024-11-19 17:14:48,670 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-19 17:14:48,670 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2024-11-19 17:14:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 17:14:48,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:48,671 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-19 17:14:48,678 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-19 17:14:48,873 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-19 17:14:48,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:48,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:48,874 INFO L85 PathProgramCache]: Analyzing trace with hash 595859751, now seen corresponding path program 1 times [2024-11-19 17:14:48,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:48,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876454861] [2024-11-19 17:14:48,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:48,875 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-19 17:14:48,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:48,877 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-19 17:14:48,878 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-19 17:14:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 17:14:48,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 17:14:48,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 17:14:48,985 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-19 17:14:48,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 17:14:48,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 17:14:48,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876454861] [2024-11-19 17:14:48,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876454861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 17:14:48,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 17:14:48,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 17:14:48,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457516508] [2024-11-19 17:14:48,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 17:14:48,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 17:14:48,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 17:14:48,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 17:14:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 17:14:48,987 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-19 17:14:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 17:14:49,068 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2024-11-19 17:14:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 17:14:49,072 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-19 17:14:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 17:14:49,073 INFO L225 Difference]: With dead ends: 158 [2024-11-19 17:14:49,073 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 17:14:49,073 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-19 17:14:49,074 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-19 17:14:49,074 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-19 17:14:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 17:14:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2024-11-19 17:14:49,086 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-19 17:14:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2024-11-19 17:14:49,087 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 49 [2024-11-19 17:14:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 17:14:49,087 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2024-11-19 17:14:49,087 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-19 17:14:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2024-11-19 17:14:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 17:14:49,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 17:14:49,089 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-19 17:14:49,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 17:14:49,291 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-19 17:14:49,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 17:14:49,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 17:14:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1849173563, now seen corresponding path program 1 times [2024-11-19 17:14:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 17:14:49,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633849135] [2024-11-19 17:14:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 17:14:49,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 17:14:49,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 17:14:49,296 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-19 17:14:49,296 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-19 17:14:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 17:14:49,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 17:14:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 17:14:49,415 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 17:14:49,415 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 17:14:49,416 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 17:14:49,426 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-19 17:14:49,620 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-19 17:14:49,623 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-19 17:14:49,656 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 17:14:49,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:14:49 BoogieIcfgContainer [2024-11-19 17:14:49,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 17:14:49,662 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 17:14:49,662 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 17:14:49,662 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 17:14:49,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:14:45" (3/4) ... [2024-11-19 17:14:49,663 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 17:14:49,713 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 17:14:49,714 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 17:14:49,714 INFO L158 Benchmark]: Toolchain (without parser) took 5015.70ms. Allocated memory was 79.7MB in the beginning and 121.6MB in the end (delta: 41.9MB). Free memory was 48.2MB in the beginning and 88.2MB in the end (delta: -40.0MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-11-19 17:14:49,714 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 31.3MB in the beginning and 31.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 17:14:49,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.96ms. Allocated memory is still 79.7MB. Free memory was 48.0MB in the beginning and 53.0MB in the end (delta: -5.0MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-11-19 17:14:49,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.59ms. Allocated memory is still 79.7MB. Free memory was 52.7MB in the beginning and 51.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:14:49,715 INFO L158 Benchmark]: Boogie Preprocessor took 60.69ms. Allocated memory is still 79.7MB. Free memory was 51.1MB in the beginning and 49.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:14:49,715 INFO L158 Benchmark]: RCFGBuilder took 314.57ms. Allocated memory is still 79.7MB. Free memory was 49.0MB in the beginning and 33.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 17:14:49,715 INFO L158 Benchmark]: TraceAbstraction took 4260.48ms. Allocated memory was 79.7MB in the beginning and 121.6MB in the end (delta: 41.9MB). Free memory was 32.6MB in the beginning and 91.2MB in the end (delta: -58.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 17:14:49,716 INFO L158 Benchmark]: Witness Printer took 51.51ms. Allocated memory is still 121.6MB. Free memory was 91.2MB in the beginning and 88.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 17:14:49,717 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 54.5MB. Free memory was 31.3MB in the beginning and 31.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.96ms. Allocated memory is still 79.7MB. Free memory was 48.0MB in the beginning and 53.0MB in the end (delta: -5.0MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.59ms. Allocated memory is still 79.7MB. Free memory was 52.7MB in the beginning and 51.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.69ms. Allocated memory is still 79.7MB. Free memory was 51.1MB in the beginning and 49.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.57ms. Allocated memory is still 79.7MB. Free memory was 49.0MB in the beginning and 33.2MB in the end (delta: 15.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4260.48ms. Allocated memory was 79.7MB in the beginning and 121.6MB in the end (delta: 41.9MB). Free memory was 32.6MB in the beginning and 91.2MB in the end (delta: -58.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 51.51ms. Allocated memory is still 121.6MB. Free memory was 91.2MB in the beginning and 88.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_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: 4.2s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 3111 SdHoareTripleChecker+Invalid, 0.5s 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.2s SatisfiabilityAnalysisTime, 0.8s 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-19 17:14:49,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE