./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:09:19,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:09:19,150 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 18:09:19,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:09:19,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:09:19,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:09:19,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:09:19,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:09:19,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:09:19,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:09:19,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:09:19,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:09:19,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:09:19,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:09:19,187 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:09:19,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:09:19,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:09:19,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 18:09:19,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:09:19,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:09:19,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:09:19,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:09:19,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:09:19,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:09:19,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:09:19,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:09:19,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:09:19,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:09:19,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:09:19,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:09:19,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:09:19,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:09:19,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:09:19,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 18:09:19,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 18:09:19,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:09:19,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:09:19,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:09:19,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:09:19,198 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a [2024-11-08 18:09:19,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:09:19,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:09:19,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:09:19,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:09:19,410 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:09:19,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-11-08 18:09:20,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:09:20,989 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:09:20,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-11-08 18:09:21,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2582b2b0d/2cea99c1d91e42dab53a9dafdb3209b4/FLAG6cd2b4290 [2024-11-08 18:09:21,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2582b2b0d/2cea99c1d91e42dab53a9dafdb3209b4 [2024-11-08 18:09:21,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:09:21,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:09:21,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:09:21,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:09:21,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:09:21,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e6a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21, skipping insertion in model container [2024-11-08 18:09:21,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:09:21,200 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/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2024-11-08 18:09:21,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:09:21,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:09:21,251 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/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2024-11-08 18:09:21,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:09:21,285 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:09:21,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21 WrapperNode [2024-11-08 18:09:21,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:09:21,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:09:21,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:09:21,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:09:21,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,348 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 188 [2024-11-08 18:09:21,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:09:21,349 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:09:21,349 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:09:21,349 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:09:21,358 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,390 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-08 18:09:21,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,412 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:09:21,423 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:09:21,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:09:21,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:09:21,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (1/1) ... [2024-11-08 18:09:21,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:09:21,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:09:21,453 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-08 18:09:21,457 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-08 18:09:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:09:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 18:09:21,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:09:21,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:09:21,584 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:09:21,587 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:09:22,052 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-08 18:09:22,054 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:09:22,067 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:09:22,067 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:09:22,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:09:22 BoogieIcfgContainer [2024-11-08 18:09:22,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:09:22,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:09:22,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:09:22,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:09:22,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:09:21" (1/3) ... [2024-11-08 18:09:22,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6dbaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:09:22, skipping insertion in model container [2024-11-08 18:09:22,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:09:21" (2/3) ... [2024-11-08 18:09:22,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6dbaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:09:22, skipping insertion in model container [2024-11-08 18:09:22,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:09:22" (3/3) ... [2024-11-08 18:09:22,081 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2024-11-08 18:09:22,098 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:09:22,098 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:09:22,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:09:22,157 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;@603e6b00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:09:22,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:09:22,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 18:09:22,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:22,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:22,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:22,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash -829897697, now seen corresponding path program 1 times [2024-11-08 18:09:22,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:22,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850806998] [2024-11-08 18:09:22,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:22,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:22,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850806998] [2024-11-08 18:09:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850806998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:22,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:22,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:09:22,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922349512] [2024-11-08 18:09:22,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:22,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:09:22,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:09:22,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:09:22,544 INFO L87 Difference]: Start difference. First operand has 50 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:22,571 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2024-11-08 18:09:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:09:22,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 18:09:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:22,579 INFO L225 Difference]: With dead ends: 89 [2024-11-08 18:09:22,579 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 18:09:22,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:09:22,584 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:22,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 189 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:09:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 18:09:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 18:09:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2024-11-08 18:09:22,610 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 13 [2024-11-08 18:09:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:22,610 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-11-08 18:09:22,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2024-11-08 18:09:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 18:09:22,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:22,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:22,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 18:09:22,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:22,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash 44670374, now seen corresponding path program 1 times [2024-11-08 18:09:22,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:22,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553470361] [2024-11-08 18:09:22,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:22,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:22,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:22,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553470361] [2024-11-08 18:09:22,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553470361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:22,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:22,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:09:22,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620432169] [2024-11-08 18:09:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:22,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:09:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:09:22,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:09:22,712 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:22,739 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-11-08 18:09:22,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:09:22,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 18:09:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:22,740 INFO L225 Difference]: With dead ends: 90 [2024-11-08 18:09:22,740 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 18:09:22,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:09:22,741 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:22,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:09:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 18:09:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 18:09:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-11-08 18:09:22,751 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 14 [2024-11-08 18:09:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:22,751 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-11-08 18:09:22,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:22,752 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-11-08 18:09:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 18:09:22,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:22,752 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:22,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 18:09:22,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:22,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash 286815704, now seen corresponding path program 1 times [2024-11-08 18:09:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685733103] [2024-11-08 18:09:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685733103] [2024-11-08 18:09:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685733103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:22,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:22,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:09:22,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955287772] [2024-11-08 18:09:22,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:22,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:09:22,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:22,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:09:22,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:09:22,993 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:23,067 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2024-11-08 18:09:23,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:09:23,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 18:09:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:23,069 INFO L225 Difference]: With dead ends: 119 [2024-11-08 18:09:23,069 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 18:09:23,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:09:23,070 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 44 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:23,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 221 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:23,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 18:09:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2024-11-08 18:09:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2024-11-08 18:09:23,076 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 15 [2024-11-08 18:09:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:23,077 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2024-11-08 18:09:23,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2024-11-08 18:09:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 18:09:23,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:23,080 INFO L215 NwaCegarLoop]: trace histogram [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-08 18:09:23,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 18:09:23,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:23,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1054619020, now seen corresponding path program 1 times [2024-11-08 18:09:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442716545] [2024-11-08 18:09:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:23,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:23,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442716545] [2024-11-08 18:09:23,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442716545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:23,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:23,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:09:23,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864705000] [2024-11-08 18:09:23,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:23,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:09:23,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:23,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:09:23,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:09:23,531 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:23,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:23,621 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-11-08 18:09:23,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:09:23,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-08 18:09:23,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:23,623 INFO L225 Difference]: With dead ends: 144 [2024-11-08 18:09:23,623 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 18:09:23,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 18:09:23,624 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 60 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:23,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 520 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:23,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 18:09:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2024-11-08 18:09:23,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 63 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 89 transitions. [2024-11-08 18:09:23,630 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 89 transitions. Word has length 34 [2024-11-08 18:09:23,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:23,630 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 89 transitions. [2024-11-08 18:09:23,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 89 transitions. [2024-11-08 18:09:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 18:09:23,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:23,631 INFO L215 NwaCegarLoop]: trace histogram [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-08 18:09:23,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 18:09:23,632 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:23,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 617088049, now seen corresponding path program 1 times [2024-11-08 18:09:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:23,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059837098] [2024-11-08 18:09:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:23,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:24,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:24,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059837098] [2024-11-08 18:09:24,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059837098] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:09:24,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842613826] [2024-11-08 18:09:24,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:24,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:24,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:09:24,046 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-08 18:09:24,047 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-08 18:09:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:24,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 18:09:24,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:24,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:09:24,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842613826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:24,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 18:09:24,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-08 18:09:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508516176] [2024-11-08 18:09:24,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:24,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:09:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:09:24,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-08 18:09:24,527 INFO L87 Difference]: Start difference. First operand 64 states and 89 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:24,654 INFO L93 Difference]: Finished difference Result 157 states and 219 transitions. [2024-11-08 18:09:24,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:09:24,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-08 18:09:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:24,656 INFO L225 Difference]: With dead ends: 157 [2024-11-08 18:09:24,656 INFO L226 Difference]: Without dead ends: 103 [2024-11-08 18:09:24,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-08 18:09:24,658 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 131 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:24,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 154 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:24,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-08 18:09:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2024-11-08 18:09:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-08 18:09:24,664 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 35 [2024-11-08 18:09:24,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:24,665 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-08 18:09:24,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:24,665 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-08 18:09:24,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 18:09:24,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:24,666 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:24,682 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-08 18:09:24,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:24,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:24,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1091437488, now seen corresponding path program 1 times [2024-11-08 18:09:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173960010] [2024-11-08 18:09:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:25,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:25,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173960010] [2024-11-08 18:09:25,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173960010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:25,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:25,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:09:25,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053098165] [2024-11-08 18:09:25,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:25,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:09:25,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:25,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:09:25,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:09:25,219 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:25,397 INFO L93 Difference]: Finished difference Result 179 states and 248 transitions. [2024-11-08 18:09:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 18:09:25,399 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-08 18:09:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:25,399 INFO L225 Difference]: With dead ends: 179 [2024-11-08 18:09:25,400 INFO L226 Difference]: Without dead ends: 125 [2024-11-08 18:09:25,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-08 18:09:25,401 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 153 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:25,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 266 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-08 18:09:25,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 95. [2024-11-08 18:09:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.351063829787234) internal successors, (127), 94 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2024-11-08 18:09:25,407 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 36 [2024-11-08 18:09:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:25,407 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2024-11-08 18:09:25,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2024-11-08 18:09:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 18:09:25,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:25,408 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 18:09:25,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 18:09:25,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:25,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash 494893948, now seen corresponding path program 1 times [2024-11-08 18:09:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:25,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345505853] [2024-11-08 18:09:25,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:25,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:25,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:25,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345505853] [2024-11-08 18:09:25,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345505853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:09:25,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924867554] [2024-11-08 18:09:25,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:25,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:25,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:09:25,768 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-08 18:09:25,773 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-08 18:09:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:25,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 18:09:25,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:26,053 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:09:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:26,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924867554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:09:26,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:09:26,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 19 [2024-11-08 18:09:26,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692190854] [2024-11-08 18:09:26,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:09:26,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 18:09:26,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:26,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 18:09:26,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-08 18:09:26,306 INFO L87 Difference]: Start difference. First operand 95 states and 127 transitions. Second operand has 19 states, 19 states have (on average 5.105263157894737) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:26,853 INFO L93 Difference]: Finished difference Result 247 states and 341 transitions. [2024-11-08 18:09:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 18:09:26,854 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.105263157894737) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-08 18:09:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:26,855 INFO L225 Difference]: With dead ends: 247 [2024-11-08 18:09:26,855 INFO L226 Difference]: Without dead ends: 193 [2024-11-08 18:09:26,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 18:09:26,856 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 503 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:26,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1045 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 18:09:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-08 18:09:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 97. [2024-11-08 18:09:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions. [2024-11-08 18:09:26,866 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 37 [2024-11-08 18:09:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:26,866 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 130 transitions. [2024-11-08 18:09:26,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.105263157894737) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2024-11-08 18:09:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 18:09:26,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:26,867 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 18:09:26,885 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-08 18:09:27,074 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,SelfDestructingSolverStorable6 [2024-11-08 18:09:27,075 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:27,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 32065123, now seen corresponding path program 1 times [2024-11-08 18:09:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:27,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93092332] [2024-11-08 18:09:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:27,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:27,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:27,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93092332] [2024-11-08 18:09:27,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93092332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:27,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:27,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 18:09:27,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224861205] [2024-11-08 18:09:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:27,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:09:27,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:27,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:09:27,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:09:27,635 INFO L87 Difference]: Start difference. First operand 97 states and 130 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:27,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:27,793 INFO L93 Difference]: Finished difference Result 184 states and 252 transitions. [2024-11-08 18:09:27,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:09:27,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-08 18:09:27,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:27,794 INFO L225 Difference]: With dead ends: 184 [2024-11-08 18:09:27,794 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 18:09:27,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:09:27,796 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 47 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:27,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 222 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 18:09:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 99. [2024-11-08 18:09:27,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2024-11-08 18:09:27,801 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 132 transitions. Word has length 37 [2024-11-08 18:09:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:27,801 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 132 transitions. [2024-11-08 18:09:27,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 132 transitions. [2024-11-08 18:09:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 18:09:27,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:27,802 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 18:09:27,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 18:09:27,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:27,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash -569459623, now seen corresponding path program 1 times [2024-11-08 18:09:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389252468] [2024-11-08 18:09:27,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:27,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:28,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:28,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389252468] [2024-11-08 18:09:28,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389252468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:28,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:28,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 18:09:28,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289622101] [2024-11-08 18:09:28,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:28,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 18:09:28,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:28,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 18:09:28,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:09:28,065 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:28,105 INFO L93 Difference]: Finished difference Result 168 states and 226 transitions. [2024-11-08 18:09:28,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 18:09:28,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-08 18:09:28,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:28,107 INFO L225 Difference]: With dead ends: 168 [2024-11-08 18:09:28,107 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 18:09:28,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:09:28,108 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:28,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 222 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:09:28,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 18:09:28,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2024-11-08 18:09:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:28,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2024-11-08 18:09:28,112 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 37 [2024-11-08 18:09:28,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:28,112 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2024-11-08 18:09:28,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2024-11-08 18:09:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 18:09:28,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:28,114 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:28,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 18:09:28,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:28,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:28,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1693663533, now seen corresponding path program 1 times [2024-11-08 18:09:28,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:28,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790901484] [2024-11-08 18:09:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:28,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:28,831 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:28,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:28,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790901484] [2024-11-08 18:09:28,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790901484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:09:28,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919583255] [2024-11-08 18:09:28,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:28,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:28,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:09:28,834 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-08 18:09:28,835 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-08 18:09:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:28,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-08 18:09:28,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:29,766 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:29,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:09:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919583255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:09:31,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:09:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 19] total 42 [2024-11-08 18:09:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833769232] [2024-11-08 18:09:31,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:09:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-08 18:09:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-08 18:09:31,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1460, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 18:09:31,158 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand has 42 states, 42 states have (on average 3.5952380952380953) internal successors, (151), 42 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:33,724 INFO L93 Difference]: Finished difference Result 244 states and 337 transitions. [2024-11-08 18:09:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-11-08 18:09:33,725 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.5952380952380953) internal successors, (151), 42 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-11-08 18:09:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:33,726 INFO L225 Difference]: With dead ends: 244 [2024-11-08 18:09:33,726 INFO L226 Difference]: Without dead ends: 187 [2024-11-08 18:09:33,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1649, Invalid=9481, Unknown=0, NotChecked=0, Total=11130 [2024-11-08 18:09:33,729 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 677 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:33,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 395 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 18:09:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-08 18:09:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 134. [2024-11-08 18:09:33,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.300751879699248) internal successors, (173), 133 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2024-11-08 18:09:33,735 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 56 [2024-11-08 18:09:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:33,735 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2024-11-08 18:09:33,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.5952380952380953) internal successors, (151), 42 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2024-11-08 18:09:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 18:09:33,736 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:33,736 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:33,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 18:09:33,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:33,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:33,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash -816109728, now seen corresponding path program 1 times [2024-11-08 18:09:33,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:33,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88362463] [2024-11-08 18:09:33,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:33,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 18:09:34,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88362463] [2024-11-08 18:09:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88362463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:09:34,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:09:34,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 18:09:34,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154238250] [2024-11-08 18:09:34,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:09:34,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 18:09:34,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:34,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 18:09:34,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:09:34,546 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:34,612 INFO L93 Difference]: Finished difference Result 254 states and 330 transitions. [2024-11-08 18:09:34,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 18:09:34,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-08 18:09:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:34,613 INFO L225 Difference]: With dead ends: 254 [2024-11-08 18:09:34,616 INFO L226 Difference]: Without dead ends: 143 [2024-11-08 18:09:34,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 18:09:34,617 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 9 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:34,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 172 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:09:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-08 18:09:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2024-11-08 18:09:34,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 141 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 182 transitions. [2024-11-08 18:09:34,624 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 182 transitions. Word has length 57 [2024-11-08 18:09:34,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:34,624 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 182 transitions. [2024-11-08 18:09:34,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 182 transitions. [2024-11-08 18:09:34,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 18:09:34,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:34,626 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:34,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 18:09:34,626 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:34,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash -959605868, now seen corresponding path program 1 times [2024-11-08 18:09:34,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:34,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529428286] [2024-11-08 18:09:34,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:34,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529428286] [2024-11-08 18:09:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529428286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:09:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651705054] [2024-11-08 18:09:35,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:35,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:35,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:09:35,370 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-08 18:09:35,377 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-08 18:09:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:35,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-08 18:09:35,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:35,994 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:35,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:09:36,900 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:36,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651705054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:09:36,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:09:36,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 14] total 31 [2024-11-08 18:09:36,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90004643] [2024-11-08 18:09:36,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:09:36,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-08 18:09:36,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:36,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-08 18:09:36,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2024-11-08 18:09:36,902 INFO L87 Difference]: Start difference. First operand 142 states and 182 transitions. Second operand has 31 states, 31 states have (on average 4.903225806451613) internal successors, (152), 31 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:38,490 INFO L93 Difference]: Finished difference Result 445 states and 583 transitions. [2024-11-08 18:09:38,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-08 18:09:38,491 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.903225806451613) internal successors, (152), 31 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-08 18:09:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:38,492 INFO L225 Difference]: With dead ends: 445 [2024-11-08 18:09:38,493 INFO L226 Difference]: Without dead ends: 334 [2024-11-08 18:09:38,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=685, Invalid=4571, Unknown=0, NotChecked=0, Total=5256 [2024-11-08 18:09:38,495 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 561 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:38,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 764 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 18:09:38,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-08 18:09:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 239. [2024-11-08 18:09:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.3235294117647058) internal successors, (315), 238 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:38,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 315 transitions. [2024-11-08 18:09:38,503 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 315 transitions. Word has length 58 [2024-11-08 18:09:38,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:38,504 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 315 transitions. [2024-11-08 18:09:38,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.903225806451613) internal successors, (152), 31 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 315 transitions. [2024-11-08 18:09:38,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 18:09:38,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:38,505 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:38,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 18:09:38,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:38,706 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:38,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:38,707 INFO L85 PathProgramCache]: Analyzing trace with hash -257269680, now seen corresponding path program 1 times [2024-11-08 18:09:38,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:38,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777074850] [2024-11-08 18:09:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:40,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777074850] [2024-11-08 18:09:40,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777074850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:09:40,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872892129] [2024-11-08 18:09:40,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:40,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:40,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:09:40,023 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-08 18:09:40,024 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-08 18:09:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:40,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 170 conjuncts are in the unsatisfiable core [2024-11-08 18:09:40,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:41,038 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:09:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:43,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872892129] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:09:43,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:09:43,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 27] total 52 [2024-11-08 18:09:43,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63791733] [2024-11-08 18:09:43,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:09:43,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-08 18:09:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:43,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-08 18:09:43,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2342, Unknown=0, NotChecked=0, Total=2652 [2024-11-08 18:09:43,973 INFO L87 Difference]: Start difference. First operand 239 states and 315 transitions. Second operand has 52 states, 52 states have (on average 2.8846153846153846) internal successors, (150), 52 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:48,214 INFO L93 Difference]: Finished difference Result 878 states and 1178 transitions. [2024-11-08 18:09:48,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-11-08 18:09:48,214 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.8846153846153846) internal successors, (150), 52 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-08 18:09:48,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:48,217 INFO L225 Difference]: With dead ends: 878 [2024-11-08 18:09:48,220 INFO L226 Difference]: Without dead ends: 670 [2024-11-08 18:09:48,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2720 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1225, Invalid=9077, Unknown=0, NotChecked=0, Total=10302 [2024-11-08 18:09:48,226 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 724 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 2685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:48,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 884 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2651 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 18:09:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-08 18:09:48,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 586. [2024-11-08 18:09:48,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 1.34017094017094) internal successors, (784), 585 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 784 transitions. [2024-11-08 18:09:48,240 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 784 transitions. Word has length 58 [2024-11-08 18:09:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:48,240 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 784 transitions. [2024-11-08 18:09:48,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.8846153846153846) internal successors, (150), 52 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:48,241 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 784 transitions. [2024-11-08 18:09:48,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-08 18:09:48,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:48,241 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:48,258 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-08 18:09:48,445 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,SelfDestructingSolverStorable12 [2024-11-08 18:09:48,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:09:48,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:09:48,447 INFO L85 PathProgramCache]: Analyzing trace with hash -645449134, now seen corresponding path program 1 times [2024-11-08 18:09:48,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:09:48,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605069701] [2024-11-08 18:09:48,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:48,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:09:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:49,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:09:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605069701] [2024-11-08 18:09:49,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605069701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:09:49,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829812372] [2024-11-08 18:09:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:09:49,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:09:49,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:09:49,598 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-08 18:09:49,612 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-08 18:09:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:09:49,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 163 conjuncts are in the unsatisfiable core [2024-11-08 18:09:49,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:09:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:51,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:09:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:09:56,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829812372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:09:56,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:09:56,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 23, 31] total 62 [2024-11-08 18:09:56,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097292452] [2024-11-08 18:09:56,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:09:56,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-08 18:09:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:09:56,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-08 18:09:56,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=3256, Unknown=0, NotChecked=0, Total=3782 [2024-11-08 18:09:56,615 INFO L87 Difference]: Start difference. First operand 586 states and 784 transitions. Second operand has 62 states, 62 states have (on average 2.7419354838709675) internal successors, (170), 62 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:09:59,820 INFO L93 Difference]: Finished difference Result 1226 states and 1638 transitions. [2024-11-08 18:09:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-08 18:09:59,821 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.7419354838709675) internal successors, (170), 62 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-08 18:09:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:09:59,826 INFO L225 Difference]: With dead ends: 1226 [2024-11-08 18:09:59,826 INFO L226 Difference]: Without dead ends: 800 [2024-11-08 18:09:59,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2847 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1446, Invalid=9060, Unknown=0, NotChecked=0, Total=10506 [2024-11-08 18:09:59,830 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 410 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 18:09:59,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 611 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 18:09:59,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-08 18:09:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 779. [2024-11-08 18:09:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 778 states have (on average 1.3187660668380463) internal successors, (1026), 778 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1026 transitions. [2024-11-08 18:09:59,860 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1026 transitions. Word has length 61 [2024-11-08 18:09:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:09:59,860 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1026 transitions. [2024-11-08 18:09:59,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.7419354838709675) internal successors, (170), 62 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:09:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1026 transitions. [2024-11-08 18:09:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 18:09:59,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:09:59,862 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:09:59,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 18:10:00,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:00,067 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:00,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash 829719567, now seen corresponding path program 1 times [2024-11-08 18:10:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:00,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803855654] [2024-11-08 18:10:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 18:10:00,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803855654] [2024-11-08 18:10:00,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803855654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:00,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:00,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:10:00,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140323228] [2024-11-08 18:10:00,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:00,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:10:00,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:00,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:10:00,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:10:00,473 INFO L87 Difference]: Start difference. First operand 779 states and 1026 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:00,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:00,549 INFO L93 Difference]: Finished difference Result 1489 states and 1977 transitions. [2024-11-08 18:10:00,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:10:00,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-08 18:10:00,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:00,552 INFO L225 Difference]: With dead ends: 1489 [2024-11-08 18:10:00,552 INFO L226 Difference]: Without dead ends: 834 [2024-11-08 18:10:00,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:10:00,554 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 37 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:00,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 224 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-11-08 18:10:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 769. [2024-11-08 18:10:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 768 states have (on average 1.31640625) internal successors, (1011), 768 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1011 transitions. [2024-11-08 18:10:00,573 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1011 transitions. Word has length 62 [2024-11-08 18:10:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:00,574 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1011 transitions. [2024-11-08 18:10:00,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1011 transitions. [2024-11-08 18:10:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 18:10:00,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:00,576 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:00,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 18:10:00,576 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:00,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:00,577 INFO L85 PathProgramCache]: Analyzing trace with hash -258450001, now seen corresponding path program 1 times [2024-11-08 18:10:00,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:00,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417971763] [2024-11-08 18:10:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:00,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 18:10:01,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:01,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417971763] [2024-11-08 18:10:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417971763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:01,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:01,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 18:10:01,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183834542] [2024-11-08 18:10:01,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:01,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 18:10:01,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:01,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 18:10:01,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:10:01,036 INFO L87 Difference]: Start difference. First operand 769 states and 1011 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:01,094 INFO L93 Difference]: Finished difference Result 1451 states and 1924 transitions. [2024-11-08 18:10:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 18:10:01,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-08 18:10:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:01,097 INFO L225 Difference]: With dead ends: 1451 [2024-11-08 18:10:01,097 INFO L226 Difference]: Without dead ends: 794 [2024-11-08 18:10:01,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-08 18:10:01,099 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 35 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:01,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 179 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-11-08 18:10:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 784. [2024-11-08 18:10:01,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.3103448275862069) internal successors, (1026), 783 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1026 transitions. [2024-11-08 18:10:01,117 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1026 transitions. Word has length 62 [2024-11-08 18:10:01,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:01,117 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1026 transitions. [2024-11-08 18:10:01,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1026 transitions. [2024-11-08 18:10:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 18:10:01,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:01,118 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:01,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 18:10:01,119 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:01,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:01,119 INFO L85 PathProgramCache]: Analyzing trace with hash -490582354, now seen corresponding path program 1 times [2024-11-08 18:10:01,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:01,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680237249] [2024-11-08 18:10:01,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:01,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:10:01,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:10:01,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680237249] [2024-11-08 18:10:01,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680237249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:10:01,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639188420] [2024-11-08 18:10:01,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:01,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:01,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:10:01,587 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-08 18:10:01,589 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-08 18:10:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:01,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 18:10:01,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:10:01,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:10:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:10:02,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639188420] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:10:02,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 18:10:02,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-11-08 18:10:02,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708716654] [2024-11-08 18:10:02,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 18:10:02,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 18:10:02,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 18:10:02,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 18:10:02,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-08 18:10:02,099 INFO L87 Difference]: Start difference. First operand 784 states and 1026 transitions. Second operand has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:02,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:02,304 INFO L93 Difference]: Finished difference Result 1428 states and 1870 transitions. [2024-11-08 18:10:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 18:10:02,306 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-08 18:10:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:02,309 INFO L225 Difference]: With dead ends: 1428 [2024-11-08 18:10:02,309 INFO L226 Difference]: Without dead ends: 731 [2024-11-08 18:10:02,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=545, Unknown=0, NotChecked=0, Total=702 [2024-11-08 18:10:02,311 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 225 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:02,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 254 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:02,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-08 18:10:02,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 717. [2024-11-08 18:10:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 716 states have (on average 1.2835195530726258) internal successors, (919), 716 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 919 transitions. [2024-11-08 18:10:02,329 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 919 transitions. Word has length 63 [2024-11-08 18:10:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:02,330 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 919 transitions. [2024-11-08 18:10:02,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.055555555555555) internal successors, (127), 18 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 919 transitions. [2024-11-08 18:10:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-08 18:10:02,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:02,331 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:02,346 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-08 18:10:02,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:10:02,532 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:02,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:02,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2120217931, now seen corresponding path program 1 times [2024-11-08 18:10:02,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:10:02,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128892999] [2024-11-08 18:10:02,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:02,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:10:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:10:02,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 18:10:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 18:10:02,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 18:10:02,811 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 18:10:02,812 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 18:10:02,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 18:10:02,816 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:02,871 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 18:10:02,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:10:02 BoogieIcfgContainer [2024-11-08 18:10:02,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 18:10:02,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 18:10:02,875 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 18:10:02,875 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 18:10:02,875 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:09:22" (3/4) ... [2024-11-08 18:10:02,877 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 18:10:02,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 18:10:02,879 INFO L158 Benchmark]: Toolchain (without parser) took 41857.86ms. Allocated memory was 159.4MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 102.8MB in the beginning and 566.6MB in the end (delta: -463.8MB). Peak memory consumption was 383.1MB. Max. memory is 16.1GB. [2024-11-08 18:10:02,879 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:10:02,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.20ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 88.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 18:10:02,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.65ms. Allocated memory is still 159.4MB. Free memory was 87.7MB in the beginning and 82.7MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:10:02,880 INFO L158 Benchmark]: Boogie Preprocessor took 73.95ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 79.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 18:10:02,880 INFO L158 Benchmark]: RCFGBuilder took 646.99ms. Allocated memory is still 159.4MB. Free memory was 78.9MB in the beginning and 110.3MB in the end (delta: -31.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 18:10:02,881 INFO L158 Benchmark]: TraceAbstraction took 40802.29ms. Allocated memory was 159.4MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 109.8MB in the beginning and 567.7MB in the end (delta: -457.8MB). Peak memory consumption was 389.4MB. Max. memory is 16.1GB. [2024-11-08 18:10:02,881 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 1.0GB. Free memory is still 566.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 18:10:02,882 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.18ms. Allocated memory is still 159.4MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.20ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 88.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.65ms. Allocated memory is still 159.4MB. Free memory was 87.7MB in the beginning and 82.7MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.95ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 79.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 646.99ms. Allocated memory is still 159.4MB. Free memory was 78.9MB in the beginning and 110.3MB in the end (delta: -31.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 40802.29ms. Allocated memory was 159.4MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 109.8MB in the beginning and 567.7MB in the end (delta: -457.8MB). Peak memory consumption was 389.4MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 1.0GB. Free memory is still 566.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 bitwiseAnd at line 115. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 4); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (4 - 1); [L32] const SORT_3 var_4 = 0; [L33] const SORT_3 var_7 = 1; [L34] const SORT_1 var_14 = 1; [L35] const SORT_3 var_20 = 15; [L37] SORT_1 input_2; [L39] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L39] SORT_3 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L40] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, var_14=1, var_20=15, var_4=0, var_7=1] [L40] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] SORT_3 init_6_arg_1 = var_4; [L43] state_5 = init_6_arg_1 [L44] SORT_3 init_9_arg_1 = var_7; [L45] state_8 = init_9_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=0, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_24=1, var_25=0, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_26=0, var_7=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=1, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_31_arg_0=0, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, state_5=0, state_8=1, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_34=2, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=0, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-256, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L63] RET __VERIFIER_assert(!(bad_17_arg_0)) [L65] SORT_3 var_25_arg_0 = state_5; [L66] SORT_3 var_25_arg_1 = state_8; [L67] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L68] SORT_3 var_24_arg_0 = state_5; [L69] SORT_3 var_24_arg_1 = var_7; [L70] SORT_3 var_24 = var_24_arg_0 + var_24_arg_1; [L71] SORT_3 var_19_arg_0 = state_5; [L72] SORT_3 var_19_arg_1 = state_8; [L73] SORT_1 var_19 = var_19_arg_0 > var_19_arg_1; [L74] SORT_3 var_21_arg_0 = state_8; [L75] SORT_3 var_21_arg_1 = var_20; [L76] SORT_1 var_21 = var_21_arg_0 != var_21_arg_1; [L77] SORT_1 var_22_arg_0 = var_19; [L78] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_22_arg_0=0, var_22_arg_1=1, var_24=1, var_25=1, var_7=1] [L79] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_24=1, var_25=1, var_7=1] [L79] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L80] EXPR var_22 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_24=1, var_25=1, var_7=1] [L80] var_22 = var_22 & mask_SORT_1 [L81] SORT_1 var_23_arg_0 = var_22; [L82] SORT_3 var_23_arg_1 = state_5; [L83] SORT_3 var_23_arg_2 = state_8; [L84] SORT_3 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L85] SORT_1 var_26_arg_0 = var_25; [L86] SORT_3 var_26_arg_1 = var_24; [L87] SORT_3 var_26_arg_2 = var_23; [L88] SORT_3 var_26 = var_26_arg_0 ? var_26_arg_1 : var_26_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_26=1, var_7=1] [L89] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=0, state_8=0, var_14=1, var_20=15, var_7=1] [L89] var_26 = var_26 & mask_SORT_3 [L90] SORT_3 next_27_arg_1 = var_26; [L91] SORT_3 var_33_arg_0 = state_5; [L92] SORT_3 var_33_arg_1 = state_8; [L93] SORT_1 var_33 = var_33_arg_0 > var_33_arg_1; [L94] SORT_3 var_29_arg_0 = state_5; [L95] SORT_3 var_29_arg_1 = state_8; [L96] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L97] SORT_3 var_30_arg_0 = state_8; [L98] SORT_3 var_30_arg_1 = var_20; [L99] SORT_1 var_30 = var_30_arg_0 != var_30_arg_1; [L100] SORT_1 var_31_arg_0 = var_29; [L101] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_31_arg_0=1, var_31_arg_1=1, var_33=0, var_7=1] [L102] EXPR var_31_arg_0 | var_31_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_33=0, var_7=1] [L102] SORT_1 var_31 = var_31_arg_0 | var_31_arg_1; [L103] EXPR var_31 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, state_5=0, state_8=0, var_14=1, var_20=15, var_33=0, var_7=1] [L103] var_31 = var_31 & mask_SORT_1 [L104] SORT_3 var_28_arg_0 = state_8; [L105] SORT_3 var_28_arg_1 = var_7; [L106] SORT_3 var_28 = var_28_arg_0 + var_28_arg_1; [L107] SORT_1 var_32_arg_0 = var_31; [L108] SORT_3 var_32_arg_1 = var_28; [L109] SORT_3 var_32_arg_2 = state_5; [L110] SORT_3 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L111] SORT_1 var_34_arg_0 = var_33; [L112] SORT_3 var_34_arg_1 = state_8; [L113] SORT_3 var_34_arg_2 = var_32; [L114] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, var_14=1, var_20=15, var_34=1, var_7=1] [L115] EXPR var_34 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=15, next_27_arg_1=1, var_14=1, var_20=15, var_7=1] [L115] var_34 = var_34 & mask_SORT_3 [L116] SORT_3 next_35_arg_1 = var_34; [L118] state_5 = next_27_arg_1 [L119] state_8 = next_35_arg_1 [L48] input_2 = __VERIFIER_nondet_uchar() [L51] SORT_3 var_10_arg_0 = state_5; [L52] SORT_3 var_10_arg_1 = state_8; [L53] SORT_1 var_10 = var_10_arg_0 > var_10_arg_1; [L54] SORT_1 var_11_arg_0 = var_10; [L55] SORT_1 var_11 = ~var_11_arg_0; [L56] SORT_1 var_15_arg_0 = var_11; [L57] SORT_1 var_15 = ~var_15_arg_0; [L58] SORT_1 var_16_arg_0 = var_14; [L59] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_16_arg_0=1, var_16_arg_1=-255, var_20=15, var_7=1] [L60] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_20=15, var_7=1] [L60] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L61] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_3=15, state_5=1, state_8=0, var_14=1, var_20=15, var_7=1] [L61] var_16 = var_16 & mask_SORT_1 [L62] SORT_1 bad_17_arg_0 = var_16; [L63] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.7s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3642 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3642 mSDsluCounter, 6507 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5620 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9175 IncrementalHoareTripleChecker+Invalid, 9301 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 887 mSDtfsCounter, 9175 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1076 GetRequests, 570 SyntacticMatches, 1 SemanticMatches, 505 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9903 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=784occurred in iteration=16, InterpolantAutomatonStates: 339, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 588 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 22.5s InterpolantComputationTime, 1166 NumberOfCodeBlocks, 1166 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1406 ConstructedInterpolants, 0 QuantifiedInterpolants, 19251 SizeOfPredicates, 45 NumberOfNonLiveVariables, 2649 ConjunctsInSsa, 584 ConjunctsInUnsatCore, 30 InterpolantComputations, 11 PerfectInterpolantSequences, 404/633 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-08 18:10:02,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 18:10:05,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 18:10:05,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 18:10:05,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 18:10:05,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 18:10:05,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 18:10:05,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 18:10:05,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 18:10:05,222 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 18:10:05,223 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 18:10:05,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 18:10:05,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 18:10:05,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 18:10:05,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 18:10:05,227 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 18:10:05,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 18:10:05,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 18:10:05,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 18:10:05,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 18:10:05,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 18:10:05,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 18:10:05,231 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 18:10:05,231 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 18:10:05,231 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 18:10:05,231 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 18:10:05,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 18:10:05,232 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 18:10:05,232 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 18:10:05,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 18:10:05,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 18:10:05,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 18:10:05,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:10:05,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 18:10:05,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 18:10:05,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 18:10:05,233 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 18:10:05,234 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 18:10:05,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 18:10:05,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 18:10:05,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 18:10:05,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 18:10:05,237 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb8ca5e5ce2ed40fdd0ad3d69b0bd96c83a6daf11d842e9766da8dc50e36012a [2024-11-08 18:10:05,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 18:10:05,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 18:10:05,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 18:10:05,581 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 18:10:05,581 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 18:10:05,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-11-08 18:10:07,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 18:10:07,631 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 18:10:07,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c [2024-11-08 18:10:07,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236e2c0a5/b1fda8e2716a47c5ad863ce7061149f3/FLAGe1c924ba8 [2024-11-08 18:10:07,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236e2c0a5/b1fda8e2716a47c5ad863ce7061149f3 [2024-11-08 18:10:07,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 18:10:07,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 18:10:07,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 18:10:07,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 18:10:07,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 18:10:07,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:07,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319b7566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07, skipping insertion in model container [2024-11-08 18:10:07,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:07,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 18:10:07,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/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2024-11-08 18:10:07,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:10:07,938 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 18:10:07,950 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/hardware-verification-bv/btor2c-lazyMod.cav14_example_v.c[1255,1268] [2024-11-08 18:10:07,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 18:10:07,986 INFO L204 MainTranslator]: Completed translation [2024-11-08 18:10:07,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07 WrapperNode [2024-11-08 18:10:07,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 18:10:07,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 18:10:07,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 18:10:07,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 18:10:07,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,026 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-11-08 18:10:08,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 18:10:08,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 18:10:08,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 18:10:08,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 18:10:08,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,065 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-08 18:10:08,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 18:10:08,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 18:10:08,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 18:10:08,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 18:10:08,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (1/1) ... [2024-11-08 18:10:08,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 18:10:08,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 18:10:08,108 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-08 18:10:08,110 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-08 18:10:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 18:10:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 18:10:08,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 18:10:08,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 18:10:08,282 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 18:10:08,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 18:10:08,478 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 18:10:08,478 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 18:10:08,494 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 18:10:08,495 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 18:10:08,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:10:08 BoogieIcfgContainer [2024-11-08 18:10:08,496 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 18:10:08,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 18:10:08,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 18:10:08,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 18:10:08,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:10:07" (1/3) ... [2024-11-08 18:10:08,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54839dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:10:08, skipping insertion in model container [2024-11-08 18:10:08,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:10:07" (2/3) ... [2024-11-08 18:10:08,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54839dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:10:08, skipping insertion in model container [2024-11-08 18:10:08,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:10:08" (3/3) ... [2024-11-08 18:10:08,505 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cav14_example_v.c [2024-11-08 18:10:08,528 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 18:10:08,530 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 18:10:08,584 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 18:10:08,590 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;@4da085ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 18:10:08,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 18:10:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 18:10:08,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:08,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 18:10:08,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:08,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:08,608 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 18:10:08,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:10:08,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468277769] [2024-11-08 18:10:08,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:08,619 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-08 18:10:08,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:10:08,622 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-08 18:10:08,623 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-08 18:10:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:08,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 18:10:08,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:08,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:10:08,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 18:10:08,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:10:08,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468277769] [2024-11-08 18:10:08,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468277769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 18:10:08,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 18:10:08,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 18:10:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033580449] [2024-11-08 18:10:08,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 18:10:08,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 18:10:08,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:10:08,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 18:10:08,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 18:10:08,962 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:08,997 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 18:10:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 18:10:09,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-08 18:10:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:09,009 INFO L225 Difference]: With dead ends: 18 [2024-11-08 18:10:09,010 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 18:10:09,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 18:10:09,016 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:09,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 18:10:09,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 18:10:09,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:09,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 18:10:09,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 18:10:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:09,041 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 18:10:09,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 18:10:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 18:10:09,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:09,042 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 18:10:09,049 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-08 18:10:09,245 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-08 18:10:09,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:09,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:09,247 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 18:10:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:10:09,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854236560] [2024-11-08 18:10:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:10:09,248 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-08 18:10:09,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:10:09,286 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-08 18:10:09,290 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-08 18:10:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:10:09,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-08 18:10:09,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:10:09,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:10:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:10:10,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:10:10,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854236560] [2024-11-08 18:10:10,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854236560] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:10:10,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:10:10,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 18:10:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869021529] [2024-11-08 18:10:10,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:10:10,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 18:10:10,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:10:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 18:10:10,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-08 18:10:10,469 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:10,656 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-08 18:10:10,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 18:10:10,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-08 18:10:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:10,657 INFO L225 Difference]: With dead ends: 18 [2024-11-08 18:10:10,657 INFO L226 Difference]: Without dead ends: 16 [2024-11-08 18:10:10,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:10:10,658 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:10,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 18:10:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-08 18:10:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-08 18:10:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-08 18:10:10,662 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-08 18:10:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:10,662 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-08 18:10:10,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-08 18:10:10,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-08 18:10:10,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:10,663 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-08 18:10:10,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 18:10:10,865 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-08 18:10:10,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:10,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:10,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-08 18:10:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:10:10,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055254566] [2024-11-08 18:10:10,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:10:10,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 18:10:10,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:10:10,877 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-08 18:10:10,884 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-08 18:10:10,975 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:10:10,975 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:10:10,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 18:10:10,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:10:11,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:10:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:10:16,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 18:10:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055254566] [2024-11-08 18:10:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055254566] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 18:10:16,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 18:10:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-08 18:10:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443805885] [2024-11-08 18:10:16,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 18:10:16,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 18:10:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 18:10:16,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 18:10:16,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-08 18:10:16,066 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:16,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:10:16,644 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-08 18:10:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 18:10:16,645 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-08 18:10:16,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:10:16,645 INFO L225 Difference]: With dead ends: 30 [2024-11-08 18:10:16,645 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 18:10:16,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2024-11-08 18:10:16,647 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:10:16,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 18:10:16,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 18:10:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-08 18:10:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-08 18:10:16,652 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-08 18:10:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:10:16,652 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-08 18:10:16,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:10:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-08 18:10:16,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 18:10:16,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:10:16,653 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-08 18:10:16,661 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-08 18:10:16,856 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-08 18:10:16,857 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 18:10:16,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:10:16,860 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-08 18:10:16,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 18:10:16,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229224724] [2024-11-08 18:10:16,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 18:10:16,861 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-08 18:10:16,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 18:10:16,862 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-08 18:10:16,864 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-08 18:10:16,993 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-08 18:10:16,993 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:10:16,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-08 18:10:17,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:10:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:10:17,611 INFO L311 TraceCheckSpWp]: Computing backward predicates...