./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:04:05,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:04:05,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 07:04:05,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:04:05,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:04:05,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:04:05,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:04:05,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:04:05,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:04:05,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:04:05,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:04:05,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:04:05,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:04:05,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:04:05,904 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:04:05,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:04:05,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:04:05,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:04:05,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:04:05,907 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:04:05,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:04:05,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:04:05,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:04:05,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:04:05,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:04:05,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:04:05,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:04:05,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:04:05,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:04:05,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:05,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:04:05,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:04:05,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:04:05,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:04:05,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:04:05,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:04:05,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:04:05,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:04:05,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:04:05,918 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 [2024-10-11 07:04:06,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:04:06,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:04:06,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:04:06,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:04:06,204 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:04:06,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-10-11 07:04:07,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:04:08,038 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:04:08,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-10-11 07:04:08,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3f03566e9/18921284f38e4211b053462a6b3b8676/FLAG4b70da23f [2024-10-11 07:04:08,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3f03566e9/18921284f38e4211b053462a6b3b8676 [2024-10-11 07:04:08,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:04:08,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:04:08,103 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:08,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:04:08,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:04:08,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:08,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8f79ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08, skipping insertion in model container [2024-10-11 07:04:08,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:08,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:04:08,379 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c[1259,1272] [2024-10-11 07:04:08,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:08,678 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:04:08,687 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c[1259,1272] [2024-10-11 07:04:08,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:08,797 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:04:08,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08 WrapperNode [2024-10-11 07:04:08,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:08,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:08,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:04:08,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:04:08,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:08,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:09,199 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2173 [2024-10-11 07:04:09,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:09,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:04:09,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:04:09,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:04:09,215 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:09,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:09,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:09,334 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:04:09,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:09,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:09,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:09,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:09,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:09,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:09,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:04:09,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:04:09,552 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:04:09,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:04:09,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (1/1) ... [2024-10-11 07:04:09,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:04:09,590 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:04:09,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:04:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:04:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:04:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:04:09,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:04:09,945 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:04:09,949 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:04:12,159 INFO L? ?]: Removed 1359 outVars from TransFormulas that were not future-live. [2024-10-11 07:04:12,160 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:04:12,235 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:04:12,236 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:04:12,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:12 BoogieIcfgContainer [2024-10-11 07:04:12,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:04:12,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:04:12,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:04:12,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:04:12,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:04:08" (1/3) ... [2024-10-11 07:04:12,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa6f174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:12, skipping insertion in model container [2024-10-11 07:04:12,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:08" (2/3) ... [2024-10-11 07:04:12,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa6f174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:12, skipping insertion in model container [2024-10-11 07:04:12,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:12" (3/3) ... [2024-10-11 07:04:12,252 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-10-11 07:04:12,270 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:04:12,270 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:04:12,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:04:12,363 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;@4834d370, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:04:12,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:04:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 548 states, 546 states have (on average 1.5018315018315018) internal successors, (820), 547 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 07:04:12,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:12,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:12,383 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:12,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash 875510470, now seen corresponding path program 1 times [2024-10-11 07:04:12,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:12,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940357648] [2024-10-11 07:04:12,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:13,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:13,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940357648] [2024-10-11 07:04:13,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940357648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:13,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:13,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:04:13,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018916398] [2024-10-11 07:04:13,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:13,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:13,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:13,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:13,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:13,315 INFO L87 Difference]: Start difference. First operand has 548 states, 546 states have (on average 1.5018315018315018) internal successors, (820), 547 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:13,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:13,473 INFO L93 Difference]: Finished difference Result 1044 states and 1564 transitions. [2024-10-11 07:04:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:13,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 07:04:13,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:13,495 INFO L225 Difference]: With dead ends: 1044 [2024-10-11 07:04:13,495 INFO L226 Difference]: Without dead ends: 549 [2024-10-11 07:04:13,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:13,506 INFO L432 NwaCegarLoop]: 815 mSDtfsCounter, 0 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2440 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:13,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2440 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:04:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-10-11 07:04:13,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2024-10-11 07:04:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4963503649635037) internal successors, (820), 548 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 820 transitions. [2024-10-11 07:04:13,588 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 820 transitions. Word has length 52 [2024-10-11 07:04:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:13,588 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 820 transitions. [2024-10-11 07:04:13,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 820 transitions. [2024-10-11 07:04:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 07:04:13,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:13,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:13,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:04:13,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1372716259, now seen corresponding path program 1 times [2024-10-11 07:04:13,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:13,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669690116] [2024-10-11 07:04:13,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:13,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:13,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669690116] [2024-10-11 07:04:13,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669690116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:13,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:13,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:04:13,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45119283] [2024-10-11 07:04:13,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:13,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:13,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:13,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:13,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:13,867 INFO L87 Difference]: Start difference. First operand 549 states and 820 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:13,909 INFO L93 Difference]: Finished difference Result 1047 states and 1564 transitions. [2024-10-11 07:04:13,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:13,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2024-10-11 07:04:13,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:13,914 INFO L225 Difference]: With dead ends: 1047 [2024-10-11 07:04:13,916 INFO L226 Difference]: Without dead ends: 551 [2024-10-11 07:04:13,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:13,921 INFO L432 NwaCegarLoop]: 815 mSDtfsCounter, 0 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:13,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2437 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:04:13,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-11 07:04:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 551. [2024-10-11 07:04:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 550 states have (on average 1.4945454545454546) internal successors, (822), 550 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 822 transitions. [2024-10-11 07:04:13,951 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 822 transitions. Word has length 53 [2024-10-11 07:04:13,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:13,952 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 822 transitions. [2024-10-11 07:04:13,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 822 transitions. [2024-10-11 07:04:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 07:04:13,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:13,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:13,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:04:13,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:13,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1493434561, now seen corresponding path program 1 times [2024-10-11 07:04:13,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:13,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122527107] [2024-10-11 07:04:13,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:13,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122527107] [2024-10-11 07:04:14,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122527107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:14,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:14,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:04:14,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504789208] [2024-10-11 07:04:14,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:14,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:04:14,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:14,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:04:14,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:04:14,474 INFO L87 Difference]: Start difference. First operand 551 states and 822 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:14,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:14,606 INFO L93 Difference]: Finished difference Result 1063 states and 1586 transitions. [2024-10-11 07:04:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:04:14,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 07:04:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:14,609 INFO L225 Difference]: With dead ends: 1063 [2024-10-11 07:04:14,609 INFO L226 Difference]: Without dead ends: 565 [2024-10-11 07:04:14,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:04:14,612 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 10 mSDsluCounter, 4035 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4844 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:14,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4844 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:04:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-10-11 07:04:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 564. [2024-10-11 07:04:14,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 1.4937833037300177) internal successors, (841), 563 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 841 transitions. [2024-10-11 07:04:14,630 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 841 transitions. Word has length 54 [2024-10-11 07:04:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:14,630 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 841 transitions. [2024-10-11 07:04:14,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 841 transitions. [2024-10-11 07:04:14,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 07:04:14,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:14,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:14,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:04:14,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:14,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:14,636 INFO L85 PathProgramCache]: Analyzing trace with hash 26114047, now seen corresponding path program 1 times [2024-10-11 07:04:14,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:14,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036125008] [2024-10-11 07:04:14,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:14,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036125008] [2024-10-11 07:04:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036125008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:04:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801610537] [2024-10-11 07:04:14,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:14,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:04:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:04:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:04:14,826 INFO L87 Difference]: Start difference. First operand 564 states and 841 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:14,877 INFO L93 Difference]: Finished difference Result 1085 states and 1618 transitions. [2024-10-11 07:04:14,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:04:14,877 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-11 07:04:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:14,880 INFO L225 Difference]: With dead ends: 1085 [2024-10-11 07:04:14,880 INFO L226 Difference]: Without dead ends: 574 [2024-10-11 07:04:14,882 INFO L431 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-10-11 07:04:14,885 INFO L432 NwaCegarLoop]: 814 mSDtfsCounter, 8 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3247 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:14,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3247 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:04:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-11 07:04:14,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2024-10-11 07:04:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.4921465968586387) internal successors, (855), 573 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 855 transitions. [2024-10-11 07:04:14,899 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 855 transitions. Word has length 55 [2024-10-11 07:04:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:14,900 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 855 transitions. [2024-10-11 07:04:14,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 855 transitions. [2024-10-11 07:04:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 07:04:14,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:14,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:14,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:04:14,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:14,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:14,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2053507068, now seen corresponding path program 1 times [2024-10-11 07:04:14,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:14,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658873974] [2024-10-11 07:04:14,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:14,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:14,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:15,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:15,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658873974] [2024-10-11 07:04:15,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658873974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:15,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:15,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 07:04:15,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438400259] [2024-10-11 07:04:15,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:15,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 07:04:15,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:15,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 07:04:15,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:04:15,704 INFO L87 Difference]: Start difference. First operand 574 states and 855 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:15,974 INFO L93 Difference]: Finished difference Result 1105 states and 1645 transitions. [2024-10-11 07:04:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 07:04:15,975 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-11 07:04:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:15,978 INFO L225 Difference]: With dead ends: 1105 [2024-10-11 07:04:15,978 INFO L226 Difference]: Without dead ends: 584 [2024-10-11 07:04:15,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-11 07:04:15,980 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 801 mSDsluCounter, 5581 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 6379 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:15,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 6379 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:04:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-10-11 07:04:15,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 581. [2024-10-11 07:04:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.4913793103448276) internal successors, (865), 580 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 865 transitions. [2024-10-11 07:04:15,992 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 865 transitions. Word has length 56 [2024-10-11 07:04:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:15,992 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 865 transitions. [2024-10-11 07:04:15,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 865 transitions. [2024-10-11 07:04:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 07:04:15,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:15,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:15,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:04:15,995 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:15,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:15,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1125341834, now seen corresponding path program 1 times [2024-10-11 07:04:15,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:15,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440263311] [2024-10-11 07:04:15,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:15,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:16,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:16,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440263311] [2024-10-11 07:04:16,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440263311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:16,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:16,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:04:16,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445005755] [2024-10-11 07:04:16,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:16,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:04:16,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:16,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:04:16,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:04:16,412 INFO L87 Difference]: Start difference. First operand 581 states and 865 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:16,562 INFO L93 Difference]: Finished difference Result 1111 states and 1654 transitions. [2024-10-11 07:04:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:04:16,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-11 07:04:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:16,565 INFO L225 Difference]: With dead ends: 1111 [2024-10-11 07:04:16,566 INFO L226 Difference]: Without dead ends: 583 [2024-10-11 07:04:16,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:04:16,567 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 811 mSDsluCounter, 4019 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 4826 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:16,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 4826 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:04:16,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-11 07:04:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2024-10-11 07:04:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.4896907216494846) internal successors, (867), 582 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 867 transitions. [2024-10-11 07:04:16,581 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 867 transitions. Word has length 56 [2024-10-11 07:04:16,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:16,582 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 867 transitions. [2024-10-11 07:04:16,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 867 transitions. [2024-10-11 07:04:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 07:04:16,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:16,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:16,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:04:16,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:16,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 445972454, now seen corresponding path program 1 times [2024-10-11 07:04:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:16,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37954638] [2024-10-11 07:04:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:16,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:16,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:16,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37954638] [2024-10-11 07:04:16,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37954638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:16,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:16,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:04:16,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793904889] [2024-10-11 07:04:16,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:16,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:04:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:16,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:04:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:04:16,925 INFO L87 Difference]: Start difference. First operand 583 states and 867 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:17,084 INFO L93 Difference]: Finished difference Result 1322 states and 1961 transitions. [2024-10-11 07:04:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:04:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-10-11 07:04:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:17,088 INFO L225 Difference]: With dead ends: 1322 [2024-10-11 07:04:17,088 INFO L226 Difference]: Without dead ends: 792 [2024-10-11 07:04:17,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:04:17,090 INFO L432 NwaCegarLoop]: 803 mSDtfsCounter, 1359 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 3204 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:17,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 3204 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:04:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-10-11 07:04:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 587. [2024-10-11 07:04:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 1.4897610921501707) internal successors, (873), 586 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 873 transitions. [2024-10-11 07:04:17,106 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 873 transitions. Word has length 57 [2024-10-11 07:04:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:17,107 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 873 transitions. [2024-10-11 07:04:17,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 873 transitions. [2024-10-11 07:04:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 07:04:17,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:17,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:17,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:04:17,108 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:17,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash 798755081, now seen corresponding path program 1 times [2024-10-11 07:04:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:04:17,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681589377] [2024-10-11 07:04:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:04:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:04:17,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:04:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:04:17,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:04:17,321 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:04:17,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:04:17,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:04:17,327 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:04:17,400 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:04:17,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:04:17 BoogieIcfgContainer [2024-10-11 07:04:17,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:04:17,405 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:04:17,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:04:17,405 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:04:17,405 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:12" (3/4) ... [2024-10-11 07:04:17,407 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:04:17,408 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:04:17,409 INFO L158 Benchmark]: Toolchain (without parser) took 9309.12ms. Allocated memory was 155.2MB in the beginning and 492.8MB in the end (delta: 337.6MB). Free memory was 126.0MB in the beginning and 160.8MB in the end (delta: -34.8MB). Peak memory consumption was 303.9MB. Max. memory is 16.1GB. [2024-10-11 07:04:17,410 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:04:17,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.71ms. Allocated memory is still 155.2MB. Free memory was 126.0MB in the beginning and 78.8MB in the end (delta: 47.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-11 07:04:17,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 400.08ms. Allocated memory is still 155.2MB. Free memory was 78.8MB in the beginning and 88.9MB in the end (delta: -10.1MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2024-10-11 07:04:17,411 INFO L158 Benchmark]: Boogie Preprocessor took 351.19ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 88.9MB in the beginning and 170.9MB in the end (delta: -82.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-10-11 07:04:17,411 INFO L158 Benchmark]: RCFGBuilder took 2687.67ms. Allocated memory was 243.3MB in the beginning and 396.4MB in the end (delta: 153.1MB). Free memory was 170.9MB in the beginning and 283.5MB in the end (delta: -112.6MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2024-10-11 07:04:17,412 INFO L158 Benchmark]: TraceAbstraction took 5162.38ms. Allocated memory was 396.4MB in the beginning and 492.8MB in the end (delta: 96.5MB). Free memory was 282.5MB in the beginning and 160.8MB in the end (delta: 121.7MB). Peak memory consumption was 218.2MB. Max. memory is 16.1GB. [2024-10-11 07:04:17,412 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 492.8MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:04:17,413 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 68.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 695.71ms. Allocated memory is still 155.2MB. Free memory was 126.0MB in the beginning and 78.8MB in the end (delta: 47.2MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 400.08ms. Allocated memory is still 155.2MB. Free memory was 78.8MB in the beginning and 88.9MB in the end (delta: -10.1MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 351.19ms. Allocated memory was 155.2MB in the beginning and 243.3MB in the end (delta: 88.1MB). Free memory was 88.9MB in the beginning and 170.9MB in the end (delta: -82.0MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2687.67ms. Allocated memory was 243.3MB in the beginning and 396.4MB in the end (delta: 153.1MB). Free memory was 170.9MB in the beginning and 283.5MB in the end (delta: -112.6MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5162.38ms. Allocated memory was 396.4MB in the beginning and 492.8MB in the end (delta: 96.5MB). Free memory was 282.5MB in the beginning and 160.8MB in the end (delta: 121.7MB). Peak memory consumption was 218.2MB. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 492.8MB. Free memory is still 160.8MB. 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 189, overapproximation of bitwiseAnd at line 194. 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_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_18 mask_SORT_18 = (SORT_18)-1 >> (sizeof(SORT_18) * 8 - 2); [L39] const SORT_18 msb_SORT_18 = (SORT_18)1 << (2 - 1); [L41] const SORT_84 mask_SORT_84 = (SORT_84)-1 >> (sizeof(SORT_84) * 8 - 4); [L42] const SORT_84 msb_SORT_84 = (SORT_84)1 << (4 - 1); [L44] const SORT_148 mask_SORT_148 = (SORT_148)-1 >> (sizeof(SORT_148) * 8 - 32); [L45] const SORT_148 msb_SORT_148 = (SORT_148)1 << (32 - 1); [L47] const SORT_5 var_7 = 0; [L48] const SORT_10 var_12 = 3; [L49] const SORT_10 var_15 = 1; [L50] const SORT_10 var_24 = 0; [L51] const SORT_1 var_28 = 0; [L52] const SORT_3 var_30 = 0; [L53] const SORT_1 var_38 = 1; [L54] const SORT_10 var_62 = 2; [L55] const SORT_10 var_70 = 4; [L56] const SORT_10 var_72 = 5; [L57] const SORT_10 var_100 = 7; [L58] const SORT_10 var_105 = 6; [L59] const SORT_148 var_150 = 0; [L60] const SORT_3 var_165 = 2; [L61] const SORT_3 var_187 = 31; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_5 input_6; [L66] SORT_3 input_176; [L67] SORT_3 input_177; [L68] SORT_3 input_178; [L69] SORT_3 input_186; [L70] SORT_3 input_195; [L71] SORT_3 input_196; [L72] SORT_3 input_197; [L73] SORT_3 input_200; [L74] SORT_3 input_219; [L75] SORT_3 input_220; [L76] SORT_3 input_221; [L77] SORT_3 input_224; [L78] SORT_3 input_226; [L79] SORT_18 input_240; [L80] SORT_18 input_241; [L81] SORT_18 input_242; [L83] EXPR __VERIFIER_nondet_ushort() & mask_SORT_5 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L83] SORT_5 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_5; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L84] SORT_10 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L85] SORT_3 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L86] SORT_3 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L87] SORT_3 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L88] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L89] SORT_3 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L90] SORT_3 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L91] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L92] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L93] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L94] SORT_3 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5, var_7=0] [L95] SORT_3 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L97] SORT_5 init_9_arg_1 = var_7; [L98] state_8 = init_9_arg_1 [L99] SORT_10 init_26_arg_1 = var_24; [L100] state_25 = init_26_arg_1 [L101] SORT_3 init_32_arg_1 = var_30; [L102] state_31 = init_32_arg_1 [L103] SORT_3 init_43_arg_1 = var_30; [L104] state_42 = init_43_arg_1 [L105] SORT_3 init_45_arg_1 = var_30; [L106] state_44 = init_45_arg_1 [L107] SORT_1 init_47_arg_1 = var_28; [L108] state_46 = init_47_arg_1 [L109] SORT_3 init_49_arg_1 = var_30; [L110] state_48 = init_49_arg_1 [L111] SORT_3 init_51_arg_1 = var_30; [L112] state_50 = init_51_arg_1 [L113] SORT_3 init_53_arg_1 = var_30; [L114] state_52 = init_53_arg_1 [L115] SORT_3 init_55_arg_1 = var_30; [L116] state_54 = init_55_arg_1 [L117] SORT_3 init_57_arg_1 = var_30; [L118] state_56 = init_57_arg_1 [L119] SORT_3 init_59_arg_1 = var_30; [L120] state_58 = init_59_arg_1 [L121] SORT_3 init_61_arg_1 = var_30; [L122] state_60 = init_61_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L125] input_2 = __VERIFIER_nondet_uchar() [L126] input_4 = __VERIFIER_nondet_uchar() [L127] input_6 = __VERIFIER_nondet_ushort() [L128] input_176 = __VERIFIER_nondet_uchar() [L129] input_177 = __VERIFIER_nondet_uchar() [L130] input_178 = __VERIFIER_nondet_uchar() [L131] input_186 = __VERIFIER_nondet_uchar() [L132] input_195 = __VERIFIER_nondet_uchar() [L133] input_196 = __VERIFIER_nondet_uchar() [L134] input_197 = __VERIFIER_nondet_uchar() [L135] input_200 = __VERIFIER_nondet_uchar() [L136] input_219 = __VERIFIER_nondet_uchar() [L137] input_220 = __VERIFIER_nondet_uchar() [L138] input_221 = __VERIFIER_nondet_uchar() [L139] input_224 = __VERIFIER_nondet_uchar() [L140] input_226 = __VERIFIER_nondet_uchar() [L141] input_240 = __VERIFIER_nondet_uchar() [L142] input_241 = __VERIFIER_nondet_uchar() [L143] input_242 = __VERIFIER_nondet_uchar() [L146] SORT_5 var_11_arg_0 = state_8; [L147] SORT_10 var_11 = var_11_arg_0 >> 9; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L148] EXPR var_11 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_12=3, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L148] var_11 = var_11 & mask_SORT_10 [L149] SORT_10 var_13_arg_0 = var_11; [L150] SORT_10 var_13_arg_1 = var_12; [L151] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L152] SORT_5 var_14_arg_0 = state_8; [L153] SORT_10 var_14 = var_14_arg_0 >> 0; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L154] EXPR var_14 & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L154] var_14 = var_14 & mask_SORT_10 [L155] SORT_10 var_16_arg_0 = var_14; [L156] SORT_10 var_16_arg_1 = var_15; [L157] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L158] SORT_1 var_17_arg_0 = var_13; [L159] SORT_1 var_17_arg_1 = var_16; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17_arg_0=0, var_17_arg_1=0, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L160] EXPR var_17_arg_0 & var_17_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L160] SORT_1 var_17 = var_17_arg_0 & var_17_arg_1; [L161] SORT_5 var_19_arg_0 = state_8; [L162] SORT_18 var_19 = var_19_arg_0 >> 7; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L163] EXPR var_19 & mask_SORT_18 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L163] var_19 = var_19 & mask_SORT_18 [L164] SORT_5 var_20_arg_0 = state_8; [L165] SORT_18 var_20 = var_20_arg_0 >> 5; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L166] EXPR var_20 & mask_SORT_18 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_17=0, var_187=31, var_19=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L166] var_20 = var_20 & mask_SORT_18 [L167] SORT_18 var_21_arg_0 = var_19; [L168] SORT_18 var_21_arg_1 = var_20; [L169] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L170] SORT_1 var_22_arg_0 = var_17; [L171] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_22_arg_0=0, var_22_arg_1=1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L172] EXPR var_22_arg_0 & var_22_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L172] SORT_1 var_22 = var_22_arg_0 & var_22_arg_1; [L173] SORT_1 var_23_arg_0 = var_22; [L174] SORT_1 var_23 = ~var_23_arg_0; [L175] SORT_10 var_27_arg_0 = state_25; [L176] SORT_1 var_27 = var_27_arg_0 >> 2; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_27=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L177] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L177] var_27 = var_27 & mask_SORT_1 [L178] SORT_1 var_29_arg_0 = var_27; [L179] SORT_1 var_29_arg_1 = var_28; [L180] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L181] SORT_3 var_33_arg_0 = state_31; [L182] SORT_3 var_33_arg_1 = var_30; [L183] SORT_1 var_33 = var_33_arg_0 == var_33_arg_1; [L184] SORT_1 var_34_arg_0 = var_29; [L185] SORT_1 var_34_arg_1 = var_33; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_34_arg_0=1, var_34_arg_1=1, var_38=1, var_62=2, var_70=4, var_72=5] [L186] EXPR var_34_arg_0 | var_34_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_23=-1, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L186] SORT_1 var_34 = var_34_arg_0 | var_34_arg_1; [L187] SORT_1 var_35_arg_0 = var_23; [L188] SORT_1 var_35_arg_1 = var_34; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_35_arg_0=-1, var_35_arg_1=1, var_38=1, var_62=2, var_70=4, var_72=5] [L189] EXPR var_35_arg_0 | var_35_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L189] SORT_1 var_35 = var_35_arg_0 | var_35_arg_1; [L190] SORT_1 var_39_arg_0 = var_35; [L191] SORT_1 var_39 = ~var_39_arg_0; [L192] SORT_1 var_40_arg_0 = var_38; [L193] SORT_1 var_40_arg_1 = var_39; VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_40_arg_0=1, var_40_arg_1=-1, var_62=2, var_70=4, var_72=5] [L194] EXPR var_40_arg_0 & var_40_arg_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L194] SORT_1 var_40 = var_40_arg_0 & var_40_arg_1; [L195] EXPR var_40 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_18=3, mask_SORT_1=1, mask_SORT_3=31, mask_SORT_84=15, state_25=0, state_31=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_60=0, state_8=0, var_100=7, var_105=6, var_11=0, var_12=3, var_13=0, var_14=0, var_150=0, var_15=1, var_165=2, var_187=31, var_20=0, var_24=0, var_28=0, var_30=0, var_38=1, var_62=2, var_70=4, var_72=5] [L195] var_40 = var_40 & mask_SORT_1 [L196] SORT_1 bad_41_arg_0 = var_40; [L197] CALL __VERIFIER_assert(!(bad_41_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 548 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2989 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2989 mSDsluCounter, 27377 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21716 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 428 IncrementalHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 5661 mSDtfsCounter, 428 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=587occurred in iteration=7, InterpolantAutomatonStates: 45, 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, 209 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 376 ConstructedInterpolants, 0 QuantifiedInterpolants, 922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:04:17,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:04:19,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:04:19,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 07:04:19,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:04:19,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:04:19,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:04:19,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:04:19,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:04:19,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:04:19,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:04:19,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:04:19,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:04:19,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:04:19,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:04:19,863 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:04:19,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:04:19,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:04:19,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:04:19,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:04:19,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:04:19,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:04:19,869 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:04:19,870 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:04:19,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:04:19,871 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:04:19,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:04:19,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:04:19,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:04:19,873 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:04:19,873 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:04:19,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:04:19,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:19,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:04:19,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:04:19,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:04:19,876 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:04:19,876 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:04:19,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:04:19,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:04:19,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:04:19,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:04:19,878 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:04:19,878 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad777bd82b2fbfc07486a835bf99ca2e475906af4a3b134d048b1c18acbc93b4 [2024-10-11 07:04:20,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:04:20,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:04:20,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:04:20,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:04:20,217 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:04:20,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-10-11 07:04:21,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:04:22,212 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:04:22,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-10-11 07:04:22,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/983b5c3f9/2a9b1e8774594472a3672ad81d410e66/FLAGdb38cca19 [2024-10-11 07:04:22,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/983b5c3f9/2a9b1e8774594472a3672ad81d410e66 [2024-10-11 07:04:22,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:04:22,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:04:22,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:22,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:04:22,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:04:22,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:22,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eda27c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22, skipping insertion in model container [2024-10-11 07:04:22,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:22,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:04:22,550 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c[1259,1272] [2024-10-11 07:04:22,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:22,773 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:04:22,784 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p11.c[1259,1272] [2024-10-11 07:04:22,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:04:22,964 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:04:22,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22 WrapperNode [2024-10-11 07:04:22,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:04:22,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:22,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:04:22,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:04:22,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,092 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1091 [2024-10-11 07:04:23,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:04:23,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:04:23,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:04:23,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:04:23,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,158 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:04:23,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,241 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:04:23,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:04:23,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:04:23,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:04:23,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (1/1) ... [2024-10-11 07:04:23,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:04:23,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:04:23,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:04:23,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:04:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:04:23,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:04:23,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:04:23,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:04:23,629 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:04:23,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:04:24,981 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-10-11 07:04:24,985 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:04:25,043 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:04:25,044 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:04:25,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:25 BoogieIcfgContainer [2024-10-11 07:04:25,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:04:25,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:04:25,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:04:25,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:04:25,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:04:22" (1/3) ... [2024-10-11 07:04:25,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aff6f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:25, skipping insertion in model container [2024-10-11 07:04:25,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:04:22" (2/3) ... [2024-10-11 07:04:25,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aff6f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:04:25, skipping insertion in model container [2024-10-11 07:04:25,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:04:25" (3/3) ... [2024-10-11 07:04:25,055 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p11.c [2024-10-11 07:04:25,070 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:04:25,071 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:04:25,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:04:25,130 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;@6b2411f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:04:25,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:04:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 07:04:25,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:25,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 07:04:25,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:25,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:25,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 07:04:25,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:25,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332913701] [2024-10-11 07:04:25,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:25,153 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:04:25,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:25,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:04:25,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:04:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:25,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 07:04:25,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:04:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:25,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:04:25,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:04:25,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332913701] [2024-10-11 07:04:25,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332913701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:04:25,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:04:25,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:04:25,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728366669] [2024-10-11 07:04:25,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:04:25,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:04:25,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:04:25,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:04:25,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:04:25,686 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:04:25,802 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 07:04:25,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:04:25,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 07:04:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:04:25,812 INFO L225 Difference]: With dead ends: 15 [2024-10-11 07:04:25,812 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 07:04:25,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:04:25,818 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:04:25,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:04:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 07:04:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 07:04:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:25,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 07:04:25,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 07:04:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:04:25,846 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 07:04:25,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:04:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 07:04:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 07:04:25,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:04:25,847 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 07:04:25,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 07:04:26,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:04:26,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:04:26,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:04:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 07:04:26,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:04:26,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633024494] [2024-10-11 07:04:26,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:26,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:04:26,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:04:26,055 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:04:26,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:04:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:26,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 07:04:26,471 INFO L278 TraceCheckSpWp]: Computing forward predicates...