./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_v6.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_v6.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 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:11:50,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:11:50,908 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:50,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:11:50,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:11:50,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:11:50,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:11:50,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:11:50,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:11:50,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:11:50,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:11:50,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:11:50,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:11:50,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:11:50,970 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:11:50,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:11:50,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:11:50,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 06:11:50,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:11:50,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:11:50,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:11:50,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:11:50,974 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:11:50,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:11:50,974 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:11:50,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:11:50,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:11:50,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:11:50,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:11:50,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:11:50,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:11:50,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:11:50,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:11:50,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 06:11:50,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 06:11:50,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:11:50,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:11:50,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:11:50,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:11:50,979 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 -> 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb [2024-10-14 06:11:51,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:11:51,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:11:51,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:11:51,295 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:11:51,297 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:11:51,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c [2024-10-14 06:11:52,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:11:53,197 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:11:53,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c [2024-10-14 06:11:53,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ea03d41/af7e94c472f74654b4d68644aed0cf10/FLAG9294cb518 [2024-10-14 06:11:53,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ea03d41/af7e94c472f74654b4d68644aed0cf10 [2024-10-14 06:11:53,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:11:53,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:11:53,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:11:53,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:11:53,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:11:53,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:11:53" (1/1) ... [2024-10-14 06:11:53,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5530a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:53, skipping insertion in model container [2024-10-14 06:11:53,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:11:53" (1/1) ... [2024-10-14 06:11:53,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:11:53,501 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_v6.c[1249,1262] [2024-10-14 06:11:53,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:11:53,651 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:11:53,664 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_v6.c[1249,1262] [2024-10-14 06:11:53,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:11:53,756 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:11:53,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:53 WrapperNode [2024-10-14 06:11:53,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:11:53,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:11:53,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:11:53,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:11:53,767 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:53" (1/1) ... [2024-10-14 06:11:53,792 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:53" (1/1) ... [2024-10-14 06:11:53,897 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 599 [2024-10-14 06:11:53,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:11:53,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:11:53,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:11:53,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:11:53,911 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:53" (1/1) ... [2024-10-14 06:11:53,912 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:53" (1/1) ... [2024-10-14 06:11:53,933 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:53" (1/1) ... [2024-10-14 06:11:53,971 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:53,971 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:53" (1/1) ... [2024-10-14 06:11:53,971 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:53" (1/1) ... [2024-10-14 06:11:54,004 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:53" (1/1) ... [2024-10-14 06:11:54,010 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:53" (1/1) ... [2024-10-14 06:11:54,021 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:53" (1/1) ... [2024-10-14 06:11:54,030 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:53" (1/1) ... [2024-10-14 06:11:54,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:11:54,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:11:54,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:11:54,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:11:54,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:53" (1/1) ... [2024-10-14 06:11:54,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:11:54,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:11:54,087 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:54,091 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:54,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:11:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 06:11:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:11:54,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:11:54,282 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:11:54,284 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:11:55,229 INFO L? ?]: Removed 260 outVars from TransFormulas that were not future-live. [2024-10-14 06:11:55,229 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:11:55,272 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:11:55,272 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:11:55,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:55 BoogieIcfgContainer [2024-10-14 06:11:55,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:11:55,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:11:55,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:11:55,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:11:55,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:11:53" (1/3) ... [2024-10-14 06:11:55,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b29a4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:11:55, skipping insertion in model container [2024-10-14 06:11:55,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:11:53" (2/3) ... [2024-10-14 06:11:55,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b29a4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:11:55, skipping insertion in model container [2024-10-14 06:11:55,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:11:55" (3/3) ... [2024-10-14 06:11:55,287 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v6.c [2024-10-14 06:11:55,308 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:11:55,309 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:11:55,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:11:55,405 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;@340d7921, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:11:55,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:11:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 125 states have (on average 1.504) internal successors, (188), 126 states have internal predecessors, (188), 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:55,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 06:11:55,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:55,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:11:55,427 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:55,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:55,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1944067544, now seen corresponding path program 1 times [2024-10-14 06:11:55,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:55,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826802460] [2024-10-14 06:11:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:55,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:56,356 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:56,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:11:56,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826802460] [2024-10-14 06:11:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826802460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:11:56,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:11:56,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:11:56,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983927262] [2024-10-14 06:11:56,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:11:56,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:11:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:11:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:11:56,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:56,446 INFO L87 Difference]: Start difference. First operand has 127 states, 125 states have (on average 1.504) internal successors, (188), 126 states have internal predecessors, (188), 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 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:56,519 INFO L93 Difference]: Finished difference Result 174 states and 258 transitions. [2024-10-14 06:11:56,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:11:56,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2024-10-14 06:11:56,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:56,534 INFO L225 Difference]: With dead ends: 174 [2024-10-14 06:11:56,535 INFO L226 Difference]: Without dead ends: 128 [2024-10-14 06:11:56,539 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:56,546 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 544 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:56,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 544 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:56,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-14 06:11:56,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-14 06:11:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.4803149606299213) internal successors, (188), 127 states have internal predecessors, (188), 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:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 188 transitions. [2024-10-14 06:11:56,601 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 188 transitions. Word has length 54 [2024-10-14 06:11:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:56,602 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 188 transitions. [2024-10-14 06:11:56,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 188 transitions. [2024-10-14 06:11:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 06:11:56,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:56,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:11:56,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 06:11:56,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:56,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash 138247198, now seen corresponding path program 1 times [2024-10-14 06:11:56,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:56,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678242538] [2024-10-14 06:11:56,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:56,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:56,890 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:56,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:11:56,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678242538] [2024-10-14 06:11:56,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678242538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:11:56,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:11:56,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:11:56,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178125361] [2024-10-14 06:11:56,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:11:56,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:11:56,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:11:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:11:56,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:56,895 INFO L87 Difference]: Start difference. First operand 128 states and 188 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:56,943 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2024-10-14 06:11:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:11:56,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-10-14 06:11:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:56,949 INFO L225 Difference]: With dead ends: 177 [2024-10-14 06:11:56,949 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 06:11:56,950 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:56,951 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 541 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:56,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 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:56,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 06:11:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-14 06:11:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 129 states have internal predecessors, (190), 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:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 190 transitions. [2024-10-14 06:11:56,974 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 190 transitions. Word has length 55 [2024-10-14 06:11:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:56,977 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 190 transitions. [2024-10-14 06:11:56,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 190 transitions. [2024-10-14 06:11:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 06:11:56,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:56,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:11:56,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 06:11:56,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:56,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:56,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1107269775, now seen corresponding path program 1 times [2024-10-14 06:11:56,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:56,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860196769] [2024-10-14 06:11:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:56,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:11:57,372 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:57,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:11:57,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860196769] [2024-10-14 06:11:57,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860196769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:11:57,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:11:57,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 06:11:57,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448832621] [2024-10-14 06:11:57,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:11:57,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:11:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:11:57,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:11:57,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:11:57,380 INFO L87 Difference]: Start difference. First operand 130 states and 190 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 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:57,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:11:57,446 INFO L93 Difference]: Finished difference Result 179 states and 259 transitions. [2024-10-14 06:11:57,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:11:57,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-14 06:11:57,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:11:57,453 INFO L225 Difference]: With dead ends: 179 [2024-10-14 06:11:57,454 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 06:11:57,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:57,456 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 139 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:11:57,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 353 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:11:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 06:11:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2024-10-14 06:11:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.4651162790697674) internal successors, (189), 129 states have internal predecessors, (189), 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:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 189 transitions. [2024-10-14 06:11:57,475 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 189 transitions. Word has length 56 [2024-10-14 06:11:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:11:57,476 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 189 transitions. [2024-10-14 06:11:57,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 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:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 189 transitions. [2024-10-14 06:11:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 06:11:57,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:11:57,478 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, 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:57,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 06:11:57,479 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:11:57,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:11:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1598920769, now seen corresponding path program 1 times [2024-10-14 06:11:57,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:11:57,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080578528] [2024-10-14 06:11:57,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:11:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:11:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:11:57,571 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 06:11:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:11:57,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 06:11:57,673 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 06:11:57,674 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 06:11:57,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 06:11:57,679 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 06:11:57,749 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 06:11:57,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:11:57 BoogieIcfgContainer [2024-10-14 06:11:57,756 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 06:11:57,757 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 06:11:57,757 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 06:11:57,757 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 06:11:57,758 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:55" (3/4) ... [2024-10-14 06:11:57,760 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 06:11:57,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 06:11:57,766 INFO L158 Benchmark]: Toolchain (without parser) took 4531.15ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 125.7MB in the beginning and 224.1MB in the end (delta: -98.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:11:57,767 INFO L158 Benchmark]: CDTParser took 0.83ms. Allocated memory is still 184.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:11:57,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.65ms. Allocated memory is still 184.5MB. Free memory was 125.3MB in the beginning and 105.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 06:11:57,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.52ms. Allocated memory is still 184.5MB. Free memory was 105.8MB in the beginning and 93.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 06:11:57,767 INFO L158 Benchmark]: Boogie Preprocessor took 145.55ms. Allocated memory is still 184.5MB. Free memory was 93.3MB in the beginning and 85.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 06:11:57,768 INFO L158 Benchmark]: RCFGBuilder took 1228.87ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 85.0MB in the beginning and 199.6MB in the end (delta: -114.6MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2024-10-14 06:11:57,768 INFO L158 Benchmark]: TraceAbstraction took 2479.13ms. Allocated memory is still 274.7MB. Free memory was 198.6MB in the beginning and 224.1MB in the end (delta: -25.5MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. [2024-10-14 06:11:57,768 INFO L158 Benchmark]: Witness Printer took 8.61ms. Allocated memory is still 274.7MB. Free memory is still 224.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:11:57,774 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.83ms. Allocated memory is still 184.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.65ms. Allocated memory is still 184.5MB. Free memory was 125.3MB in the beginning and 105.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.52ms. Allocated memory is still 184.5MB. Free memory was 105.8MB in the beginning and 93.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 145.55ms. Allocated memory is still 184.5MB. Free memory was 93.3MB in the beginning and 85.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1228.87ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 85.0MB in the beginning and 199.6MB in the end (delta: -114.6MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2479.13ms. Allocated memory is still 274.7MB. Free memory was 198.6MB in the beginning and 224.1MB in the end (delta: -25.5MB). Peak memory consumption was 124.4MB. Max. memory is 16.1GB. * Witness Printer took 8.61ms. Allocated memory is still 274.7MB. Free memory is still 224.1MB. 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 155. 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_22 = 0; [L34] const SORT_5 var_31 = 1; [L35] const SORT_1 var_109 = 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_35; [L44] SORT_5 input_37; [L45] SORT_5 input_39; [L46] SORT_5 input_51; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L48] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L49] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L50] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L51] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L52] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L53] SORT_5 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L54] SORT_5 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L55] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L56] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L57] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L58] SORT_5 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L59] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L60] SORT_5 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L61] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L62] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L63] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L64] SORT_1 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L65] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L66] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L67] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] SORT_1 init_11_arg_1 = var_9; [L70] state_10 = init_11_arg_1 [L71] SORT_1 init_13_arg_1 = var_9; [L72] state_12 = init_13_arg_1 [L73] SORT_1 init_19_arg_1 = var_9; [L74] state_18 = init_19_arg_1 [L75] SORT_5 init_24_arg_1 = var_22; [L76] state_23 = init_24_arg_1 [L77] SORT_1 init_27_arg_1 = var_9; [L78] state_26 = init_27_arg_1 [L79] SORT_5 init_42_arg_1 = var_22; [L80] state_41 = init_42_arg_1 [L81] SORT_5 init_44_arg_1 = var_22; [L82] state_43 = init_44_arg_1 [L83] SORT_1 init_46_arg_1 = var_9; [L84] state_45 = init_46_arg_1 [L85] SORT_1 init_48_arg_1 = var_9; [L86] state_47 = init_48_arg_1 [L87] SORT_1 init_50_arg_1 = var_9; [L88] state_49 = init_50_arg_1 [L89] SORT_5 init_54_arg_1 = var_22; [L90] state_53 = init_54_arg_1 [L91] SORT_1 init_56_arg_1 = var_9; [L92] state_55 = init_56_arg_1 [L93] SORT_5 init_58_arg_1 = var_22; [L94] state_57 = init_58_arg_1 [L95] SORT_1 init_60_arg_1 = var_9; [L96] state_59 = init_60_arg_1 [L97] SORT_1 init_63_arg_1 = var_9; [L98] state_62 = init_63_arg_1 [L99] SORT_1 init_65_arg_1 = var_9; [L100] state_64 = init_65_arg_1 [L101] SORT_1 init_67_arg_1 = var_9; [L102] state_66 = init_67_arg_1 [L103] SORT_1 init_69_arg_1 = var_9; [L104] state_68 = init_69_arg_1 [L105] SORT_1 init_71_arg_1 = var_9; [L106] state_70 = init_71_arg_1 [L107] SORT_1 init_73_arg_1 = var_9; [L108] state_72 = init_73_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L111] input_2 = __VERIFIER_nondet_uchar() [L112] input_3 = __VERIFIER_nondet_uchar() [L113] input_4 = __VERIFIER_nondet_uchar() [L114] input_6 = __VERIFIER_nondet_uchar() [L115] input_7 = __VERIFIER_nondet_uchar() [L116] input_8 = __VERIFIER_nondet_uchar() [L117] EXPR input_8 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L117] input_8 = input_8 & mask_SORT_5 [L118] input_35 = __VERIFIER_nondet_uchar() [L119] input_37 = __VERIFIER_nondet_uchar() [L120] input_39 = __VERIFIER_nondet_uchar() [L121] input_51 = __VERIFIER_nondet_uchar() [L124] SORT_1 var_16_arg_0 = state_10; [L125] SORT_5 var_16 = var_16_arg_0 >> 0; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_16=0, var_22=0, var_31=1, var_9=0] [L126] EXPR var_16 & mask_SORT_5 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L126] var_16 = var_16 & mask_SORT_5 [L127] SORT_1 var_15_arg_0 = state_10; [L128] SORT_1 var_15_arg_1 = state_12; [L129] SORT_1 var_15 = var_15_arg_0 + var_15_arg_1; [L130] SORT_1 var_14_arg_0 = state_10; [L131] SORT_1 var_14_arg_1 = state_12; [L132] SORT_1 var_14 = var_14_arg_0 - var_14_arg_1; [L133] SORT_5 var_17_arg_0 = var_16; [L134] SORT_1 var_17_arg_1 = var_15; [L135] SORT_1 var_17_arg_2 = var_14; [L136] SORT_1 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L137] SORT_1 var_21_arg_0 = var_17; [L138] SORT_1 var_21_arg_1 = state_18; [L139] SORT_1 var_21 = var_21_arg_0 + var_21_arg_1; [L140] SORT_1 var_20_arg_0 = var_17; [L141] SORT_1 var_20_arg_1 = state_18; [L142] SORT_1 var_20 = var_20_arg_0 - var_20_arg_1; [L143] SORT_5 var_25_arg_0 = state_23; [L144] SORT_1 var_25_arg_1 = var_21; [L145] SORT_1 var_25_arg_2 = var_20; [L146] SORT_1 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_25=0, var_31=1, var_9=0] [L147] EXPR var_25 & mask_SORT_1 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L147] var_25 = var_25 & mask_SORT_1 [L148] SORT_1 var_28_arg_0 = var_25; [L149] SORT_1 var_28_arg_1 = state_26; [L150] SORT_5 var_28 = var_28_arg_0 == var_28_arg_1; [L151] SORT_5 var_32_arg_0 = var_28; [L152] SORT_5 var_32 = ~var_32_arg_0; [L153] SORT_5 var_33_arg_0 = var_31; [L154] SORT_5 var_33_arg_1 = var_32; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-2, var_9=0] [L155] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L155] SORT_5 var_33 = var_33_arg_0 & var_33_arg_1; [L156] EXPR var_33 & mask_SORT_5 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L156] var_33 = var_33 & mask_SORT_5 [L157] SORT_5 bad_34_arg_0 = var_33; [L158] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 1438 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 895 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 543 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 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:57,824 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_v6.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 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:12:00,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:12:00,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 06:12:00,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:12:00,421 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:12:00,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:12:00,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:12:00,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:12:00,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:12:00,455 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:12:00,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:12:00,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:12:00,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:12:00,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:12:00,457 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:12:00,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:12:00,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:12:00,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:12:00,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:12:00,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:12:00,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:12:00,460 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 06:12:00,460 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 06:12:00,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:12:00,461 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 06:12:00,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:12:00,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:12:00,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:12:00,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:12:00,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:12:00,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:12:00,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:12:00,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:12:00,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:12:00,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:12:00,464 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 06:12:00,464 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 06:12:00,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:12:00,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:12:00,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:12:00,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:12:00,466 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 06:12:00,466 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 -> 2200532e3403e6f1ac3d9b38640c6756b6cab2fade9669ac03b78883e92f67bb [2024-10-14 06:12:00,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:12:00,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:12:00,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:12:00,894 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:12:00,894 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:12:00,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c [2024-10-14 06:12:02,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:12:02,961 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:12:02,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v6.c [2024-10-14 06:12:02,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d63e9ba/3bbeb92b42c741afbb8ff364486a0311/FLAGfa36693a7 [2024-10-14 06:12:03,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d63e9ba/3bbeb92b42c741afbb8ff364486a0311 [2024-10-14 06:12:03,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:12:03,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:12:03,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:12:03,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:12:03,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:12:03,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:03,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f8146f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03, skipping insertion in model container [2024-10-14 06:12:03,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:03,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:12:03,542 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_v6.c[1249,1262] [2024-10-14 06:12:03,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:12:03,666 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:12:03,695 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_v6.c[1249,1262] [2024-10-14 06:12:03,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:12:03,822 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:12:03,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03 WrapperNode [2024-10-14 06:12:03,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:12:03,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:12:03,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:12:03,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:12:03,834 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:12:03" (1/1) ... [2024-10-14 06:12:03,855 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:12:03" (1/1) ... [2024-10-14 06:12:03,924 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 359 [2024-10-14 06:12:03,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:12:03,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:12:03,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:12:03,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:12:03,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:03,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:03,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:03,992 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:12:03,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:03,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:04,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:04,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:04,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:04,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:04,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:12:04,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:12:04,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:12:04,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:12:04,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03" (1/1) ... [2024-10-14 06:12:04,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:12:04,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:12:04,071 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:12:04,074 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:12:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:12:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 06:12:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:12:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:12:04,241 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:12:04,243 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:12:04,683 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2024-10-14 06:12:04,687 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:12:04,761 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:12:04,761 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:12:04,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:12:04 BoogieIcfgContainer [2024-10-14 06:12:04,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:12:04,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:12:04,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:12:04,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:12:04,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:12:03" (1/3) ... [2024-10-14 06:12:04,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75518253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:12:04, skipping insertion in model container [2024-10-14 06:12:04,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:12:03" (2/3) ... [2024-10-14 06:12:04,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75518253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:12:04, skipping insertion in model container [2024-10-14 06:12:04,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:12:04" (3/3) ... [2024-10-14 06:12:04,775 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v6.c [2024-10-14 06:12:04,798 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:12:04,799 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:12:04,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:12:04,881 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;@14c90bb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:12:04,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:12:04,886 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:12:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 06:12:04,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:12:04,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 06:12:04,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:12:04,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:12:04,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 06:12:04,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:12:04,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754637439] [2024-10-14 06:12:04,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:12:04,919 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:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:12:04,923 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:12:04,925 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:12:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:12:05,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 06:12:05,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:12:05,534 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:12:05,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:12:05,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:12:05,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754637439] [2024-10-14 06:12:05,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754637439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:12:05,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:12:05,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 06:12:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239951519] [2024-10-14 06:12:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:12:05,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:12:05,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:12:05,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:12:05,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:12:05,578 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:12:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:12:05,630 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2024-10-14 06:12:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:12:05,634 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:12:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:12:05,641 INFO L225 Difference]: With dead ends: 14 [2024-10-14 06:12:05,641 INFO L226 Difference]: Without dead ends: 8 [2024-10-14 06:12:05,644 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:12:05,649 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:12:05,650 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:12:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-10-14 06:12:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-10-14 06:12:05,681 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:12:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 06:12:05,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 06:12:05,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:12:05,683 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 06:12:05,683 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:12:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 06:12:05,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 06:12:05,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:12:05,684 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 06:12:05,694 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:12:05,885 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:12:05,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:12:05,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:12:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 06:12:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:12:05,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795489491] [2024-10-14 06:12:05,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:12:05,888 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:05,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:12:05,903 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:12:05,905 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:12:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:12:06,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-14 06:12:06,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:12:06,677 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:12:06,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:12:14,383 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse40 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse8 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_16|) (_ bv254 32)))) .cse40))))) (.cse6 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_16| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_16|) (_ bv255 32)))) .cse40)) (_ bv0 8)))) (.cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_9~0#1|)))) (.cse41 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_22~0#1|))) .cse40)))) (.cse29 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_64~0#1|))))) (let ((.cse15 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse40 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_43~0#1|))))))) (.cse11 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_72~0#1|))))) (.cse14 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse40 ((_ zero_extend 24) ((_ extract 7 0) .cse29)))))) (.cse36 (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (not (let ((.cse42 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse42))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse42))))))) .cse8) (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse43 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse43))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse43)))))))) .cse41)) (.cse34 (bvneg .cse30)) (.cse35 (not .cse41)) (.cse37 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse30)) .cse40)) (_ bv0 8)))) (let ((.cse20 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_57~0#1|)) (.cse0 (or (and .cse36 (or (and (or .cse6 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse38 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse38))))))) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse39 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse39 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse39))))))) .cse8)) .cse35)) .cse37)) (.cse1 (or (and (or (let ((.cse32 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse30))))) .cse34))))))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse31 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse31))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse31)))))) .cse6) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse33 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse33))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse32 .cse33))))))) .cse8))) .cse35) .cse36) (not .cse37))) (.cse2 (not .cse14)) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse29 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_68~0#1|))))))))))))))) (.cse9 (not .cse15)) (.cse19 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_59~0#1|)) (.cse18 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_55~0#1|))) (and (or (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 .cse19))))))))) (let ((.cse10 (or .cse15 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (not (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse16))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse16))))))) .cse8) (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse17))))))))))) (and .cse0 .cse1 (or .cse2 (and (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse4)))))) .cse6) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse7 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse7))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse7))))))) .cse8)) .cse9) .cse10)) (or (and .cse10 (or .cse9 (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse12))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse12)))))) .cse6) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse13 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse13))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse13))))))) .cse8)))) .cse14)))) .cse20) (or (not .cse20) (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (bvneg .cse18)))))))))) (let ((.cse21 (or .cse15 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (not (let ((.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse27))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse27))))))) .cse8) (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse28))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse28))))))))))) (and .cse0 (or (and .cse21 (or (and (or .cse6 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse22))))))) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse24))))))) .cse8)) .cse9)) .cse14) .cse1 (or .cse2 (and .cse21 (or (and (or .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse25))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse25))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse26))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse26))))))) .cse8)) .cse9)))))))))))) is different from false [2024-10-14 06:12:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 06:12:21,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:12:21,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795489491] [2024-10-14 06:12:21,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795489491] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:12:21,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 06:12:21,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 06:12:21,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614147524] [2024-10-14 06:12:21,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 06:12:21,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:12:21,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:12:21,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:12:21,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2024-10-14 06:12:21,603 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:12:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:12:23,323 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-14 06:12:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:12:23,324 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:12:23,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:12:23,325 INFO L225 Difference]: With dead ends: 13 [2024-10-14 06:12:23,325 INFO L226 Difference]: Without dead ends: 11 [2024-10-14 06:12:23,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2024-10-14 06:12:23,328 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 06:12:23,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 5 Unchecked, 0.4s Time] [2024-10-14 06:12:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-14 06:12:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-14 06:12:23,334 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:12:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 06:12:23,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 06:12:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:12:23,336 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 06:12:23,336 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:12:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 06:12:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 06:12:23,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:12:23,338 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 06:12:23,345 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:12:23,538 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:12:23,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:12:23,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:12:23,541 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 06:12:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:12:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699369798] [2024-10-14 06:12:23,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 06:12:23,542 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:23,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:12:23,549 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:12:23,551 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:12:23,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 06:12:23,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 06:12:23,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-14 06:12:23,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:12:29,721 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:29,722 INFO L311 TraceCheckSpWp]: Computing backward predicates...