./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.swap_two.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_two.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3d80a08c66b9b1eadaab4dbad5179d13f0d2ba2cc2da58b84f0d125081ac09c4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:51:32,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:51:32,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 06:51:32,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:51:32,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:51:32,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:51:32,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:51:32,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:51:32,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:51:32,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:51:32,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:51:32,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:51:32,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:51:32,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:51:32,894 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:51:32,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:51:32,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:51:32,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 06:51:32,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:51:32,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:51:32,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:51:32,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:51:32,899 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:51:32,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:51:32,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:51:32,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:51:32,900 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:51:32,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:51:32,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:51:32,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:51:32,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:51:32,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:51:32,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:51:32,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 06:51:32,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 06:51:32,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:51:32,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:51:32,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:51:32,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:51:32,904 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-clean/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-clean/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 -> 3d80a08c66b9b1eadaab4dbad5179d13f0d2ba2cc2da58b84f0d125081ac09c4 [2024-10-11 06:51:33,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:51:33,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:51:33,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:51:33,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:51:33,208 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:51:33,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_two.c [2024-10-11 06:51:34,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:51:34,858 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:51:34,860 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_two.c [2024-10-11 06:51:34,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2e2d72cdc/f9e579c38c65455884d4ef1dfcf67b89/FLAG5a32251fb [2024-10-11 06:51:34,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2e2d72cdc/f9e579c38c65455884d4ef1dfcf67b89 [2024-10-11 06:51:34,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:51:34,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:51:34,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:51:34,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:51:34,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:51:34,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:51:34" (1/1) ... [2024-10-11 06:51:34,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a61b241 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:34, skipping insertion in model container [2024-10-11 06:51:34,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:51:34" (1/1) ... [2024-10-11 06:51:34,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:51:35,131 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.swap_two.c[1248,1261] [2024-10-11 06:51:35,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:51:35,189 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:51:35,202 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.swap_two.c[1248,1261] [2024-10-11 06:51:35,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:51:35,243 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:51:35,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35 WrapperNode [2024-10-11 06:51:35,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:51:35,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:51:35,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:51:35,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:51:35,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,297 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 131 [2024-10-11 06:51:35,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:51:35,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:51:35,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:51:35,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:51:35,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,344 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-11 06:51:35,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:51:35,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:51:35,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:51:35,376 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:51:35,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (1/1) ... [2024-10-11 06:51:35,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:51:35,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:51:35,420 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:51:35,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:51:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:51:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 06:51:35,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:51:35,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:51:35,552 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:51:35,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:51:35,830 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-10-11 06:51:35,831 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:51:35,881 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:51:35,881 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:51:35,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:51:35 BoogieIcfgContainer [2024-10-11 06:51:35,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:51:35,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:51:35,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:51:35,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:51:35,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:51:34" (1/3) ... [2024-10-11 06:51:35,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee091f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:51:35, skipping insertion in model container [2024-10-11 06:51:35,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:35" (2/3) ... [2024-10-11 06:51:35,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee091f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:51:35, skipping insertion in model container [2024-10-11 06:51:35,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:51:35" (3/3) ... [2024-10-11 06:51:35,895 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.swap_two.c [2024-10-11 06:51:35,913 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:51:35,913 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:51:35,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:51:35,972 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;@3f8487c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:51:35,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:51:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:51:35,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 06:51:35,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:51:35,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:51:35,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:51:35,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:51:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash 252141901, now seen corresponding path program 1 times [2024-10-11 06:51:36,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:51:36,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206661994] [2024-10-11 06:51:36,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:51:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:51:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:51:36,646 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-11 06:51:36,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:51:36,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206661994] [2024-10-11 06:51:36,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206661994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:51:36,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:51:36,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:51:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929881435] [2024-10-11 06:51:36,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:51:36,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:51:36,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:51:36,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:51:36,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:51:36,687 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 34 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-11 06:51:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:51:36,742 INFO L93 Difference]: Finished difference Result 62 states and 90 transitions. [2024-10-11 06:51:36,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:51:36,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-10-11 06:51:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:51:36,753 INFO L225 Difference]: With dead ends: 62 [2024-10-11 06:51:36,753 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 06:51:36,755 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-11 06:51:36,758 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 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-11 06:51:36,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:51:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 06:51:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 06:51:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:51:36,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2024-10-11 06:51:36,786 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 18 [2024-10-11 06:51:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:51:36,787 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2024-10-11 06:51:36,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-11 06:51:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2024-10-11 06:51:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 06:51:36,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:51:36,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:51:36,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 06:51:36,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:51:36,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:51:36,790 INFO L85 PathProgramCache]: Analyzing trace with hash -771840417, now seen corresponding path program 1 times [2024-10-11 06:51:36,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:51:36,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694090828] [2024-10-11 06:51:36,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:51:36,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:51:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:51:36,960 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-11 06:51:36,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:51:36,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694090828] [2024-10-11 06:51:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694090828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:51:36,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:51:36,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:51:36,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110320899] [2024-10-11 06:51:36,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:51:36,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:51:36,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:51:36,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:51:36,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:51:36,966 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:51:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:51:37,003 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2024-10-11 06:51:37,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:51:37,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 06:51:37,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:51:37,005 INFO L225 Difference]: With dead ends: 65 [2024-10-11 06:51:37,005 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 06:51:37,005 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-11 06:51:37,007 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 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-11 06:51:37,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:51:37,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 06:51:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-11 06:51:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 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-11 06:51:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2024-10-11 06:51:37,014 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 19 [2024-10-11 06:51:37,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:51:37,015 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2024-10-11 06:51:37,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:51:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2024-10-11 06:51:37,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 06:51:37,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:51:37,017 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] [2024-10-11 06:51:37,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 06:51:37,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:51:37,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:51:37,020 INFO L85 PathProgramCache]: Analyzing trace with hash 744784998, now seen corresponding path program 1 times [2024-10-11 06:51:37,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:51:37,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577334301] [2024-10-11 06:51:37,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:51:37,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:51:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:51:37,365 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-11 06:51:37,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:51:37,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577334301] [2024-10-11 06:51:37,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577334301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:51:37,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:51:37,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:51:37,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327658471] [2024-10-11 06:51:37,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:51:37,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:51:37,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:51:37,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:51:37,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:51:37,372 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11 06:51:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:51:37,511 INFO L93 Difference]: Finished difference Result 96 states and 130 transitions. [2024-10-11 06:51:37,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:51:37,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-10-11 06:51:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:51:37,513 INFO L225 Difference]: With dead ends: 96 [2024-10-11 06:51:37,513 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 06:51:37,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:51:37,515 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 43 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:51:37,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 92 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:51:37,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 06:51:37,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 40. [2024-10-11 06:51:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 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-11 06:51:37,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-10-11 06:51:37,525 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 20 [2024-10-11 06:51:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:51:37,525 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-10-11 06:51:37,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11 06:51:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-10-11 06:51:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 06:51:37,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:51:37,530 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] [2024-10-11 06:51:37,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 06:51:37,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:51:37,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:51:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 442119060, now seen corresponding path program 1 times [2024-10-11 06:51:37,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:51:37,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255898947] [2024-10-11 06:51:37,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:51:37,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:51:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:51:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 06:51:37,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:51:37,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255898947] [2024-10-11 06:51:37,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255898947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:51:37,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:51:37,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:51:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763198597] [2024-10-11 06:51:37,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:51:37,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:51:37,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:51:37,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:51:37,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:51:37,747 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-11 06:51:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:51:37,842 INFO L93 Difference]: Finished difference Result 96 states and 129 transitions. [2024-10-11 06:51:37,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:51:37,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2024-10-11 06:51:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:51:37,844 INFO L225 Difference]: With dead ends: 96 [2024-10-11 06:51:37,846 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 06:51:37,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:51:37,847 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 68 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:51:37,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 127 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:51:37,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 06:51:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2024-10-11 06:51:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 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-11 06:51:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2024-10-11 06:51:37,859 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 21 [2024-10-11 06:51:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:51:37,859 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2024-10-11 06:51:37,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 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-11 06:51:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2024-10-11 06:51:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 06:51:37,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:51:37,861 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] [2024-10-11 06:51:37,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 06:51:37,862 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:51:37,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:51:37,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1874845983, now seen corresponding path program 1 times [2024-10-11 06:51:37,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:51:37,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606626283] [2024-10-11 06:51:37,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:51:37,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:51:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:51:38,105 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-11 06:51:38,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:51:38,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606626283] [2024-10-11 06:51:38,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606626283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:51:38,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:51:38,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:51:38,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728899168] [2024-10-11 06:51:38,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:51:38,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:51:38,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:51:38,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:51:38,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:51:38,111 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-11 06:51:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:51:38,277 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2024-10-11 06:51:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:51:38,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2024-10-11 06:51:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:51:38,279 INFO L225 Difference]: With dead ends: 98 [2024-10-11 06:51:38,279 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 06:51:38,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:51:38,280 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:51:38,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 116 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:51:38,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 06:51:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2024-10-11 06:51:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 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-11 06:51:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2024-10-11 06:51:38,286 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 22 [2024-10-11 06:51:38,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:51:38,287 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2024-10-11 06:51:38,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-11 06:51:38,287 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2024-10-11 06:51:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 06:51:38,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:51:38,288 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] [2024-10-11 06:51:38,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 06:51:38,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:51:38,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:51:38,289 INFO L85 PathProgramCache]: Analyzing trace with hash -996623472, now seen corresponding path program 1 times [2024-10-11 06:51:38,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:51:38,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738362347] [2024-10-11 06:51:38,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:51:38,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:51:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:51:38,473 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-11 06:51:38,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:51:38,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738362347] [2024-10-11 06:51:38,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738362347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:51:38,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:51:38,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 06:51:38,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823818090] [2024-10-11 06:51:38,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:51:38,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 06:51:38,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:51:38,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 06:51:38,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 06:51:38,476 INFO L87 Difference]: Start difference. First operand 44 states and 58 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-11 06:51:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:51:38,583 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2024-10-11 06:51:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:51:38,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-10-11 06:51:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:51:38,584 INFO L225 Difference]: With dead ends: 96 [2024-10-11 06:51:38,584 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 06:51:38,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:51:38,585 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 35 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 06:51:38,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 06:51:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 06:51:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2024-10-11 06:51:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 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-11 06:51:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2024-10-11 06:51:38,597 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 23 [2024-10-11 06:51:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:51:38,598 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2024-10-11 06:51:38,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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-11 06:51:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2024-10-11 06:51:38,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 06:51:38,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:51:38,599 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] [2024-10-11 06:51:38,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 06:51:38,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:51:38,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:51:38,599 INFO L85 PathProgramCache]: Analyzing trace with hash 610748608, now seen corresponding path program 1 times [2024-10-11 06:51:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:51:38,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387019038] [2024-10-11 06:51:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:51:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:51:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:51:38,864 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-11 06:51:38,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 06:51:38,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387019038] [2024-10-11 06:51:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387019038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:51:38,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:51:38,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 06:51:38,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774875177] [2024-10-11 06:51:38,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:51:38,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 06:51:38,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 06:51:38,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 06:51:38,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 06:51:38,868 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11 06:51:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:51:38,929 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2024-10-11 06:51:38,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 06:51:38,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2024-10-11 06:51:38,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:51:38,930 INFO L225 Difference]: With dead ends: 78 [2024-10-11 06:51:38,930 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 06:51:38,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 06:51:38,932 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 38 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:51:38,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:51:38,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 06:51:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-10-11 06:51:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 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-11 06:51:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2024-10-11 06:51:38,944 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 24 [2024-10-11 06:51:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:51:38,944 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2024-10-11 06:51:38,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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-11 06:51:38,947 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2024-10-11 06:51:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 06:51:38,947 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:51:38,948 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] [2024-10-11 06:51:38,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 06:51:38,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:51:38,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:51:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash -977084440, now seen corresponding path program 1 times [2024-10-11 06:51:38,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 06:51:38,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469644067] [2024-10-11 06:51:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:51:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 06:51:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:51:38,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 06:51:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 06:51:39,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 06:51:39,045 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 06:51:39,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:51:39,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 06:51:39,052 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 06:51:39,080 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:51:39,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:51:39 BoogieIcfgContainer [2024-10-11 06:51:39,083 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:51:39,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:51:39,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:51:39,083 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:51:39,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:51:35" (3/4) ... [2024-10-11 06:51:39,086 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 06:51:39,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:51:39,088 INFO L158 Benchmark]: Toolchain (without parser) took 4190.91ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 112.9MB in the beginning and 86.1MB in the end (delta: 26.7MB). Peak memory consumption was 92.0MB. Max. memory is 16.1GB. [2024-10-11 06:51:39,088 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:51:39,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.22ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 99.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 06:51:39,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.70ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 97.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 06:51:39,089 INFO L158 Benchmark]: Boogie Preprocessor took 67.96ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 94.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 06:51:39,089 INFO L158 Benchmark]: RCFGBuilder took 511.93ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 74.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 06:51:39,090 INFO L158 Benchmark]: TraceAbstraction took 3196.51ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 74.4MB in the beginning and 86.1MB in the end (delta: -11.8MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2024-10-11 06:51:39,090 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 230.7MB. Free memory is still 86.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:51:39,091 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.22ms. Allocated memory is still 167.8MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.22ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 99.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.70ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 97.1MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.96ms. Allocated memory is still 167.8MB. Free memory was 96.8MB in the beginning and 94.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.93ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 74.9MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3196.51ms. Allocated memory was 167.8MB in the beginning and 230.7MB in the end (delta: 62.9MB). Free memory was 74.4MB in the beginning and 86.1MB in the end (delta: -11.8MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 230.7MB. Free memory is still 86.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 76. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 20); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (20 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L35] const SORT_4 var_5 = 100; [L36] const SORT_8 var_10 = 100; [L37] const SORT_8 var_13 = 200; [L38] const SORT_1 var_18 = 1; [L39] const SORT_4 var_22 = 200; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L44] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, var_10=100, var_13=200, var_18=1, var_22=200, var_5=100] [L44] SORT_4 state_6 = __VERIFIER_nondet_uint() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uint() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, var_10=100, var_13=200, var_18=1, var_22=200, var_5=100] [L45] SORT_4 state_23 = __VERIFIER_nondet_uint() & mask_SORT_4; [L47] SORT_4 init_7_arg_1 = var_5; [L48] state_6 = init_7_arg_1 [L49] SORT_4 init_24_arg_1 = var_22; [L50] state_23 = init_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_23=200, state_6=100, var_10=100, var_13=200, var_18=1] [L53] input_2 = __VERIFIER_nondet_uchar() [L54] input_3 = __VERIFIER_nondet_uchar() [L57] SORT_4 var_9_arg_0 = state_6; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_23=200, state_6=100, var_10=100, var_13=200, var_18=1, var_9_arg_0=100] [L58] EXPR var_9_arg_0 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_23=200, state_6=100, var_10=100, var_13=200, var_18=1] [L58] var_9_arg_0 = var_9_arg_0 & mask_SORT_4 [L59] SORT_8 var_9 = var_9_arg_0; [L60] SORT_8 var_11_arg_0 = var_9; [L61] SORT_8 var_11_arg_1 = var_10; [L62] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L63] SORT_4 var_12_arg_0 = state_6; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_23=200, state_6=100, var_10=100, var_11=0, var_12_arg_0=100, var_13=200, var_18=1] [L64] EXPR var_12_arg_0 & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_23=200, state_6=100, var_10=100, var_11=0, var_13=200, var_18=1] [L64] var_12_arg_0 = var_12_arg_0 & mask_SORT_4 [L65] SORT_8 var_12 = var_12_arg_0; [L66] SORT_8 var_14_arg_0 = var_12; [L67] SORT_8 var_14_arg_1 = var_13; [L68] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L69] SORT_1 var_15_arg_0 = var_11; [L70] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_23=200, state_6=100, var_10=100, var_13=200, var_15_arg_0=0, var_15_arg_1=0, var_18=1] [L71] EXPR var_15_arg_0 | var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_23=200, state_6=100, var_10=100, var_13=200, var_18=1] [L71] SORT_1 var_15 = var_15_arg_0 | var_15_arg_1; [L72] SORT_1 var_19_arg_0 = var_15; [L73] SORT_1 var_19 = ~var_19_arg_0; [L74] SORT_1 var_20_arg_0 = var_18; [L75] SORT_1 var_20_arg_1 = var_19; VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_23=200, state_6=100, var_10=100, var_13=200, var_18=1, var_20_arg_0=1, var_20_arg_1=-1] [L76] EXPR var_20_arg_0 & var_20_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_23=200, state_6=100, var_10=100, var_13=200, var_18=1] [L76] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L77] EXPR var_20 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=1048575, state_23=200, state_6=100, var_10=100, var_13=200, var_18=1] [L77] var_20 = var_20 & mask_SORT_1 [L78] SORT_1 bad_21_arg_0 = var_20; [L79] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 227 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 834 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 593 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 394 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 241 mSDtfsCounter, 394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=7, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 96 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-11 06:51:39,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_two.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3d80a08c66b9b1eadaab4dbad5179d13f0d2ba2cc2da58b84f0d125081ac09c4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 06:51:41,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 06:51:41,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 06:51:41,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 06:51:41,525 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 06:51:41,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 06:51:41,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 06:51:41,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 06:51:41,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 06:51:41,555 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 06:51:41,555 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 06:51:41,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 06:51:41,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 06:51:41,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 06:51:41,557 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 06:51:41,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 06:51:41,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 06:51:41,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 06:51:41,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 06:51:41,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 06:51:41,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 06:51:41,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 06:51:41,564 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 06:51:41,564 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 06:51:41,565 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 06:51:41,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 06:51:41,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 06:51:41,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 06:51:41,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 06:51:41,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 06:51:41,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 06:51:41,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:51:41,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 06:51:41,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 06:51:41,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 06:51:41,568 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 06:51:41,568 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 06:51:41,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 06:51:41,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 06:51:41,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 06:51:41,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 06:51:41,570 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 06:51:41,571 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-clean/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-clean/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 -> 3d80a08c66b9b1eadaab4dbad5179d13f0d2ba2cc2da58b84f0d125081ac09c4 [2024-10-11 06:51:41,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 06:51:41,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 06:51:41,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 06:51:41,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 06:51:41,959 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 06:51:41,961 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_two.c [2024-10-11 06:51:43,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 06:51:43,659 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 06:51:43,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.swap_two.c [2024-10-11 06:51:43,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cea73284f/8de6a9ac57ba4bf7917c0268a6b9661f/FLAG0f556e62a [2024-10-11 06:51:43,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cea73284f/8de6a9ac57ba4bf7917c0268a6b9661f [2024-10-11 06:51:43,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 06:51:43,691 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 06:51:43,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 06:51:43,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 06:51:43,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 06:51:43,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:51:43" (1/1) ... [2024-10-11 06:51:43,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cb98fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:43, skipping insertion in model container [2024-10-11 06:51:43,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:51:43" (1/1) ... [2024-10-11 06:51:43,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 06:51:43,925 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.swap_two.c[1248,1261] [2024-10-11 06:51:43,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:51:43,985 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 06:51:43,999 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.swap_two.c[1248,1261] [2024-10-11 06:51:44,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 06:51:44,042 INFO L204 MainTranslator]: Completed translation [2024-10-11 06:51:44,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44 WrapperNode [2024-10-11 06:51:44,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 06:51:44,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 06:51:44,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 06:51:44,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 06:51:44,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,099 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2024-10-11 06:51:44,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 06:51:44,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 06:51:44,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 06:51:44,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 06:51:44,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,115 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,127 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-11 06:51:44,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 06:51:44,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 06:51:44,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 06:51:44,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 06:51:44,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (1/1) ... [2024-10-11 06:51:44,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 06:51:44,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 06:51:44,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 06:51:44,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 06:51:44,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 06:51:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 06:51:44,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 06:51:44,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 06:51:44,338 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 06:51:44,341 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 06:51:44,516 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 06:51:44,516 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 06:51:44,547 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 06:51:44,547 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 06:51:44,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:51:44 BoogieIcfgContainer [2024-10-11 06:51:44,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 06:51:44,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 06:51:44,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 06:51:44,556 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 06:51:44,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:51:43" (1/3) ... [2024-10-11 06:51:44,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746fcf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:51:44, skipping insertion in model container [2024-10-11 06:51:44,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:51:44" (2/3) ... [2024-10-11 06:51:44,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746fcf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:51:44, skipping insertion in model container [2024-10-11 06:51:44,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:51:44" (3/3) ... [2024-10-11 06:51:44,562 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.swap_two.c [2024-10-11 06:51:44,577 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 06:51:44,577 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 06:51:44,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 06:51:44,637 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;@4767b4bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 06:51:44,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 06:51:44,643 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-11 06:51:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 06:51:44,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:51:44,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 06:51:44,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:51:44,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:51:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 06:51:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:51:44,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874128207] [2024-10-11 06:51:44,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:51:44,676 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-11 06:51:44,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:51:44,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 06:51:44,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 06:51:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:51:44,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 06:51:44,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:51:45,070 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-11 06:51:45,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 06:51:45,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:51:45,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874128207] [2024-10-11 06:51:45,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874128207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 06:51:45,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 06:51:45,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 06:51:45,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559831187] [2024-10-11 06:51:45,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 06:51:45,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 06:51:45,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:51:45,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 06:51:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 06:51:45,102 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-11 06:51:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:51:45,161 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 06:51:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 06:51:45,164 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-11 06:51:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:51:45,178 INFO L225 Difference]: With dead ends: 15 [2024-10-11 06:51:45,178 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 06:51:45,181 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-11 06:51:45,184 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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-11 06:51:45,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:51:45,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 06:51:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 06:51:45,211 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-11 06:51:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 06:51:45,213 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 06:51:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:51:45,213 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 06:51:45,213 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-11 06:51:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 06:51:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 06:51:45,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:51:45,214 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 06:51:45,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 06:51:45,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 06:51:45,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:51:45,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:51:45,417 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 06:51:45,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:51:45,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419059298] [2024-10-11 06:51:45,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 06:51:45,418 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-11 06:51:45,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:51:45,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 06:51:45,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 06:51:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 06:51:45,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 06:51:45,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:51:45,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-11 06:51:45,678 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:51:45,939 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-11 06:51:45,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:51:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419059298] [2024-10-11 06:51:45,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419059298] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:51:45,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 06:51:45,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 06:51:45,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943467774] [2024-10-11 06:51:45,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 06:51:45,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:51:45,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:51:45,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:51:45,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:51:45,944 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-11 06:51:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:51:46,006 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-11 06:51:46,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:51:46,007 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-11 06:51:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:51:46,008 INFO L225 Difference]: With dead ends: 13 [2024-10-11 06:51:46,008 INFO L226 Difference]: Without dead ends: 11 [2024-10-11 06:51:46,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:51:46,009 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:51:46,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:51:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-11 06:51:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-11 06:51:46,015 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-11 06:51:46,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-11 06:51:46,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-11 06:51:46,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:51:46,016 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-11 06:51:46,017 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-11 06:51:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-11 06:51:46,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 06:51:46,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 06:51:46,018 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-11 06:51:46,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 06:51:46,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 06:51:46,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 06:51:46,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 06:51:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-11 06:51:46,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 06:51:46,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905336608] [2024-10-11 06:51:46,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 06:51:46,223 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-11 06:51:46,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 06:51:46,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 06:51:46,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 06:51:46,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 06:51:46,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 06:51:46,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 06:51:46,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 06:51:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 06:51:46,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 06:51:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 06:51:46,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 06:51:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905336608] [2024-10-11 06:51:46,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905336608] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 06:51:46,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 06:51:46,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 06:51:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153759880] [2024-10-11 06:51:46,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 06:51:46,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 06:51:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 06:51:46,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 06:51:46,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 06:51:46,739 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:51:46,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 06:51:46,806 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2024-10-11 06:51:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 06:51:46,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 06:51:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 06:51:46,807 INFO L225 Difference]: With dead ends: 11 [2024-10-11 06:51:46,808 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 06:51:46,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 06:51:46,809 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 06:51:46,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 06:51:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 06:51:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 06:51:46,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-11 06:51:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 06:51:46,813 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2024-10-11 06:51:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 06:51:46,813 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 06:51:46,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 06:51:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 06:51:46,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 06:51:46,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 06:51:46,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 06:51:47,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 06:51:47,024 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-10-11 06:51:47,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 06:51:47,072 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 06:51:47,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:51:47 BoogieIcfgContainer [2024-10-11 06:51:47,091 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 06:51:47,094 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 06:51:47,094 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 06:51:47,094 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 06:51:47,095 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:51:44" (3/4) ... [2024-10-11 06:51:47,097 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 06:51:47,103 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 06:51:47,104 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 06:51:47,104 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 06:51:47,105 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 06:51:47,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 06:51:47,251 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 06:51:47,251 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 06:51:47,253 INFO L158 Benchmark]: Toolchain (without parser) took 3562.35ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 58.4MB in the beginning and 100.2MB in the end (delta: -41.7MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-10-11 06:51:47,254 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 62.9MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 06:51:47,254 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.39ms. Allocated memory is still 86.0MB. Free memory was 58.1MB in the beginning and 44.7MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 06:51:47,254 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.95ms. Allocated memory is still 86.0MB. Free memory was 44.7MB in the beginning and 64.9MB in the end (delta: -20.2MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-10-11 06:51:47,255 INFO L158 Benchmark]: Boogie Preprocessor took 54.22ms. Allocated memory is still 86.0MB. Free memory was 64.9MB in the beginning and 62.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 06:51:47,255 INFO L158 Benchmark]: RCFGBuilder took 393.19ms. Allocated memory is still 86.0MB. Free memory was 62.9MB in the beginning and 48.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 06:51:47,255 INFO L158 Benchmark]: TraceAbstraction took 2541.65ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 47.4MB in the beginning and 59.9MB in the end (delta: -12.6MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-11 06:51:47,256 INFO L158 Benchmark]: Witness Printer took 157.13ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 59.9MB in the beginning and 100.2MB in the end (delta: -40.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 06:51:47,258 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.20ms. Allocated memory is still 62.9MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.39ms. Allocated memory is still 86.0MB. Free memory was 58.1MB in the beginning and 44.7MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.95ms. Allocated memory is still 86.0MB. Free memory was 44.7MB in the beginning and 64.9MB in the end (delta: -20.2MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.22ms. Allocated memory is still 86.0MB. Free memory was 64.9MB in the beginning and 62.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 393.19ms. Allocated memory is still 86.0MB. Free memory was 62.9MB in the beginning and 48.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2541.65ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 47.4MB in the beginning and 59.9MB in the end (delta: -12.6MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Witness Printer took 157.13ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 59.9MB in the beginning and 100.2MB in the end (delta: -40.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 6 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 11 QuantifiedInterpolants, 794 SizeOfPredicates, 12 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2/18 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((((((200 == var_13) && (100 == state_23)) && (1 == mask_SORT_1)) && (1048575 == mask_SORT_4)) && (100 == var_10)) && (200 == state_6)) || ((((((100 == state_6) && (200 == var_13)) && (200 == state_23)) && (1 == mask_SORT_1)) && (1048575 == mask_SORT_4)) && (100 == var_10))) RESULT: Ultimate proved your program to be correct! [2024-10-11 06:51:47,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE