./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.synabs2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:32:45,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:32:45,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 23:32:45,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:32:45,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:32:45,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:32:45,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:32:45,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:32:45,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:32:45,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:32:45,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:32:45,727 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:32:45,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:32:45,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:32:45,729 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:32:45,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:32:45,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:32:45,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:32:45,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:32:45,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:32:45,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:32:45,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:32:45,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:32:45,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:32:45,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:32:45,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:32:45,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:32:45,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:32:45,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:32:45,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:32:45,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:32:45,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:32:45,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:32:45,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:32:45,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:32:45,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:32:45,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:32:45,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:32:45,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:32:45,737 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 [2024-10-12 23:32:45,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:32:45,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:32:45,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:32:45,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:32:45,936 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:32:45,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-10-12 23:32:47,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:32:47,513 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:32:47,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-10-12 23:32:47,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49d4a4080/766769dd23394a7e81caea68aa14d4fa/FLAG3e46d0c1c [2024-10-12 23:32:47,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49d4a4080/766769dd23394a7e81caea68aa14d4fa [2024-10-12 23:32:47,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:32:47,903 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:32:47,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:32:47,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:32:47,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:32:47,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:32:47" (1/1) ... [2024-10-12 23:32:47,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258d4c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:47, skipping insertion in model container [2024-10-12 23:32:47,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:32:47" (1/1) ... [2024-10-12 23:32:47,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:32:48,182 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.synabs2.c[1247,1260] [2024-10-12 23:32:48,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:32:48,243 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:32:48,264 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.synabs2.c[1247,1260] [2024-10-12 23:32:48,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:32:48,320 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:32:48,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48 WrapperNode [2024-10-12 23:32:48,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:32:48,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:32:48,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:32:48,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:32:48,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,420 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2024-10-12 23:32:48,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:32:48,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:32:48,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:32:48,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:32:48,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,451 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-12 23:32:48,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:32:48,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:32:48,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:32:48,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:32:48,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (1/1) ... [2024-10-12 23:32:48,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:32:48,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:32:48,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:32:48,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:32:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:32:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:32:48,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:32:48,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:32:48,630 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:32:48,632 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:32:48,864 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-10-12 23:32:48,864 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:32:48,887 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:32:48,887 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:32:48,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:32:48 BoogieIcfgContainer [2024-10-12 23:32:48,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:32:48,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:32:48,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:32:48,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:32:48,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:32:47" (1/3) ... [2024-10-12 23:32:48,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fa3fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:32:48, skipping insertion in model container [2024-10-12 23:32:48,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:48" (2/3) ... [2024-10-12 23:32:48,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fa3fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:32:48, skipping insertion in model container [2024-10-12 23:32:48,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:32:48" (3/3) ... [2024-10-12 23:32:48,895 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2024-10-12 23:32:48,908 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:32:48,909 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:32:48,951 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:32:48,957 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;@46aaa4d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:32:48,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:32:48,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:32:48,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 23:32:48,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:32:48,967 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:32:48,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:32:48,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:32:48,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1404105950, now seen corresponding path program 1 times [2024-10-12 23:32:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:32:48,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436888553] [2024-10-12 23:32:48,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:32:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:32:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:32:49,304 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-12 23:32:49,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:32:49,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436888553] [2024-10-12 23:32:49,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436888553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:32:49,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:32:49,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:32:49,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358239515] [2024-10-12 23:32:49,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:32:49,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:32:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:32:49,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:32:49,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:32:49,333 INFO L87 Difference]: Start difference. First operand has 39 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 38 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12 23:32:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:32:49,364 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-10-12 23:32:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:32:49,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-10-12 23:32:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:32:49,373 INFO L225 Difference]: With dead ends: 70 [2024-10-12 23:32:49,373 INFO L226 Difference]: Without dead ends: 40 [2024-10-12 23:32:49,376 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-12 23:32:49,378 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 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-12 23:32:49,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:32:49,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-12 23:32:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-12 23:32:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:32:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-10-12 23:32:49,406 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 12 [2024-10-12 23:32:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:32:49,406 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-10-12 23:32:49,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-12 23:32:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-10-12 23:32:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 23:32:49,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:32:49,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:32:49,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:32:49,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:32:49,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:32:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash -575916285, now seen corresponding path program 1 times [2024-10-12 23:32:49,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:32:49,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291443138] [2024-10-12 23:32:49,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:32:49,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:32:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:32:49,537 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-12 23:32:49,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:32:49,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291443138] [2024-10-12 23:32:49,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291443138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:32:49,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:32:49,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:32:49,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187162948] [2024-10-12 23:32:49,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:32:49,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:32:49,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:32:49,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:32:49,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:32:49,544 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:32:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:32:49,573 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2024-10-12 23:32:49,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:32:49,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-12 23:32:49,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:32:49,575 INFO L225 Difference]: With dead ends: 73 [2024-10-12 23:32:49,575 INFO L226 Difference]: Without dead ends: 42 [2024-10-12 23:32:49,575 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-12 23:32:49,576 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 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-12 23:32:49,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:32:49,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-12 23:32:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-12 23:32:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 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-12 23:32:49,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-10-12 23:32:49,581 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 13 [2024-10-12 23:32:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:32:49,581 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-10-12 23:32:49,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:32:49,582 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-10-12 23:32:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 23:32:49,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:32:49,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:32:49,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:32:49,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:32:49,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:32:49,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1771501541, now seen corresponding path program 1 times [2024-10-12 23:32:49,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:32:49,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530476667] [2024-10-12 23:32:49,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:32:49,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:32:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:32:49,676 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-12 23:32:49,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:32:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530476667] [2024-10-12 23:32:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530476667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:32:49,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:32:49,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:32:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984482938] [2024-10-12 23:32:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:32:49,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:32:49,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:32:49,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:32:49,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:32:49,678 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:32:49,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:32:49,722 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2024-10-12 23:32:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:32:49,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-12 23:32:49,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:32:49,723 INFO L225 Difference]: With dead ends: 75 [2024-10-12 23:32:49,723 INFO L226 Difference]: Without dead ends: 42 [2024-10-12 23:32:49,724 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-12 23:32:49,724 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 49 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:32:49,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 93 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:32:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-12 23:32:49,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-12 23:32:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 41 states have internal predecessors, (57), 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-12 23:32:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2024-10-12 23:32:49,728 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 14 [2024-10-12 23:32:49,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:32:49,728 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2024-10-12 23:32:49,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:32:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2024-10-12 23:32:49,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 23:32:49,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:32:49,729 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:32:49,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:32:49,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:32:49,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:32:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1812395066, now seen corresponding path program 1 times [2024-10-12 23:32:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:32:49,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910383502] [2024-10-12 23:32:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:32:49,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:32:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:32:49,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:32:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:32:49,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:32:49,803 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:32:49,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:32:49,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:32:49,812 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-12 23:32:49,841 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:32:49,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:32:49 BoogieIcfgContainer [2024-10-12 23:32:49,846 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:32:49,846 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:32:49,848 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:32:49,848 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:32:49,848 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:32:48" (3/4) ... [2024-10-12 23:32:49,850 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:32:49,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:32:49,853 INFO L158 Benchmark]: Toolchain (without parser) took 1949.46ms. Allocated memory is still 192.9MB. Free memory was 122.9MB in the beginning and 119.1MB in the end (delta: 3.8MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-12 23:32:49,854 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:32:49,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.48ms. Allocated memory is still 192.9MB. Free memory was 122.6MB in the beginning and 109.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 23:32:49,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.02ms. Allocated memory is still 192.9MB. Free memory was 109.2MB in the beginning and 163.7MB in the end (delta: -54.5MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-10-12 23:32:49,855 INFO L158 Benchmark]: Boogie Preprocessor took 69.67ms. Allocated memory is still 192.9MB. Free memory was 163.7MB in the beginning and 160.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:32:49,856 INFO L158 Benchmark]: RCFGBuilder took 396.91ms. Allocated memory is still 192.9MB. Free memory was 160.9MB in the beginning and 137.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-12 23:32:49,856 INFO L158 Benchmark]: TraceAbstraction took 956.68ms. Allocated memory is still 192.9MB. Free memory was 136.7MB in the beginning and 120.1MB in the end (delta: 16.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-10-12 23:32:49,856 INFO L158 Benchmark]: Witness Printer took 6.03ms. Allocated memory is still 192.9MB. Free memory was 120.1MB in the beginning and 119.1MB in the end (delta: 972.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:32:49,860 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 115.3MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.48ms. Allocated memory is still 192.9MB. Free memory was 122.6MB in the beginning and 109.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.02ms. Allocated memory is still 192.9MB. Free memory was 109.2MB in the beginning and 163.7MB in the end (delta: -54.5MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.67ms. Allocated memory is still 192.9MB. Free memory was 163.7MB in the beginning and 160.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 396.91ms. Allocated memory is still 192.9MB. Free memory was 160.9MB in the beginning and 137.3MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 956.68ms. Allocated memory is still 192.9MB. Free memory was 136.7MB in the beginning and 120.1MB in the end (delta: 16.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Witness Printer took 6.03ms. Allocated memory is still 192.9MB. Free memory was 120.1MB in the beginning and 119.1MB in the end (delta: 972.4kB). 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 - 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 63. 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 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, var_14=1, var_21=2, var_5=0, var_8=6] [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, var_14=1, var_21=2, var_5=0, var_8=6] [L44] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_16_arg_0=1, var_16_arg_1=-2, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 386 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 149 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 91 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 23:32:49,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:32:52,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:32:52,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 23:32:52,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:32:52,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:32:52,407 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:32:52,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:32:52,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:32:52,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:32:52,410 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:32:52,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:32:52,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:32:52,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:32:52,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:32:52,413 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:32:52,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:32:52,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:32:52,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:32:52,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:32:52,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:32:52,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:32:52,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:32:52,417 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:32:52,418 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:32:52,418 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:32:52,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:32:52,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:32:52,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:32:52,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:32:52,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:32:52,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:32:52,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:32:52,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:32:52,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:32:52,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:32:52,420 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:32:52,420 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:32:52,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:32:52,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:32:52,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:32:52,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:32:52,421 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:32:52,422 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 [2024-10-12 23:32:52,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:32:52,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:32:52,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:32:52,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:32:52,724 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:32:52,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-10-12 23:32:54,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:32:54,355 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:32:54,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2024-10-12 23:32:54,367 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4049c536/5c4adcc013b64170bf502a2069cd0b56/FLAGacba0f49e [2024-10-12 23:32:54,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4049c536/5c4adcc013b64170bf502a2069cd0b56 [2024-10-12 23:32:54,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:32:54,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:32:54,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:32:54,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:32:54,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:32:54,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c0baa33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54, skipping insertion in model container [2024-10-12 23:32:54,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:32:54,563 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.synabs2.c[1247,1260] [2024-10-12 23:32:54,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:32:54,606 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:32:54,615 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.synabs2.c[1247,1260] [2024-10-12 23:32:54,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:32:54,665 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:32:54,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54 WrapperNode [2024-10-12 23:32:54,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:32:54,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:32:54,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:32:54,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:32:54,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,700 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2024-10-12 23:32:54,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:32:54,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:32:54,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:32:54,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:32:54,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,724 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-12 23:32:54,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,730 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:32:54,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:32:54,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:32:54,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:32:54,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (1/1) ... [2024-10-12 23:32:54,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:32:54,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:32:54,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:32:54,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:32:54,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:32:54,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:32:54,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:32:54,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:32:54,861 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:32:54,863 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:32:55,024 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-12 23:32:55,028 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:32:55,070 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:32:55,071 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:32:55,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:32:55 BoogieIcfgContainer [2024-10-12 23:32:55,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:32:55,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:32:55,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:32:55,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:32:55,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:32:54" (1/3) ... [2024-10-12 23:32:55,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d040779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:32:55, skipping insertion in model container [2024-10-12 23:32:55,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:32:54" (2/3) ... [2024-10-12 23:32:55,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d040779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:32:55, skipping insertion in model container [2024-10-12 23:32:55,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:32:55" (3/3) ... [2024-10-12 23:32:55,082 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2024-10-12 23:32:55,096 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:32:55,097 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:32:55,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:32:55,150 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;@4c2c65b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:32:55,151 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:32:55,155 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-12 23:32:55,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-12 23:32:55,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:32:55,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-12 23:32:55,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:32:55,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:32:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-12 23:32:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:32:55,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967235329] [2024-10-12 23:32:55,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:32:55,178 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-12 23:32:55,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:32:55,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:32:55,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 23:32:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:32:55,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-12 23:32:55,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:32:55,376 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-12 23:32:55,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:32:55,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:32:55,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967235329] [2024-10-12 23:32:55,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967235329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:32:55,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:32:55,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:32:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615310178] [2024-10-12 23:32:55,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:32:55,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:32:55,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:32:55,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:32:55,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:32:55,407 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-12 23:32:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:32:55,463 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-12 23:32:55,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:32:55,467 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-12 23:32:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:32:55,472 INFO L225 Difference]: With dead ends: 15 [2024-10-12 23:32:55,472 INFO L226 Difference]: Without dead ends: 9 [2024-10-12 23:32:55,474 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-12 23:32:55,478 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-12 23:32:55,478 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-12 23:32:55,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-12 23:32:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-12 23:32:55,498 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-12 23:32:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-12 23:32:55,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-12 23:32:55,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:32:55,500 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-12 23:32:55,500 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-12 23:32:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-12 23:32:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 23:32:55,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:32:55,501 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-12 23:32:55,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 23:32:55,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:32:55,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:32:55,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:32:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-12 23:32:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:32:55,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073251329] [2024-10-12 23:32:55,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:32:55,706 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-12 23:32:55,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:32:55,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:32:55,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 23:32:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:32:55,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-12 23:32:55,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:32:55,949 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-12 23:32:55,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:32:56,201 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-12 23:32:56,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:32:56,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073251329] [2024-10-12 23:32:56,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073251329] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:32:56,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:32:56,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-12 23:32:56,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035163908] [2024-10-12 23:32:56,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:32:56,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:32:56,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:32:56,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:32:56,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:32:56,207 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-12 23:32:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:32:56,366 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-12 23:32:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:32:56,367 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-12 23:32:56,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:32:56,367 INFO L225 Difference]: With dead ends: 17 [2024-10-12 23:32:56,368 INFO L226 Difference]: Without dead ends: 15 [2024-10-12 23:32:56,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-12 23:32:56,369 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:32:56,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:32:56,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-12 23:32:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-12 23:32:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:32:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-12 23:32:56,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-12 23:32:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:32:56,385 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-12 23:32:56,385 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-12 23:32:56,386 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-12 23:32:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 23:32:56,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:32:56,386 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-12 23:32:56,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-12 23:32:56,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:32:56,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:32:56,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:32:56,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-12 23:32:56,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:32:56,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793853877] [2024-10-12 23:32:56,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 23:32:56,592 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-12 23:32:56,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:32:56,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:32:56,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 23:32:56,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 23:32:56,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 23:32:56,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-12 23:32:56,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:32:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:32:57,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:32:57,594 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:32:57,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:32:57,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793853877] [2024-10-12 23:32:57,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793853877] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:32:57,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:32:57,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-12 23:32:57,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119075900] [2024-10-12 23:32:57,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:32:57,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 23:32:57,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:32:57,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 23:32:57,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-12 23:32:57,597 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-12 23:32:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:32:58,202 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-10-12 23:32:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 23:32:58,203 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-12 23:32:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:32:58,204 INFO L225 Difference]: With dead ends: 29 [2024-10-12 23:32:58,204 INFO L226 Difference]: Without dead ends: 27 [2024-10-12 23:32:58,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2024-10-12 23:32:58,205 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:32:58,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:32:58,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-12 23:32:58,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-10-12 23:32:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:32:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-10-12 23:32:58,214 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2024-10-12 23:32:58,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:32:58,215 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-10-12 23:32:58,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-12 23:32:58,215 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-10-12 23:32:58,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 23:32:58,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:32:58,216 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2024-10-12 23:32:58,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-12 23:32:58,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:32:58,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:32:58,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:32:58,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1505384042, now seen corresponding path program 3 times [2024-10-12 23:32:58,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:32:58,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854988912] [2024-10-12 23:32:58,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 23:32:58,419 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-12 23:32:58,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:32:58,422 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:32:58,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-12 23:32:58,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-12 23:32:58,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 23:32:58,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-12 23:32:58,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:32:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:32:58,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:33:00,274 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:33:00,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:33:00,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854988912] [2024-10-12 23:33:00,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854988912] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:33:00,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 23:33:00,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-10-12 23:33:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254526166] [2024-10-12 23:33:00,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 23:33:00,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-12 23:33:00,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:33:00,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-12 23:33:00,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2024-10-12 23:33:00,283 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 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-12 23:33:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:33:02,459 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-10-12 23:33:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-12 23:33:02,461 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 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 25 [2024-10-12 23:33:02,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:33:02,462 INFO L225 Difference]: With dead ends: 47 [2024-10-12 23:33:02,462 INFO L226 Difference]: Without dead ends: 45 [2024-10-12 23:33:02,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=392, Invalid=1014, Unknown=0, NotChecked=0, Total=1406 [2024-10-12 23:33:02,463 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:33:02,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:33:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-12 23:33:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-10-12 23:33:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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-12 23:33:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2024-10-12 23:33:02,479 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 25 [2024-10-12 23:33:02,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:33:02,479 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2024-10-12 23:33:02,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 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-12 23:33:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2024-10-12 23:33:02,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 23:33:02,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:33:02,481 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1] [2024-10-12 23:33:02,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-12 23:33:02,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:33:02,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:33:02,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:33:02,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1715193578, now seen corresponding path program 4 times [2024-10-12 23:33:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:33:02,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243309044] [2024-10-12 23:33:02,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 23:33:02,690 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-12 23:33:02,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:33:02,692 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:33:02,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-12 23:33:02,972 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 23:33:02,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-12 23:33:02,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:33:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:33:03,131 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-12 23:33:03,132 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:33:03,133 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:33:03,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-12 23:33:03,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:33:03,337 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-10-12 23:33:03,381 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:33:03,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:33:03 BoogieIcfgContainer [2024-10-12 23:33:03,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:33:03,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:33:03,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:33:03,384 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:33:03,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:32:55" (3/4) ... [2024-10-12 23:33:03,385 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 23:33:03,458 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 23:33:03,458 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:33:03,458 INFO L158 Benchmark]: Toolchain (without parser) took 9069.61ms. Allocated memory was 65.0MB in the beginning and 201.3MB in the end (delta: 136.3MB). Free memory was 41.2MB in the beginning and 95.5MB in the end (delta: -54.3MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2024-10-12 23:33:03,458 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory was 41.9MB in the beginning and 41.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:33:03,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.46ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 40.9MB in the beginning and 72.2MB in the end (delta: -31.3MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-12 23:33:03,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.73ms. Allocated memory is still 92.3MB. Free memory was 72.2MB in the beginning and 70.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:33:03,459 INFO L158 Benchmark]: Boogie Preprocessor took 31.03ms. Allocated memory is still 92.3MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:33:03,459 INFO L158 Benchmark]: RCFGBuilder took 337.72ms. Allocated memory is still 92.3MB. Free memory was 68.1MB in the beginning and 53.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 23:33:03,460 INFO L158 Benchmark]: TraceAbstraction took 8309.67ms. Allocated memory was 92.3MB in the beginning and 201.3MB in the end (delta: 109.1MB). Free memory was 52.6MB in the beginning and 105.0MB in the end (delta: -52.4MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. [2024-10-12 23:33:03,460 INFO L158 Benchmark]: Witness Printer took 74.32ms. Allocated memory is still 201.3MB. Free memory was 105.0MB in the beginning and 95.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 23:33:03,461 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory was 41.9MB in the beginning and 41.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.46ms. Allocated memory was 65.0MB in the beginning and 92.3MB in the end (delta: 27.3MB). Free memory was 40.9MB in the beginning and 72.2MB in the end (delta: -31.3MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.73ms. Allocated memory is still 92.3MB. Free memory was 72.2MB in the beginning and 70.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.03ms. Allocated memory is still 92.3MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 337.72ms. Allocated memory is still 92.3MB. Free memory was 68.1MB in the beginning and 53.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8309.67ms. Allocated memory was 92.3MB in the beginning and 201.3MB in the end (delta: 109.1MB). Free memory was 52.6MB in the beginning and 105.0MB in the end (delta: -52.4MB). Peak memory consumption was 57.3MB. Max. memory is 16.1GB. * Witness Printer took 74.32ms. Allocated memory is still 201.3MB. Free memory was 105.0MB in the beginning and 95.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a 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 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 358 IncrementalHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 8 mSDtfsCounter, 358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=4, InterpolantAutomatonStates: 56, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 87 ConstructedInterpolants, 36 QuantifiedInterpolants, 7919 SizeOfPredicates, 18 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-12 23:33:03,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE