./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.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 1ed4a8166e43af31025ed37886c26d8ffdcca7c92b59539857ec6cced7b52d7d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:11:37,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:11:38,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 06:11:38,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:11:38,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:11:38,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:11:38,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:11:38,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:11:38,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:11:38,045 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:11:38,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:11:38,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:11:38,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:11:38,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:11:38,048 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:11:38,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:11:38,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:11:38,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 06:11:38,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:11:38,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:11:38,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:11:38,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:11:38,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:11:38,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:11:38,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:11:38,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:11:38,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:11:38,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:11:38,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:11:38,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:11:38,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:11:38,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:11:38,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:11:38,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 06:11:38,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 06:11:38,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:11:38,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:11:38,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:11:38,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:11:38,057 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 -> 1ed4a8166e43af31025ed37886c26d8ffdcca7c92b59539857ec6cced7b52d7d [2024-10-14 06:11:38,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:11:38,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:11:38,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:11:38,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:11:38,428 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:11:38,430 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c [2024-10-14 06:11:40,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:11:40,471 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:11:40,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c [2024-10-14 06:11:40,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d776c808/84a833a56d00448482f4f89684dc1bf8/FLAG2ccdaee27 [2024-10-14 06:11:40,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d776c808/84a833a56d00448482f4f89684dc1bf8 [2024-10-14 06:11:40,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:11:40,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:11:40,824 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:11:40,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:11:40,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:11:40,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:11:40" (1/1) ... [2024-10-14 06:11:40,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47053530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:40, skipping insertion in model container [2024-10-14 06:11:40,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:11:40" (1/1) ... [2024-10-14 06:11:40,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:11:41,043 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c[1249,1262] [2024-10-14 06:11:41,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:11:41,154 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:11:41,167 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c[1249,1262] [2024-10-14 06:11:41,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:11:41,227 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:11:41,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41 WrapperNode [2024-10-14 06:11:41,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:11:41,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:11:41,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:11:41,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:11:41,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,447 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 416 [2024-10-14 06:11:41,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:11:41,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:11:41,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:11:41,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:11:41,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,544 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 06:11:41,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:11:41,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:11:41,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:11:41,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:11:41,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (1/1) ... [2024-10-14 06:11:41,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:11:41,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:11:41,654 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-10-14 06:11:41,660 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-10-14 06:11:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:11:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 06:11:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:11:41,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:11:41,835 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:11:41,838 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:11:42,550 INFO L? ?]: Removed 188 outVars from TransFormulas that were not future-live. [2024-10-14 06:11:42,550 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:11:42,585 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:11:42,585 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:11:42,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:42 BoogieIcfgContainer [2024-10-14 06:11:42,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:11:42,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:11:42,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:11:42,592 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:11:42,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:11:40" (1/3) ... [2024-10-14 06:11:42,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8ff465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:11:42, skipping insertion in model container [2024-10-14 06:11:42,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:41" (2/3) ... [2024-10-14 06:11:42,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8ff465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:11:42, skipping insertion in model container [2024-10-14 06:11:42,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:42" (3/3) ... [2024-10-14 06:11:42,598 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v4.c [2024-10-14 06:11:42,617 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:11:42,618 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:11:42,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:11:42,728 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;@1fc9befc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:11:42,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:11:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 06:11:42,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:42,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:11:42,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:42,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:42,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1308562600, now seen corresponding path program 1 times [2024-10-14 06:11:42,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789357151] [2024-10-14 06:11:42,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:42,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:43,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:11:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789357151] [2024-10-14 06:11:43,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789357151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:11:43,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:11:43,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:11:43,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578158250] [2024-10-14 06:11:43,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:11:43,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:11:43,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:11:43,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:11:43,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:43,384 INFO L87 Difference]: Start difference. First operand has 91 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 90 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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-10-14 06:11:43,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:43,441 INFO L93 Difference]: Finished difference Result 138 states and 204 transitions. [2024-10-14 06:11:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:11:43,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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-10-14 06:11:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:43,454 INFO L225 Difference]: With dead ends: 138 [2024-10-14 06:11:43,455 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 06:11:43,458 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-10-14 06:11:43,463 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:11:43,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:11:43,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 06:11:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-14 06:11:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 91 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:11:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-14 06:11:43,503 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 34 [2024-10-14 06:11:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:43,504 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-14 06:11:43,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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-10-14 06:11:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-14 06:11:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 06:11:43,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:43,506 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:11:43,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 06:11:43,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:43,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:43,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1912430284, now seen corresponding path program 1 times [2024-10-14 06:11:43,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:43,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934849297] [2024-10-14 06:11:43,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:43,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:43,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:11:43,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934849297] [2024-10-14 06:11:43,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934849297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:11:43,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:11:43,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:11:43,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222778436] [2024-10-14 06:11:43,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:11:43,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:11:43,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:11:43,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:11:43,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:43,747 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 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-10-14 06:11:43,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:43,798 INFO L93 Difference]: Finished difference Result 141 states and 204 transitions. [2024-10-14 06:11:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:11:43,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-10-14 06:11:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:43,802 INFO L225 Difference]: With dead ends: 141 [2024-10-14 06:11:43,803 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 06:11:43,803 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-10-14 06:11:43,805 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:11:43,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 379 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:11:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 06:11:43,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 06:11:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 0 states have call successors, (0), 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-10-14 06:11:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-14 06:11:43,814 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 35 [2024-10-14 06:11:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:43,814 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-14 06:11:43,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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-10-14 06:11:43,815 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-14 06:11:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 06:11:43,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:43,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:11:43,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 06:11:43,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:43,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1942169087, now seen corresponding path program 1 times [2024-10-14 06:11:43,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:43,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944987299] [2024-10-14 06:11:43,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:43,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:44,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:11:44,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944987299] [2024-10-14 06:11:44,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944987299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:11:44,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:11:44,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 06:11:44,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192681655] [2024-10-14 06:11:44,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:11:44,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:11:44,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:11:44,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:11:44,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:44,041 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 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-10-14 06:11:44,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:44,093 INFO L93 Difference]: Finished difference Result 141 states and 203 transitions. [2024-10-14 06:11:44,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:11:44,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 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-10-14 06:11:44,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:44,095 INFO L225 Difference]: With dead ends: 141 [2024-10-14 06:11:44,095 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 06:11:44,096 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-10-14 06:11:44,096 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 104 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:11:44,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 245 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:11:44,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 06:11:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-14 06:11:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 91 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-10-14 06:11:44,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-14 06:11:44,116 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 36 [2024-10-14 06:11:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:44,116 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-14 06:11:44,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 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-10-14 06:11:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-14 06:11:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 06:11:44,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:44,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:11:44,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 06:11:44,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:44,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1486845743, now seen corresponding path program 1 times [2024-10-14 06:11:44,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:44,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524133463] [2024-10-14 06:11:44,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:44,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:11:44,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 06:11:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:11:44,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 06:11:44,254 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 06:11:44,255 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 06:11:44,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 06:11:44,261 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 06:11:44,297 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 06:11:44,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:11:44 BoogieIcfgContainer [2024-10-14 06:11:44,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 06:11:44,320 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 06:11:44,320 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 06:11:44,320 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 06:11:44,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:42" (3/4) ... [2024-10-14 06:11:44,323 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 06:11:44,329 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 06:11:44,334 INFO L158 Benchmark]: Toolchain (without parser) took 3507.92ms. Allocated memory was 182.5MB in the beginning and 268.4MB in the end (delta: 86.0MB). Free memory was 114.9MB in the beginning and 231.4MB in the end (delta: -116.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:11:44,335 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 109.1MB. Free memory was 80.1MB in the beginning and 80.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:11:44,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.90ms. Allocated memory is still 182.5MB. Free memory was 114.7MB in the beginning and 97.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 06:11:44,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 218.23ms. Allocated memory is still 182.5MB. Free memory was 97.7MB in the beginning and 145.5MB in the end (delta: -47.8MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-10-14 06:11:44,337 INFO L158 Benchmark]: Boogie Preprocessor took 165.89ms. Allocated memory is still 182.5MB. Free memory was 145.5MB in the beginning and 138.9MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 06:11:44,337 INFO L158 Benchmark]: RCFGBuilder took 971.48ms. Allocated memory is still 182.5MB. Free memory was 138.9MB in the beginning and 85.4MB in the end (delta: 53.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-14 06:11:44,337 INFO L158 Benchmark]: TraceAbstraction took 1730.21ms. Allocated memory was 182.5MB in the beginning and 268.4MB in the end (delta: 86.0MB). Free memory was 84.7MB in the beginning and 231.4MB in the end (delta: -146.7MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-10-14 06:11:44,338 INFO L158 Benchmark]: Witness Printer took 9.40ms. Allocated memory is still 268.4MB. Free memory is still 231.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:11:44,339 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.28ms. Allocated memory is still 109.1MB. Free memory was 80.1MB in the beginning and 80.0MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.90ms. Allocated memory is still 182.5MB. Free memory was 114.7MB in the beginning and 97.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 218.23ms. Allocated memory is still 182.5MB. Free memory was 97.7MB in the beginning and 145.5MB in the end (delta: -47.8MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 165.89ms. Allocated memory is still 182.5MB. Free memory was 145.5MB in the beginning and 138.9MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 971.48ms. Allocated memory is still 182.5MB. Free memory was 138.9MB in the beginning and 85.4MB in the end (delta: 53.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1730.21ms. Allocated memory was 182.5MB in the beginning and 268.4MB in the end (delta: 86.0MB). Free memory was 84.7MB in the beginning and 231.4MB in the end (delta: -146.7MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 9.40ms. Allocated memory is still 268.4MB. Free memory is still 231.4MB. 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 99. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_9 = 0; [L33] const SORT_5 var_17 = 1; [L34] const SORT_5 var_29 = 0; [L35] const SORT_1 var_75 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_27; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L45] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L47] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L48] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L49] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L50] SORT_5 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L51] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L52] SORT_5 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L53] SORT_1 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L54] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_17=1, var_29=0, var_75=1, var_9=0] [L55] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_11_arg_1 = var_9; [L58] state_10 = init_11_arg_1 [L59] SORT_1 init_13_arg_1 = var_9; [L60] state_12 = init_13_arg_1 [L61] SORT_1 init_22_arg_1 = var_9; [L62] state_21 = init_22_arg_1 [L63] SORT_1 init_24_arg_1 = var_9; [L64] state_23 = init_24_arg_1 [L65] SORT_1 init_26_arg_1 = var_9; [L66] state_25 = init_26_arg_1 [L67] SORT_5 init_31_arg_1 = var_29; [L68] state_30 = init_31_arg_1 [L69] SORT_1 init_33_arg_1 = var_9; [L70] state_32 = init_33_arg_1 [L71] SORT_5 init_35_arg_1 = var_29; [L72] state_34 = init_35_arg_1 [L73] SORT_1 init_37_arg_1 = var_9; [L74] state_36 = init_37_arg_1 [L75] SORT_1 init_40_arg_1 = var_9; [L76] state_39 = init_40_arg_1 [L77] SORT_1 init_42_arg_1 = var_9; [L78] state_41 = init_42_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L81] input_2 = __VERIFIER_nondet_uchar() [L82] input_3 = __VERIFIER_nondet_uchar() [L83] input_4 = __VERIFIER_nondet_uchar() [L84] input_6 = __VERIFIER_nondet_uchar() [L85] input_7 = __VERIFIER_nondet_uchar() [L86] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L86] input_7 = input_7 & mask_SORT_5 [L87] input_8 = __VERIFIER_nondet_uchar() [L88] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L88] input_8 = input_8 & mask_SORT_5 [L89] input_27 = __VERIFIER_nondet_uchar() [L92] SORT_1 var_14_arg_0 = state_10; [L93] SORT_1 var_14_arg_1 = state_12; [L94] SORT_5 var_14 = var_14_arg_0 == var_14_arg_1; [L95] SORT_5 var_18_arg_0 = var_14; [L96] SORT_5 var_18 = ~var_18_arg_0; [L97] SORT_5 var_19_arg_0 = var_17; [L98] SORT_5 var_19_arg_1 = var_18; VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_19_arg_0=1, var_19_arg_1=-2, var_29=0, var_75=1, var_9=0] [L99] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L99] SORT_5 var_19 = var_19_arg_0 & var_19_arg_1; [L100] EXPR var_19 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_21=0, state_23=0, state_25=0, state_30=0, state_32=0, state_34=0, state_36=0, state_39=0, state_41=0, var_17=1, var_29=0, var_75=1, var_9=0] [L100] var_19 = var_19 & mask_SORT_5 [L101] SORT_5 bad_20_arg_0 = var_19; [L102] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 1006 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 625 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 381 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 06:11:44,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.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 1ed4a8166e43af31025ed37886c26d8ffdcca7c92b59539857ec6cced7b52d7d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:11:47,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:11:47,600 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 06:11:47,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:11:47,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:11:47,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:11:47,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:11:47,641 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:11:47,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:11:47,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:11:47,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:11:47,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:11:47,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:11:47,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:11:47,648 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:11:47,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:11:47,648 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:11:47,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:11:47,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:11:47,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:11:47,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:11:47,654 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 06:11:47,654 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 06:11:47,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:11:47,655 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 06:11:47,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:11:47,655 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:11:47,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:11:47,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:11:47,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:11:47,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:11:47,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:11:47,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:11:47,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:11:47,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:11:47,666 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 06:11:47,666 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 06:11:47,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:11:47,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:11:47,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:11:47,667 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:11:47,668 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 06:11:47,668 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 -> 1ed4a8166e43af31025ed37886c26d8ffdcca7c92b59539857ec6cced7b52d7d [2024-10-14 06:11:48,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:11:48,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:11:48,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:11:48,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:11:48,147 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:11:48,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c [2024-10-14 06:11:50,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:11:50,529 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:11:50,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c [2024-10-14 06:11:50,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d575700/12695a5bb12846fc8519edb6123f411b/FLAGb183876cd [2024-10-14 06:11:50,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33d575700/12695a5bb12846fc8519edb6123f411b [2024-10-14 06:11:50,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:11:50,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:11:50,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:11:50,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:11:50,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:11:50,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:11:50" (1/1) ... [2024-10-14 06:11:50,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410b8d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:50, skipping insertion in model container [2024-10-14 06:11:50,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:11:50" (1/1) ... [2024-10-14 06:11:50,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:11:50,921 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c[1249,1262] [2024-10-14 06:11:51,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:11:51,073 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:11:51,087 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c[1249,1262] [2024-10-14 06:11:51,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:11:51,162 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:11:51,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51 WrapperNode [2024-10-14 06:11:51,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:11:51,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:11:51,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:11:51,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:11:51,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,245 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 248 [2024-10-14 06:11:51,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:11:51,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:11:51,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:11:51,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:11:51,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,295 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 06:11:51,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:11:51,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:11:51,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:11:51,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:11:51,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (1/1) ... [2024-10-14 06:11:51,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:11:51,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:11:51,390 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-10-14 06:11:51,407 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-10-14 06:11:51,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:11:51,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 06:11:51,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:11:51,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:11:51,590 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:11:51,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:11:51,882 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-10-14 06:11:51,882 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:11:51,925 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:11:51,925 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:11:51,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:51 BoogieIcfgContainer [2024-10-14 06:11:51,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:11:51,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:11:51,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:11:51,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:11:51,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:11:50" (1/3) ... [2024-10-14 06:11:51,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcbdc09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:11:51, skipping insertion in model container [2024-10-14 06:11:51,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:51" (2/3) ... [2024-10-14 06:11:51,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bcbdc09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:11:51, skipping insertion in model container [2024-10-14 06:11:51,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:51" (3/3) ... [2024-10-14 06:11:51,937 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v4.c [2024-10-14 06:11:51,955 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:11:51,956 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:11:52,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:11:52,032 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;@40c90459, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:11:52,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:11:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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-10-14 06:11:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 06:11:52,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:52,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 06:11:52,046 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:52,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:52,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 06:11:52,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:11:52,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643260084] [2024-10-14 06:11:52,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:52,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:11:52,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:11:52,074 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-10-14 06:11:52,079 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-10-14 06:11:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:52,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 06:11:52,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:11:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:52,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:11:52,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:11:52,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643260084] [2024-10-14 06:11:52,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643260084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:11:52,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:11:52,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 06:11:52,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720209179] [2024-10-14 06:11:52,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:11:52,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:11:52,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:11:52,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:11:52,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:52,472 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-10-14 06:11:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:52,516 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-14 06:11:52,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:11:52,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-14 06:11:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:52,526 INFO L225 Difference]: With dead ends: 14 [2024-10-14 06:11:52,527 INFO L226 Difference]: Without dead ends: 8 [2024-10-14 06:11:52,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:52,536 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 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-10-14 06:11:52,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:11:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-14 06:11:52,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-14 06:11:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 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-10-14 06:11:52,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 06:11:52,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 06:11:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:52,567 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 06:11:52,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-10-14 06:11:52,568 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 06:11:52,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 06:11:52,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:52,569 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 06:11:52,577 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-10-14 06:11:52,772 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-10-14 06:11:52,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:52,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 06:11:52,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:11:52,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008175408] [2024-10-14 06:11:52,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:52,776 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:11:52,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:11:52,780 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-10-14 06:11:52,805 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-10-14 06:11:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:52,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 06:11:52,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:11:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:53,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:11:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:11:58,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:11:58,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008175408] [2024-10-14 06:11:58,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008175408] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:11:58,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 06:11:58,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 06:11:58,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613659642] [2024-10-14 06:11:58,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 06:11:58,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:11:58,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:11:58,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:11:58,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-10-14 06:11:58,531 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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-10-14 06:11:59,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:59,220 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-14 06:11:59,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:11:59,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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 7 [2024-10-14 06:11:59,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:59,223 INFO L225 Difference]: With dead ends: 13 [2024-10-14 06:11:59,224 INFO L226 Difference]: Without dead ends: 11 [2024-10-14 06:11:59,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2024-10-14 06:11:59,227 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 06:11:59,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 06:11:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-14 06:11:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-14 06:11:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-10-14 06:11:59,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 06:11:59,232 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 06:11:59,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:59,233 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 06:11:59,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 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-10-14 06:11:59,233 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 06:11:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 06:11:59,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:59,233 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 06:11:59,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 06:11:59,444 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-10-14 06:11:59,445 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:59,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:59,447 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 06:11:59,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:11:59,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665419540] [2024-10-14 06:11:59,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 06:11:59,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:11:59,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:11:59,455 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-10-14 06:11:59,458 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-10-14 06:11:59,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 06:11:59,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 06:11:59,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 06:11:59,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:12:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:12:02,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:12:14,549 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse26 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|)) (.cse28 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_21~0#1|)) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_75~0#1|))) (let ((.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse3)))) (.cse25 (forall ((|v_ULTIMATE.start_main_~var_19_arg_0~0#1_21| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_0~0#1_21|)))) .cse26))))) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_25~0#1|)))) (.cse8 (= ((_ extract 7 0) (bvand .cse26 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_30~0#1|))))) (_ bv0 8))) (.cse29 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_23~0#1|)) (.cse27 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_9~0#1|)))) (.cse13 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse26 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_29~0#1|)))))))) (let ((.cse16 (not .cse13)) (.cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse27) .cse27)))))))) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 .cse29)))))))) (.cse18 (not .cse8)) (.cse20 (bvneg .cse6)) (.cse12 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|)))) .cse3)) .cse25)) (.cse21 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse28 (bvneg .cse29))))))))) (.cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_39~0#1|)))))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul (_ bv2 32) .cse27)))))))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) .cse27))) (.cse7 (forall ((|v_ULTIMATE.start_main_~var_19_arg_0~0#1_21| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_19_arg_0~0#1_21|)))) .cse26))))) (.cse0 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|)))) .cse3))) .cse25))) (and (or (and .cse0 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse2 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse2))) .cse3)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 .cse6))))))) .cse2))))))) .cse7)) .cse8) (or (and (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse10))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse10)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse10))) .cse3))))) .cse12) .cse13) (or (and (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 .cse15))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse15)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse15))) .cse3))))) .cse12) .cse16) (or .cse16 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse17))) .cse3)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse14 .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse17))))))) .cse7) .cse0)) (or .cse18 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse19))) .cse3)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse5 .cse20))))))) .cse19))))))) .cse7) .cse0)) (or .cse18 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse20 .cse21))))))) .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse4)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse22))) .cse3)))) .cse7) .cse12)) (or (and .cse12 (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse21 .cse6))))))) .cse23))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse4)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse23))) .cse3)))))) .cse8) (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse24))) .cse3)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 .cse24))))))) .cse7) .cse0) .cse13))))) is different from false [2024-10-14 06:12:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-10-14 06:12:27,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:12:27,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665419540] [2024-10-14 06:12:27,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665419540] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:12:27,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 06:12:27,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-14 06:12:27,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833543300] [2024-10-14 06:12:27,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 06:12:27,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 06:12:27,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:12:27,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 06:12:27,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-10-14 06:12:27,279 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:12:41,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:12:41,990 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-10-14 06:12:41,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 06:12:41,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 06:12:41,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:12:41,992 INFO L225 Difference]: With dead ends: 16 [2024-10-14 06:12:41,992 INFO L226 Difference]: Without dead ends: 14 [2024-10-14 06:12:41,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=55, Invalid=130, Unknown=1, NotChecked=24, Total=210 [2024-10-14 06:12:41,994 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:12:41,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 8 Unchecked, 1.1s Time] [2024-10-14 06:12:41,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-14 06:12:41,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-14 06:12:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-10-14 06:12:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-14 06:12:41,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2024-10-14 06:12:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:12:41,999 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-14 06:12:41,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:12:41,999 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-14 06:12:42,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 06:12:42,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:12:42,000 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-14 06:12:42,006 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-10-14 06:12:42,201 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-10-14 06:12:42,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:12:42,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:12:42,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 3 times [2024-10-14 06:12:42,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:12:42,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296486216] [2024-10-14 06:12:42,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 06:12:42,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 06:12:42,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:12:42,207 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-10-14 06:12:42,209 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-10-14 06:12:42,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-14 06:12:42,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 06:12:42,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 06:12:42,495 INFO L278 TraceCheckSpWp]: Computing forward predicates...