./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.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 d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:57:43,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:57:44,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:57:44,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:57:44,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:57:44,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:57:44,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:57:44,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:57:44,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:57:44,079 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:57:44,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:57:44,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:57:44,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:57:44,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:57:44,083 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:57:44,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:57:44,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:57:44,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:57:44,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:57:44,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:57:44,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:57:44,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:57:44,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:57:44,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:57:44,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:57:44,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:57:44,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:57:44,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:57:44,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:57:44,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:57:44,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:57:44,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:57:44,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:57:44,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:57:44,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:57:44,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:57:44,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:57:44,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:57:44,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:57:44,094 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 -> d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e [2024-11-12 00:57:44,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:57:44,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:57:44,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:57:44,369 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:57:44,369 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:57:44,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-11-12 00:57:45,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:57:46,022 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:57:46,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-11-12 00:57:46,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71bd255e4/df6d989cfac94616a1adab459e582406/FLAG0b0b0a4a4 [2024-11-12 00:57:46,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71bd255e4/df6d989cfac94616a1adab459e582406 [2024-11-12 00:57:46,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:57:46,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:57:46,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:46,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:57:46,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:57:46,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:46,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd74193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46, skipping insertion in model container [2024-11-12 00:57:46,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:46,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:57:46,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2024-11-12 00:57:46,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:46,578 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:57:46,588 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2024-11-12 00:57:46,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:57:46,759 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:57:46,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46 WrapperNode [2024-11-12 00:57:46,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:57:46,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:46,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:57:46,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:57:46,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:46,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:47,107 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2239 [2024-11-12 00:57:47,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:57:47,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:57:47,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:57:47,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:57:47,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:47,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:47,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:47,263 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 00:57:47,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:47,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:47,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:47,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:47,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:47,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:47,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:57:47,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:57:47,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:57:47,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:57:47,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (1/1) ... [2024-11-12 00:57:47,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:57:47,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:57:47,646 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:57:47,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:57:47,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:57:47,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:57:47,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:57:47,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:57:48,060 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:57:48,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:57:50,188 INFO L? ?]: Removed 1401 outVars from TransFormulas that were not future-live. [2024-11-12 00:57:50,188 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:57:50,224 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:57:50,224 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:57:50,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:50 BoogieIcfgContainer [2024-11-12 00:57:50,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:57:50,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:57:50,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:57:50,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:57:50,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:57:46" (1/3) ... [2024-11-12 00:57:50,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba72664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:50, skipping insertion in model container [2024-11-12 00:57:50,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:57:46" (2/3) ... [2024-11-12 00:57:50,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba72664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:57:50, skipping insertion in model container [2024-11-12 00:57:50,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:50" (3/3) ... [2024-11-12 00:57:50,234 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-11-12 00:57:50,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:57:50,252 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:57:50,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:57:50,350 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;@6552da80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:57:50,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:57:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 571 states, 569 states have (on average 1.4991212653778558) internal successors, (853), 570 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 00:57:50,369 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:50,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:50,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:50,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1650427522, now seen corresponding path program 1 times [2024-11-12 00:57:50,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:50,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731335723] [2024-11-12 00:57:50,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:50,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:51,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:51,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731335723] [2024-11-12 00:57:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731335723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:57:51,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630450531] [2024-11-12 00:57:51,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:51,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:57:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:51,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:57:51,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:51,261 INFO L87 Difference]: Start difference. First operand has 571 states, 569 states have (on average 1.4991212653778558) internal successors, (853), 570 states have internal predecessors, (853), 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 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:51,369 INFO L93 Difference]: Finished difference Result 1087 states and 1627 transitions. [2024-11-12 00:57:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:57:51,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-12 00:57:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:51,390 INFO L225 Difference]: With dead ends: 1087 [2024-11-12 00:57:51,390 INFO L226 Difference]: Without dead ends: 570 [2024-11-12 00:57:51,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:51,399 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 0 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2535 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:51,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2535 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-12 00:57:51,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2024-11-12 00:57:51,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.4956063268892794) internal successors, (851), 569 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 851 transitions. [2024-11-12 00:57:51,467 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 851 transitions. Word has length 61 [2024-11-12 00:57:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:51,468 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 851 transitions. [2024-11-12 00:57:51,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:51,468 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 851 transitions. [2024-11-12 00:57:51,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 00:57:51,474 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:51,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:51,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:57:51,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:51,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash -374658853, now seen corresponding path program 1 times [2024-11-12 00:57:51,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862669510] [2024-11-12 00:57:51,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:51,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:51,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:51,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862669510] [2024-11-12 00:57:51,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862669510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:51,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:51,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:57:51,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549058632] [2024-11-12 00:57:51,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:51,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:57:51,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:51,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:57:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:51,767 INFO L87 Difference]: Start difference. First operand 570 states and 851 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:51,821 INFO L93 Difference]: Finished difference Result 1088 states and 1625 transitions. [2024-11-12 00:57:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:57:51,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-12 00:57:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:51,827 INFO L225 Difference]: With dead ends: 1088 [2024-11-12 00:57:51,827 INFO L226 Difference]: Without dead ends: 572 [2024-11-12 00:57:51,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:57:51,830 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 0 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:51,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2531 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:51,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-11-12 00:57:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2024-11-12 00:57:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.4938704028021015) internal successors, (853), 571 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 853 transitions. [2024-11-12 00:57:51,906 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 853 transitions. Word has length 62 [2024-11-12 00:57:51,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:51,907 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 853 transitions. [2024-11-12 00:57:51,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 853 transitions. [2024-11-12 00:57:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 00:57:51,908 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:51,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:51,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:57:51,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:51,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash 172511867, now seen corresponding path program 1 times [2024-11-12 00:57:51,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:51,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705984536] [2024-11-12 00:57:51,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:51,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:52,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:52,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705984536] [2024-11-12 00:57:52,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705984536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:52,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:52,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:57:52,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144248762] [2024-11-12 00:57:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:52,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:57:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:52,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:57:52,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:57:52,562 INFO L87 Difference]: Start difference. First operand 572 states and 853 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:52,692 INFO L93 Difference]: Finished difference Result 1097 states and 1637 transitions. [2024-11-12 00:57:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 00:57:52,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-12 00:57:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:52,696 INFO L225 Difference]: With dead ends: 1097 [2024-11-12 00:57:52,696 INFO L226 Difference]: Without dead ends: 579 [2024-11-12 00:57:52,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:57:52,698 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 804 mSDsluCounter, 3341 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 4180 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:52,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 4180 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-12 00:57:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 578. [2024-11-12 00:57:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 1.490467937608319) internal successors, (860), 577 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 860 transitions. [2024-11-12 00:57:52,717 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 860 transitions. Word has length 63 [2024-11-12 00:57:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:52,719 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 860 transitions. [2024-11-12 00:57:52,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 860 transitions. [2024-11-12 00:57:52,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 00:57:52,723 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:52,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:52,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:57:52,723 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:52,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:52,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1961787746, now seen corresponding path program 1 times [2024-11-12 00:57:52,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:52,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271041288] [2024-11-12 00:57:52,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:52,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:53,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:53,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271041288] [2024-11-12 00:57:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271041288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:53,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:53,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 00:57:53,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359345656] [2024-11-12 00:57:53,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:53,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 00:57:53,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:53,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 00:57:53,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:57:53,500 INFO L87 Difference]: Start difference. First operand 578 states and 860 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:53,891 INFO L93 Difference]: Finished difference Result 1388 states and 2062 transitions. [2024-11-12 00:57:53,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 00:57:53,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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 64 [2024-11-12 00:57:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:53,895 INFO L225 Difference]: With dead ends: 1388 [2024-11-12 00:57:53,895 INFO L226 Difference]: Without dead ends: 862 [2024-11-12 00:57:53,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-12 00:57:53,897 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 1673 mSDsluCounter, 5747 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1673 SdHoareTripleChecker+Valid, 6569 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:53,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1673 Valid, 6569 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 00:57:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-11-12 00:57:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 633. [2024-11-12 00:57:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4873417721518987) internal successors, (940), 632 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 940 transitions. [2024-11-12 00:57:53,914 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 940 transitions. Word has length 64 [2024-11-12 00:57:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:53,914 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 940 transitions. [2024-11-12 00:57:53,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 940 transitions. [2024-11-12 00:57:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 00:57:53,918 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:53,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:53,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:57:53,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:53,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash 257283079, now seen corresponding path program 1 times [2024-11-12 00:57:53,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:53,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773077189] [2024-11-12 00:57:53,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:54,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:54,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773077189] [2024-11-12 00:57:54,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773077189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:54,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:54,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:57:54,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981575117] [2024-11-12 00:57:54,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:54,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:57:54,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:54,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:57:54,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:54,248 INFO L87 Difference]: Start difference. First operand 633 states and 940 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:54,413 INFO L93 Difference]: Finished difference Result 1332 states and 1978 transitions. [2024-11-12 00:57:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:57:54,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2024-11-12 00:57:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:54,418 INFO L225 Difference]: With dead ends: 1332 [2024-11-12 00:57:54,418 INFO L226 Difference]: Without dead ends: 807 [2024-11-12 00:57:54,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:57:54,420 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 1475 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:54,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 2491 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:57:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-12 00:57:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 632. [2024-11-12 00:57:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 631 states have (on average 1.4865293185419968) internal successors, (938), 631 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 938 transitions. [2024-11-12 00:57:54,439 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 938 transitions. Word has length 65 [2024-11-12 00:57:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:54,440 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 938 transitions. [2024-11-12 00:57:54,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 938 transitions. [2024-11-12 00:57:54,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 00:57:54,442 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:54,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:54,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:57:54,442 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:54,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:54,443 INFO L85 PathProgramCache]: Analyzing trace with hash 286989542, now seen corresponding path program 1 times [2024-11-12 00:57:54,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:54,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085612606] [2024-11-12 00:57:54,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:54,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:54,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:54,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085612606] [2024-11-12 00:57:54,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085612606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:54,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:54,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:57:54,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27349366] [2024-11-12 00:57:54,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:54,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:57:54,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:54,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:57:54,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:54,675 INFO L87 Difference]: Start difference. First operand 632 states and 938 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:54,732 INFO L93 Difference]: Finished difference Result 1191 states and 1770 transitions. [2024-11-12 00:57:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:57:54,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-12 00:57:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:54,736 INFO L225 Difference]: With dead ends: 1191 [2024-11-12 00:57:54,736 INFO L226 Difference]: Without dead ends: 660 [2024-11-12 00:57:54,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:57:54,738 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 12 mSDsluCounter, 2526 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3372 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:54,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3372 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:57:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-12 00:57:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2024-11-12 00:57:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 1.4840667678300454) internal successors, (978), 659 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 978 transitions. [2024-11-12 00:57:54,753 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 978 transitions. Word has length 66 [2024-11-12 00:57:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:54,754 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 978 transitions. [2024-11-12 00:57:54,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 978 transitions. [2024-11-12 00:57:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 00:57:54,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:54,755 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:54,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:57:54,756 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:54,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:54,757 INFO L85 PathProgramCache]: Analyzing trace with hash -126480036, now seen corresponding path program 1 times [2024-11-12 00:57:54,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:54,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487264652] [2024-11-12 00:57:54,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:54,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:56,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:56,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487264652] [2024-11-12 00:57:56,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487264652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:57:56,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:57:56,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-12 00:57:56,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174810170] [2024-11-12 00:57:56,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:57:56,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 00:57:56,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:57:56,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 00:57:56,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2024-11-12 00:57:56,208 INFO L87 Difference]: Start difference. First operand 660 states and 978 transitions. Second operand has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:57:57,436 INFO L93 Difference]: Finished difference Result 1415 states and 2098 transitions. [2024-11-12 00:57:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 00:57:57,437 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 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 67 [2024-11-12 00:57:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:57:57,441 INFO L225 Difference]: With dead ends: 1415 [2024-11-12 00:57:57,441 INFO L226 Difference]: Without dead ends: 877 [2024-11-12 00:57:57,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 00:57:57,445 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 1734 mSDsluCounter, 12797 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 13596 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 00:57:57,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 13596 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 00:57:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2024-11-12 00:57:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 698. [2024-11-12 00:57:57,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.48493543758967) internal successors, (1035), 697 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1035 transitions. [2024-11-12 00:57:57,464 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1035 transitions. Word has length 67 [2024-11-12 00:57:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:57:57,465 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1035 transitions. [2024-11-12 00:57:57,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 20 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:57:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1035 transitions. [2024-11-12 00:57:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 00:57:57,466 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:57:57,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:57,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:57:57,468 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:57:57,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:57:57,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1938631645, now seen corresponding path program 1 times [2024-11-12 00:57:57,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:57:57,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552189724] [2024-11-12 00:57:57,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:57,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:57:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:57:57,585 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 00:57:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 00:57:57,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 00:57:57,689 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 00:57:57,690 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 00:57:57,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:57:57,694 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:57:57,785 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 00:57:57,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:57:57 BoogieIcfgContainer [2024-11-12 00:57:57,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 00:57:57,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 00:57:57,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 00:57:57,791 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 00:57:57,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:57:50" (3/4) ... [2024-11-12 00:57:57,794 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 00:57:57,795 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 00:57:57,796 INFO L158 Benchmark]: Toolchain (without parser) took 11744.41ms. Allocated memory was 167.8MB in the beginning and 656.4MB in the end (delta: 488.6MB). Free memory was 138.4MB in the beginning and 526.1MB in the end (delta: -387.7MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2024-11-12 00:57:57,796 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 167.8MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:57:57,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 707.71ms. Allocated memory is still 167.8MB. Free memory was 138.4MB in the beginning and 89.4MB in the end (delta: 49.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-12 00:57:57,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 347.14ms. Allocated memory is still 167.8MB. Free memory was 89.4MB in the beginning and 91.3MB in the end (delta: -2.0MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2024-11-12 00:57:57,797 INFO L158 Benchmark]: Boogie Preprocessor took 486.10ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 91.3MB in the beginning and 155.5MB in the end (delta: -64.2MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. [2024-11-12 00:57:57,797 INFO L158 Benchmark]: RCFGBuilder took 2629.76ms. Allocated memory was 226.5MB in the beginning and 446.7MB in the end (delta: 220.2MB). Free memory was 155.5MB in the beginning and 244.4MB in the end (delta: -88.9MB). Peak memory consumption was 134.4MB. Max. memory is 16.1GB. [2024-11-12 00:57:57,797 INFO L158 Benchmark]: TraceAbstraction took 7561.79ms. Allocated memory was 446.7MB in the beginning and 656.4MB in the end (delta: 209.7MB). Free memory was 243.3MB in the beginning and 527.2MB in the end (delta: -283.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:57:57,798 INFO L158 Benchmark]: Witness Printer took 5.07ms. Allocated memory is still 656.4MB. Free memory was 527.2MB in the beginning and 526.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 00:57:57,802 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.60ms. Allocated memory is still 167.8MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 707.71ms. Allocated memory is still 167.8MB. Free memory was 138.4MB in the beginning and 89.4MB in the end (delta: 49.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 347.14ms. Allocated memory is still 167.8MB. Free memory was 89.4MB in the beginning and 91.3MB in the end (delta: -2.0MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 486.10ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 91.3MB in the beginning and 155.5MB in the end (delta: -64.2MB). Peak memory consumption was 62.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2629.76ms. Allocated memory was 226.5MB in the beginning and 446.7MB in the end (delta: 220.2MB). Free memory was 155.5MB in the beginning and 244.4MB in the end (delta: -88.9MB). Peak memory consumption was 134.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7561.79ms. Allocated memory was 446.7MB in the beginning and 656.4MB in the end (delta: 209.7MB). Free memory was 243.3MB in the beginning and 527.2MB in the end (delta: -283.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.07ms. Allocated memory is still 656.4MB. Free memory was 527.2MB in the beginning and 526.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 205, overapproximation of bitwiseAnd at line 210. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 5); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (5 - 1); [L32] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 12); [L33] const SORT_5 msb_SORT_5 = (SORT_5)1 << (12 - 1); [L35] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 3); [L36] const SORT_7 msb_SORT_7 = (SORT_7)1 << (3 - 1); [L38] const SORT_26 mask_SORT_26 = (SORT_26)-1 >> (sizeof(SORT_26) * 8 - 2); [L39] const SORT_26 msb_SORT_26 = (SORT_26)1 << (2 - 1); [L41] const SORT_108 mask_SORT_108 = (SORT_108)-1 >> (sizeof(SORT_108) * 8 - 4); [L42] const SORT_108 msb_SORT_108 = (SORT_108)1 << (4 - 1); [L44] const SORT_165 mask_SORT_165 = (SORT_165)-1 >> (sizeof(SORT_165) * 8 - 32); [L45] const SORT_165 msb_SORT_165 = (SORT_165)1 << (32 - 1); [L47] const SORT_7 var_8 = 0; [L48] const SORT_3 var_15 = 0; [L49] const SORT_1 var_41 = 1; [L50] const SORT_1 var_51 = 0; [L51] const SORT_5 var_54 = 0; [L52] const SORT_7 var_68 = 2; [L53] const SORT_7 var_72 = 1; [L54] const SORT_7 var_77 = 4; [L55] const SORT_7 var_79 = 5; [L56] const SORT_7 var_83 = 3; [L57] const SORT_3 var_95 = 2; [L58] const SORT_7 var_125 = 7; [L59] const SORT_7 var_130 = 6; [L60] const SORT_165 var_167 = 0; [L61] const SORT_3 var_197 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_186; [L67] SORT_3 input_187; [L68] SORT_3 input_188; [L69] SORT_3 input_196; [L70] SORT_3 input_206; [L71] SORT_3 input_207; [L72] SORT_3 input_208; [L73] SORT_3 input_211; [L74] SORT_3 input_230; [L75] SORT_3 input_231; [L76] SORT_3 input_232; [L77] SORT_3 input_235; [L78] SORT_3 input_237; [L79] SORT_26 input_251; [L80] SORT_26 input_252; [L81] SORT_26 input_253; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L83] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L84] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L85] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L86] SORT_3 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L87] SORT_3 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L88] SORT_3 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_5=4095, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L89] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L90] SORT_5 state_55 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L91] SORT_3 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L92] SORT_3 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L93] SORT_3 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L94] SORT_3 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_54=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L95] SORT_3 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_7 init_10_arg_1 = var_8; [L98] state_9 = init_10_arg_1 [L99] SORT_3 init_17_arg_1 = var_15; [L100] state_16 = init_17_arg_1 [L101] SORT_3 init_20_arg_1 = var_15; [L102] state_19 = init_20_arg_1 [L103] SORT_3 init_46_arg_1 = var_15; [L104] state_45 = init_46_arg_1 [L105] SORT_3 init_48_arg_1 = var_15; [L106] state_47 = init_48_arg_1 [L107] SORT_3 init_50_arg_1 = var_15; [L108] state_49 = init_50_arg_1 [L109] SORT_1 init_53_arg_1 = var_51; [L110] state_52 = init_53_arg_1 [L111] SORT_5 init_56_arg_1 = var_54; [L112] state_55 = init_56_arg_1 [L113] SORT_3 init_58_arg_1 = var_15; [L114] state_57 = init_58_arg_1 [L115] SORT_3 init_60_arg_1 = var_15; [L116] state_59 = init_60_arg_1 [L117] SORT_3 init_62_arg_1 = var_15; [L118] state_61 = init_62_arg_1 [L119] SORT_3 init_64_arg_1 = var_15; [L120] state_63 = init_64_arg_1 [L121] SORT_3 init_66_arg_1 = var_15; [L122] state_65 = init_66_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_186 = __VERIFIER_nondet_uchar() [L129] input_187 = __VERIFIER_nondet_uchar() [L130] input_188 = __VERIFIER_nondet_uchar() [L131] input_196 = __VERIFIER_nondet_uchar() [L132] input_206 = __VERIFIER_nondet_uchar() [L133] input_207 = __VERIFIER_nondet_uchar() [L134] input_208 = __VERIFIER_nondet_uchar() [L135] input_211 = __VERIFIER_nondet_uchar() [L136] input_230 = __VERIFIER_nondet_uchar() [L137] input_231 = __VERIFIER_nondet_uchar() [L138] input_232 = __VERIFIER_nondet_uchar() [L139] input_235 = __VERIFIER_nondet_uchar() [L140] input_237 = __VERIFIER_nondet_uchar() [L141] input_251 = __VERIFIER_nondet_uchar() [L142] input_252 = __VERIFIER_nondet_uchar() [L143] input_253 = __VERIFIER_nondet_uchar() [L146] SORT_7 var_11_arg_0 = state_9; [L147] SORT_1 var_11 = var_11_arg_0 >> 0; [L148] SORT_7 var_12_arg_0 = state_9; [L149] SORT_1 var_12 = var_12_arg_0 >> 1; [L150] SORT_1 var_13_arg_0 = var_11; [L151] SORT_1 var_13_arg_1 = var_12; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_13_arg_0=0, var_13_arg_1=0, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L152] EXPR var_13_arg_0 | var_13_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L152] SORT_1 var_13 = var_13_arg_0 | var_13_arg_1; [L153] SORT_1 var_14_arg_0 = var_13; [L154] SORT_1 var_14 = ~var_14_arg_0; [L155] SORT_3 var_18_arg_0 = state_16; [L156] SORT_1 var_18 = var_18_arg_0 >> 1; [L157] SORT_3 var_21_arg_0 = state_19; [L158] SORT_7 var_21 = var_21_arg_0 >> 2; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L159] EXPR var_21 & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L159] var_21 = var_21 & mask_SORT_7 [L160] SORT_3 var_22_arg_0 = state_16; [L161] SORT_7 var_22 = var_22_arg_0 >> 2; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_22=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L162] EXPR var_22 & mask_SORT_7 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_18=0, var_197=31, var_21=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L162] var_22 = var_22 & mask_SORT_7 [L163] SORT_7 var_23_arg_0 = var_21; [L164] SORT_7 var_23_arg_1 = var_22; [L165] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L166] SORT_1 var_24_arg_0 = var_18; [L167] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24_arg_0=0, var_24_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L168] EXPR var_24_arg_0 | var_24_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L168] SORT_1 var_24 = var_24_arg_0 | var_24_arg_1; [L169] SORT_3 var_25_arg_0 = state_16; [L170] SORT_1 var_25 = var_25_arg_0 >> 2; [L171] SORT_3 var_27_arg_0 = state_19; [L172] SORT_26 var_27 = var_27_arg_0 >> 3; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L173] EXPR var_27 & mask_SORT_26 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L173] var_27 = var_27 & mask_SORT_26 [L174] SORT_3 var_28_arg_0 = state_16; [L175] SORT_26 var_28 = var_28_arg_0 >> 3; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_28=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L176] EXPR var_28 & mask_SORT_26 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_25=0, var_27=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L176] var_28 = var_28 & mask_SORT_26 [L177] SORT_26 var_29_arg_0 = var_27; [L178] SORT_26 var_29_arg_1 = var_28; [L179] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L180] SORT_1 var_30_arg_0 = var_25; [L181] SORT_1 var_30_arg_1 = var_29; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_30_arg_0=0, var_30_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L182] EXPR var_30_arg_0 | var_30_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_24=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L182] SORT_1 var_30 = var_30_arg_0 | var_30_arg_1; [L183] SORT_1 var_31_arg_0 = var_24; [L184] SORT_1 var_31_arg_1 = var_30; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31_arg_0=1, var_31_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L185] EXPR var_31_arg_0 & var_31_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L185] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L186] SORT_3 var_32_arg_0 = state_16; [L187] SORT_1 var_32 = var_32_arg_0 >> 3; [L188] SORT_3 var_33_arg_0 = state_19; [L189] SORT_1 var_33 = var_33_arg_0 >> 4; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L190] EXPR var_33 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L190] var_33 = var_33 & mask_SORT_1 [L191] SORT_3 var_34_arg_0 = state_16; [L192] SORT_1 var_34 = var_34_arg_0 >> 4; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_34=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L193] EXPR var_34 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_32=0, var_33=0, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L193] var_34 = var_34 & mask_SORT_1 [L194] SORT_1 var_35_arg_0 = var_33; [L195] SORT_1 var_35_arg_1 = var_34; [L196] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L197] SORT_1 var_36_arg_0 = var_32; [L198] SORT_1 var_36_arg_1 = var_35; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_36_arg_0=0, var_36_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L199] EXPR var_36_arg_0 | var_36_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_31=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L199] SORT_1 var_36 = var_36_arg_0 | var_36_arg_1; [L200] SORT_1 var_37_arg_0 = var_31; [L201] SORT_1 var_37_arg_1 = var_36; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_37_arg_0=1, var_37_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L202] EXPR var_37_arg_0 & var_37_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_14=-1, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L202] SORT_1 var_37 = var_37_arg_0 & var_37_arg_1; [L203] SORT_1 var_38_arg_0 = var_14; [L204] SORT_1 var_38_arg_1 = var_37; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_38_arg_0=-1, var_38_arg_1=1, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L205] EXPR var_38_arg_0 | var_38_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L205] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L206] SORT_1 var_42_arg_0 = var_38; [L207] SORT_1 var_42 = ~var_42_arg_0; [L208] SORT_1 var_43_arg_0 = var_41; [L209] SORT_1 var_43_arg_1 = var_42; VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_43_arg_0=1, var_43_arg_1=-1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L210] EXPR var_43_arg_0 & var_43_arg_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L210] SORT_1 var_43 = var_43_arg_0 & var_43_arg_1; [L211] EXPR var_43 & mask_SORT_1 VAL [mask_SORT_108=15, mask_SORT_1=1, mask_SORT_26=3, mask_SORT_3=31, mask_SORT_7=7, state_16=0, state_19=0, state_45=0, state_47=0, state_49=0, state_52=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_9=0, var_125=7, var_130=6, var_15=0, var_167=0, var_197=31, var_41=1, var_51=0, var_68=2, var_72=1, var_77=4, var_79=5, var_83=3, var_8=0, var_95=2] [L211] var_43 = var_43 & mask_SORT_1 [L212] SORT_1 bad_44_arg_0 = var_43; [L213] CALL __VERIFIER_assert(!(bad_44_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 571 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5698 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5698 mSDsluCounter, 35274 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29442 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1229 IncrementalHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 5832 mSDtfsCounter, 1229 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=698occurred in iteration=7, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 584 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 441 ConstructedInterpolants, 0 QuantifiedInterpolants, 1658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 00:57:57,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.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 d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:58:00,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:58:00,127 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-12 00:58:00,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:58:00,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:58:00,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:58:00,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:58:00,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:58:00,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:58:00,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:58:00,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:58:00,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:58:00,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:58:00,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:58:00,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:58:00,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:58:00,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:58:00,183 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:58:00,183 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:58:00,183 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:58:00,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:58:00,188 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 00:58:00,188 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 00:58:00,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:58:00,188 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 00:58:00,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:58:00,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:58:00,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:58:00,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:58:00,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:58:00,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:58:00,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:58:00,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:58:00,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:58:00,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:58:00,192 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 00:58:00,192 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 00:58:00,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:58:00,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:58:00,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:58:00,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:58:00,194 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 -> d570de8a468b2e5d7e18a67170da2d8f06202ccdf10baa0799e3c0763140866e [2024-11-12 00:58:00,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:58:00,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:58:00,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:58:00,558 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:58:00,559 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:58:00,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-11-12 00:58:02,168 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:58:02,435 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:58:02,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-11-12 00:58:02,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c374978/4176f1aaa84b4bc0960a7d2552734881/FLAG5c395deb7 [2024-11-12 00:58:02,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c374978/4176f1aaa84b4bc0960a7d2552734881 [2024-11-12 00:58:02,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:58:02,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:58:02,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:58:02,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:58:02,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:58:02,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:58:02" (1/1) ... [2024-11-12 00:58:02,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693e8dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:02, skipping insertion in model container [2024-11-12 00:58:02,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:58:02" (1/1) ... [2024-11-12 00:58:02,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:58:02,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2024-11-12 00:58:03,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:58:03,030 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:58:03,043 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p12.c[1259,1272] [2024-11-12 00:58:03,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:58:03,180 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:58:03,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03 WrapperNode [2024-11-12 00:58:03,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:58:03,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:58:03,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:58:03,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:58:03,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,324 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1117 [2024-11-12 00:58:03,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:58:03,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:58:03,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:58:03,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:58:03,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,344 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,421 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 00:58:03,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:58:03,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:58:03,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:58:03,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:58:03,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (1/1) ... [2024-11-12 00:58:03,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:58:03,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:58:03,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:58:03,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:58:03,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:58:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 00:58:03,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:58:03,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:58:03,871 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:58:03,873 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:58:05,292 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-12 00:58:05,296 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:58:05,323 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:58:05,323 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:58:05,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:58:05 BoogieIcfgContainer [2024-11-12 00:58:05,332 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:58:05,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:58:05,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:58:05,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:58:05,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:58:02" (1/3) ... [2024-11-12 00:58:05,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1231d4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:58:05, skipping insertion in model container [2024-11-12 00:58:05,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:58:03" (2/3) ... [2024-11-12 00:58:05,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1231d4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:58:05, skipping insertion in model container [2024-11-12 00:58:05,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:58:05" (3/3) ... [2024-11-12 00:58:05,348 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p12.c [2024-11-12 00:58:05,370 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:58:05,370 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:58:05,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:58:05,442 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;@13f4c923, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:58:05,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:58:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:05,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 00:58:05,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:05,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 00:58:05,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:05,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-12 00:58:05,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:58:05,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078111071] [2024-11-12 00:58:05,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:05,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:58:05,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:58:05,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 00:58:05,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 00:58:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:05,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 00:58:05,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:58:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:06,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 00:58:06,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:58:06,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078111071] [2024-11-12 00:58:06,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078111071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:58:06,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:58:06,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:58:06,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473560770] [2024-11-12 00:58:06,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:58:06,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:58:06,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:58:06,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:58:06,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:58:06,083 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:06,172 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-12 00:58:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:58:06,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-12 00:58:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:06,181 INFO L225 Difference]: With dead ends: 18 [2024-11-12 00:58:06,181 INFO L226 Difference]: Without dead ends: 10 [2024-11-12 00:58:06,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:58:06,187 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:06,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 00:58:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-12 00:58:06,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-12 00:58:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-12 00:58:06,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-12 00:58:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:06,217 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-12 00:58:06,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-12 00:58:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 00:58:06,218 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:06,218 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-12 00:58:06,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 00:58:06,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:58:06,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:06,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-12 00:58:06,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:58:06,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48936396] [2024-11-12 00:58:06,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:58:06,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:58:06,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:58:06,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 00:58:06,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 00:58:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:58:06,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-12 00:58:06,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:58:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:07,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:58:21,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:21,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 00:58:21,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48936396] [2024-11-12 00:58:21,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48936396] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:58:21,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 00:58:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 00:58:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759632565] [2024-11-12 00:58:21,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 00:58:21,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 00:58:21,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 00:58:21,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 00:58:21,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-11-12 00:58:21,244 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:58:21,817 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-12 00:58:21,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 00:58:21,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-12 00:58:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:58:21,818 INFO L225 Difference]: With dead ends: 15 [2024-11-12 00:58:21,818 INFO L226 Difference]: Without dead ends: 13 [2024-11-12 00:58:21,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=35, Invalid=74, Unknown=1, NotChecked=0, Total=110 [2024-11-12 00:58:21,819 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:58:21,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:58:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-12 00:58:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-12 00:58:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-11-12 00:58:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-12 00:58:21,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-12 00:58:21,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:58:21,826 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-12 00:58:21,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:58:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-12 00:58:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 00:58:21,827 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:58:21,827 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-12 00:58:21,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 00:58:22,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:58:22,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:58:22,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:58:22,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-12 00:58:22,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 00:58:22,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089309850] [2024-11-12 00:58:22,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 00:58:22,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 00:58:22,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 00:58:22,034 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 00:58:22,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 00:58:22,672 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 00:58:22,672 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 00:58:22,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-12 00:58:22,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:58:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:58:23,213 INFO L312 TraceCheckSpWp]: Computing backward predicates...