./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.h_Vsa16.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vsa16.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 45e58736dd2fb3c49049c2685505c5453ccebf8bd699ff36e792e3749e9ae2f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:52:55,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:52:55,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 22:52:55,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:52:55,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:52:55,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:52:55,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:52:55,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:52:55,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:52:55,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:52:55,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:52:55,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:52:55,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:52:55,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:52:55,511 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:52:55,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:52:55,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:52:55,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 22:52:55,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:52:55,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:52:55,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:52:55,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:52:55,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:52:55,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:52:55,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:52:55,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:52:55,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:52:55,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:52:55,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:52:55,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:52:55,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:52:55,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:52:55,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:52:55,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 22:52:55,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 22:52:55,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:52:55,520 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:52:55,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:52:55,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:52:55,520 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45e58736dd2fb3c49049c2685505c5453ccebf8bd699ff36e792e3749e9ae2f9 [2024-10-12 22:52:55,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:52:55,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:52:55,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:52:55,801 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:52:55,805 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:52:55,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vsa16.c [2024-10-12 22:52:57,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:52:57,543 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:52:57,544 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vsa16.c [2024-10-12 22:52:57,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bcd4cc52/eb49f40441394084b466df15be1bee1d/FLAGc068cd358 [2024-10-12 22:52:57,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bcd4cc52/eb49f40441394084b466df15be1bee1d [2024-10-12 22:52:57,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:52:57,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:52:57,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:52:57,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:52:57,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:52:57,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:52:57" (1/1) ... [2024-10-12 22:52:57,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd71df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:57, skipping insertion in model container [2024-10-12 22:52:57,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:52:57" (1/1) ... [2024-10-12 22:52:57,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:52:57,926 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.h_Vsa16.c[1247,1260] [2024-10-12 22:52:58,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:52:58,279 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:52:58,288 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.h_Vsa16.c[1247,1260] [2024-10-12 22:52:58,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:52:58,444 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:52:58,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58 WrapperNode [2024-10-12 22:52:58,444 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:52:58,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:52:58,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:52:58,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:52:58,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:52:58,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:52:59,112 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 5355 [2024-10-12 22:52:59,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:52:59,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:52:59,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:52:59,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:52:59,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:52:59,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:52:59,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:52:59,487 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 22:52:59,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:52:59,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:52:59,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:52:59,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:52:59,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:52:59,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:53:00,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:53:00,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:53:00,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:53:00,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:53:00,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (1/1) ... [2024-10-12 22:53:00,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:53:00,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:53:00,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 22:53:00,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 22:53:00,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:53:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 22:53:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:53:00,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:53:00,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 22:53:00,150 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 22:53:00,508 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:53:00,510 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:53:04,380 INFO L? ?]: Removed 3179 outVars from TransFormulas that were not future-live. [2024-10-12 22:53:04,380 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:53:04,448 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:53:04,448 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:53:04,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:53:04 BoogieIcfgContainer [2024-10-12 22:53:04,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:53:04,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:53:04,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:53:04,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:53:04,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:52:57" (1/3) ... [2024-10-12 22:53:04,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b4d237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:53:04, skipping insertion in model container [2024-10-12 22:53:04,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:52:58" (2/3) ... [2024-10-12 22:53:04,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42b4d237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:53:04, skipping insertion in model container [2024-10-12 22:53:04,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:53:04" (3/3) ... [2024-10-12 22:53:04,454 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Vsa16.c [2024-10-12 22:53:04,478 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:53:04,478 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:53:04,585 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:53:04,592 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;@3da230f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:53:04,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:53:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 1426 states, 1419 states have (on average 1.4989429175475688) internal successors, (2127), 1420 states have internal predecessors, (2127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 22:53:04,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-12 22:53:04,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:04,611 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] [2024-10-12 22:53:04,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:04,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:04,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1792790249, now seen corresponding path program 1 times [2024-10-12 22:53:04,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:04,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217571319] [2024-10-12 22:53:04,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:04,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:05,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:05,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217571319] [2024-10-12 22:53:05,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217571319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:05,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:05,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:53:05,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190029416] [2024-10-12 22:53:05,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:05,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:53:05,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:05,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:53:05,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:53:05,264 INFO L87 Difference]: Start difference. First operand has 1426 states, 1419 states have (on average 1.4989429175475688) internal successors, (2127), 1420 states have internal predecessors, (2127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:05,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:05,485 INFO L93 Difference]: Finished difference Result 4148 states and 6222 transitions. [2024-10-12 22:53:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:53:05,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-12 22:53:05,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:05,518 INFO L225 Difference]: With dead ends: 4148 [2024-10-12 22:53:05,519 INFO L226 Difference]: Without dead ends: 2775 [2024-10-12 22:53:05,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:53:05,536 INFO L432 NwaCegarLoop]: 4124 mSDtfsCounter, 2012 mSDsluCounter, 14493 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 18617 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:05,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 18617 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:53:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2024-10-12 22:53:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 1431. [2024-10-12 22:53:05,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1423 states have (on average 1.4961349262122277) internal successors, (2129), 1424 states have internal predecessors, (2129), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 22:53:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 2139 transitions. [2024-10-12 22:53:05,667 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 2139 transitions. Word has length 42 [2024-10-12 22:53:05,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:05,667 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 2139 transitions. [2024-10-12 22:53:05,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:05,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 2139 transitions. [2024-10-12 22:53:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 22:53:05,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:05,672 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] [2024-10-12 22:53:05,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 22:53:05,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:05,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:05,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1630523804, now seen corresponding path program 1 times [2024-10-12 22:53:05,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:05,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088225585] [2024-10-12 22:53:05,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:05,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:05,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088225585] [2024-10-12 22:53:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088225585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:05,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:05,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:53:05,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317254718] [2024-10-12 22:53:05,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:05,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 22:53:05,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:05,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 22:53:05,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:53:05,797 INFO L87 Difference]: Start difference. First operand 1431 states and 2139 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:05,853 INFO L93 Difference]: Finished difference Result 2811 states and 4202 transitions. [2024-10-12 22:53:05,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 22:53:05,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-10-12 22:53:05,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:05,858 INFO L225 Difference]: With dead ends: 2811 [2024-10-12 22:53:05,859 INFO L226 Difference]: Without dead ends: 1433 [2024-10-12 22:53:05,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 22:53:05,862 INFO L432 NwaCegarLoop]: 2130 mSDtfsCounter, 0 mSDsluCounter, 4252 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6382 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:05,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6382 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 22:53:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-10-12 22:53:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1433. [2024-10-12 22:53:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1425 states have (on average 1.495438596491228) internal successors, (2131), 1426 states have internal predecessors, (2131), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 22:53:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2141 transitions. [2024-10-12 22:53:05,882 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2141 transitions. Word has length 43 [2024-10-12 22:53:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:05,883 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 2141 transitions. [2024-10-12 22:53:05,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2141 transitions. [2024-10-12 22:53:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 22:53:05,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:05,888 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] [2024-10-12 22:53:05,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 22:53:05,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:05,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash 682873826, now seen corresponding path program 1 times [2024-10-12 22:53:05,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:05,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111030440] [2024-10-12 22:53:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:05,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:06,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:06,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111030440] [2024-10-12 22:53:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111030440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:06,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:53:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070002857] [2024-10-12 22:53:06,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:06,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:53:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:06,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:53:06,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:53:06,169 INFO L87 Difference]: Start difference. First operand 1433 states and 2141 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:06,323 INFO L93 Difference]: Finished difference Result 2817 states and 4209 transitions. [2024-10-12 22:53:06,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:53:06,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-10-12 22:53:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:06,329 INFO L225 Difference]: With dead ends: 2817 [2024-10-12 22:53:06,329 INFO L226 Difference]: Without dead ends: 1437 [2024-10-12 22:53:06,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:53:06,331 INFO L432 NwaCegarLoop]: 2123 mSDtfsCounter, 2092 mSDsluCounter, 4245 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2096 SdHoareTripleChecker+Valid, 6368 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:06,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2096 Valid, 6368 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:53:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2024-10-12 22:53:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1436. [2024-10-12 22:53:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1428 states have (on average 1.4943977591036415) internal successors, (2134), 1429 states have internal predecessors, (2134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 22:53:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2144 transitions. [2024-10-12 22:53:06,350 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2144 transitions. Word has length 44 [2024-10-12 22:53:06,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:06,350 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 2144 transitions. [2024-10-12 22:53:06,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2144 transitions. [2024-10-12 22:53:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 22:53:06,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:06,355 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] [2024-10-12 22:53:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 22:53:06,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:06,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash 243099487, now seen corresponding path program 1 times [2024-10-12 22:53:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:06,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192841381] [2024-10-12 22:53:06,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:06,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:07,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:07,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192841381] [2024-10-12 22:53:07,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192841381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:07,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:07,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:53:07,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955128430] [2024-10-12 22:53:07,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:07,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:53:07,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:07,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:53:07,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:53:07,026 INFO L87 Difference]: Start difference. First operand 1436 states and 2144 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:07,156 INFO L93 Difference]: Finished difference Result 2828 states and 4222 transitions. [2024-10-12 22:53:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:53:07,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-12 22:53:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:07,160 INFO L225 Difference]: With dead ends: 2828 [2024-10-12 22:53:07,160 INFO L226 Difference]: Without dead ends: 1445 [2024-10-12 22:53:07,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:53:07,162 INFO L432 NwaCegarLoop]: 2118 mSDtfsCounter, 2103 mSDsluCounter, 8459 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2107 SdHoareTripleChecker+Valid, 10577 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:07,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2107 Valid, 10577 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:53:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-10-12 22:53:07,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1440. [2024-10-12 22:53:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1432 states have (on average 1.4937150837988826) internal successors, (2139), 1433 states have internal predecessors, (2139), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 22:53:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 2149 transitions. [2024-10-12 22:53:07,181 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 2149 transitions. Word has length 45 [2024-10-12 22:53:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:07,181 INFO L471 AbstractCegarLoop]: Abstraction has 1440 states and 2149 transitions. [2024-10-12 22:53:07,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 2149 transitions. [2024-10-12 22:53:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 22:53:07,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:07,182 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] [2024-10-12 22:53:07,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 22:53:07,182 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:07,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:07,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1515665699, now seen corresponding path program 1 times [2024-10-12 22:53:07,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:07,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882606368] [2024-10-12 22:53:07,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:07,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:07,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:07,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882606368] [2024-10-12 22:53:07,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882606368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:07,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:07,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:53:07,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702277196] [2024-10-12 22:53:07,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:07,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 22:53:07,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:07,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 22:53:07,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 22:53:07,396 INFO L87 Difference]: Start difference. First operand 1440 states and 2149 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:07,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:07,632 INFO L93 Difference]: Finished difference Result 2825 states and 4217 transitions. [2024-10-12 22:53:07,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 22:53:07,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-12 22:53:07,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:07,637 INFO L225 Difference]: With dead ends: 2825 [2024-10-12 22:53:07,637 INFO L226 Difference]: Without dead ends: 1438 [2024-10-12 22:53:07,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:53:07,639 INFO L432 NwaCegarLoop]: 2115 mSDtfsCounter, 2090 mSDsluCounter, 8421 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2094 SdHoareTripleChecker+Valid, 10536 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:07,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2094 Valid, 10536 Invalid, 89 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:53:07,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-10-12 22:53:07,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1435. [2024-10-12 22:53:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 1427 states have (on average 1.494043447792572) internal successors, (2132), 1428 states have internal predecessors, (2132), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 22:53:07,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2142 transitions. [2024-10-12 22:53:07,667 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2142 transitions. Word has length 45 [2024-10-12 22:53:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:07,668 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 2142 transitions. [2024-10-12 22:53:07,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:07,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2142 transitions. [2024-10-12 22:53:07,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 22:53:07,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:07,669 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] [2024-10-12 22:53:07,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 22:53:07,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:07,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:07,670 INFO L85 PathProgramCache]: Analyzing trace with hash 20791831, now seen corresponding path program 1 times [2024-10-12 22:53:07,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:07,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604484343] [2024-10-12 22:53:07,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:07,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:07,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 22:53:07,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604484343] [2024-10-12 22:53:07,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604484343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:07,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:07,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 22:53:07,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228932419] [2024-10-12 22:53:07,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:07,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 22:53:07,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 22:53:07,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 22:53:07,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 22:53:07,857 INFO L87 Difference]: Start difference. First operand 1435 states and 2142 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:09,290 INFO L93 Difference]: Finished difference Result 4111 states and 6143 transitions. [2024-10-12 22:53:09,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 22:53:09,291 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-12 22:53:09,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:09,299 INFO L225 Difference]: With dead ends: 4111 [2024-10-12 22:53:09,299 INFO L226 Difference]: Without dead ends: 2729 [2024-10-12 22:53:09,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:53:09,303 INFO L432 NwaCegarLoop]: 1705 mSDtfsCounter, 1970 mSDsluCounter, 4976 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 6681 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:09,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 6681 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 22:53:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2024-10-12 22:53:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 1443. [2024-10-12 22:53:09,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1435 states have (on average 1.4926829268292683) internal successors, (2142), 1436 states have internal predecessors, (2142), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 22:53:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2152 transitions. [2024-10-12 22:53:09,345 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2152 transitions. Word has length 46 [2024-10-12 22:53:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:09,346 INFO L471 AbstractCegarLoop]: Abstraction has 1443 states and 2152 transitions. [2024-10-12 22:53:09,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2152 transitions. [2024-10-12 22:53:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 22:53:09,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:09,347 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] [2024-10-12 22:53:09,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 22:53:09,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:09,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash 289843774, now seen corresponding path program 1 times [2024-10-12 22:53:09,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 22:53:09,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776649070] [2024-10-12 22:53:09,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 22:53:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:53:09,410 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 22:53:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 22:53:09,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 22:53:09,497 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 22:53:09,498 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 22:53:09,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 22:53:09,503 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:09,562 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 22:53:09,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:53:09 BoogieIcfgContainer [2024-10-12 22:53:09,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 22:53:09,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 22:53:09,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 22:53:09,566 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 22:53:09,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:53:04" (3/4) ... [2024-10-12 22:53:09,568 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 22:53:09,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 22:53:09,570 INFO L158 Benchmark]: Toolchain (without parser) took 11988.96ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 92.8MB in the beginning and 842.2MB in the end (delta: -749.4MB). Peak memory consumption was 381.8MB. Max. memory is 16.1GB. [2024-10-12 22:53:09,570 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 167.8MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:53:09,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 861.33ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 53.3MB in the end (delta: 39.3MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2024-10-12 22:53:09,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 667.21ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 53.3MB in the beginning and 110.2MB in the end (delta: -56.8MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2024-10-12 22:53:09,571 INFO L158 Benchmark]: Boogie Preprocessor took 945.33ms. Allocated memory was 243.3MB in the beginning and 492.8MB in the end (delta: 249.6MB). Free memory was 110.2MB in the beginning and 335.6MB in the end (delta: -225.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-12 22:53:09,571 INFO L158 Benchmark]: RCFGBuilder took 4388.85ms. Allocated memory was 492.8MB in the beginning and 752.9MB in the end (delta: 260.0MB). Free memory was 335.6MB in the beginning and 551.7MB in the end (delta: -216.2MB). Peak memory consumption was 391.0MB. Max. memory is 16.1GB. [2024-10-12 22:53:09,572 INFO L158 Benchmark]: TraceAbstraction took 5115.48ms. Allocated memory was 752.9MB in the beginning and 1.3GB in the end (delta: 543.2MB). Free memory was 551.7MB in the beginning and 842.2MB in the end (delta: -290.5MB). Peak memory consumption was 253.8MB. Max. memory is 16.1GB. [2024-10-12 22:53:09,572 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 1.3GB. Free memory is still 842.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 22:53:09,573 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.24ms. Allocated memory is still 167.8MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 861.33ms. Allocated memory is still 167.8MB. Free memory was 92.6MB in the beginning and 53.3MB in the end (delta: 39.3MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 667.21ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 53.3MB in the beginning and 110.2MB in the end (delta: -56.8MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 945.33ms. Allocated memory was 243.3MB in the beginning and 492.8MB in the end (delta: 249.6MB). Free memory was 110.2MB in the beginning and 335.6MB in the end (delta: -225.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * RCFGBuilder took 4388.85ms. Allocated memory was 492.8MB in the beginning and 752.9MB in the end (delta: 260.0MB). Free memory was 335.6MB in the beginning and 551.7MB in the end (delta: -216.2MB). Peak memory consumption was 391.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5115.48ms. Allocated memory was 752.9MB in the beginning and 1.3GB in the end (delta: 543.2MB). Free memory was 551.7MB in the beginning and 842.2MB in the end (delta: -290.5MB). Peak memory consumption was 253.8MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 1.3GB. Free memory is still 842.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 344. 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 - 16); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 12); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (12 - 1); [L35] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 32); [L36] const SORT_11 msb_SORT_11 = (SORT_11)1 << (32 - 1); [L38] const SORT_37 mask_SORT_37 = (SORT_37)-1 >> (sizeof(SORT_37) * 8 - 3); [L39] const SORT_37 msb_SORT_37 = (SORT_37)1 << (3 - 1); [L41] const SORT_44 mask_SORT_44 = (SORT_44)-1 >> (sizeof(SORT_44) * 8 - 2); [L42] const SORT_44 msb_SORT_44 = (SORT_44)1 << (2 - 1); [L44] const SORT_295 mask_SORT_295 = (SORT_295)-1 >> (sizeof(SORT_295) * 8 - 4); [L45] const SORT_295 msb_SORT_295 = (SORT_295)1 << (4 - 1); [L47] const SORT_297 mask_SORT_297 = (SORT_297)-1 >> (sizeof(SORT_297) * 8 - 5); [L48] const SORT_297 msb_SORT_297 = (SORT_297)1 << (5 - 1); [L50] const SORT_299 mask_SORT_299 = (SORT_299)-1 >> (sizeof(SORT_299) * 8 - 6); [L51] const SORT_299 msb_SORT_299 = (SORT_299)1 << (6 - 1); [L53] const SORT_301 mask_SORT_301 = (SORT_301)-1 >> (sizeof(SORT_301) * 8 - 7); [L54] const SORT_301 msb_SORT_301 = (SORT_301)1 << (7 - 1); [L56] const SORT_303 mask_SORT_303 = (SORT_303)-1 >> (sizeof(SORT_303) * 8 - 8); [L57] const SORT_303 msb_SORT_303 = (SORT_303)1 << (8 - 1); [L59] const SORT_305 mask_SORT_305 = (SORT_305)-1 >> (sizeof(SORT_305) * 8 - 9); [L60] const SORT_305 msb_SORT_305 = (SORT_305)1 << (9 - 1); [L62] const SORT_307 mask_SORT_307 = (SORT_307)-1 >> (sizeof(SORT_307) * 8 - 10); [L63] const SORT_307 msb_SORT_307 = (SORT_307)1 << (10 - 1); [L65] const SORT_309 mask_SORT_309 = (SORT_309)-1 >> (sizeof(SORT_309) * 8 - 11); [L66] const SORT_309 msb_SORT_309 = (SORT_309)1 << (11 - 1); [L68] const SORT_312 mask_SORT_312 = (SORT_312)-1 >> (sizeof(SORT_312) * 8 - 13); [L69] const SORT_312 msb_SORT_312 = (SORT_312)1 << (13 - 1); [L71] const SORT_314 mask_SORT_314 = (SORT_314)-1 >> (sizeof(SORT_314) * 8 - 14); [L72] const SORT_314 msb_SORT_314 = (SORT_314)1 << (14 - 1); [L74] const SORT_316 mask_SORT_316 = (SORT_316)-1 >> (sizeof(SORT_316) * 8 - 15); [L75] const SORT_316 msb_SORT_316 = (SORT_316)1 << (15 - 1); [L77] const SORT_533 mask_SORT_533 = (SORT_533)-1 >> (sizeof(SORT_533) * 8 - 17); [L78] const SORT_533 msb_SORT_533 = (SORT_533)1 << (17 - 1); [L80] const SORT_6 var_7 = 0; [L81] const SORT_11 var_13 = 0; [L82] const SORT_3 var_21 = 0; [L83] const SORT_1 var_26 = 0; [L84] const SORT_37 var_38 = 0; [L85] const SORT_1 var_57 = 1; [L86] const SORT_37 var_93 = 2; [L87] const SORT_37 var_97 = 1; [L88] const SORT_37 var_105 = 4; [L89] const SORT_37 var_107 = 5; [L90] const SORT_37 var_111 = 3; [L91] const SORT_6 var_128 = 2; [L92] const SORT_44 var_138 = 0; [L93] const SORT_3 var_145 = 65535; [L94] const SORT_297 var_534 = 0; [L95] const SORT_301 var_626 = 5; [L96] const SORT_301 var_630 = 4; [L97] const SORT_301 var_634 = 3; [L98] const SORT_301 var_638 = 2; [L99] const SORT_301 var_642 = 1; [L100] const SORT_301 var_646 = 0; [L102] SORT_1 input_2; [L103] SORT_3 input_4; [L104] SORT_3 input_5; [L105] SORT_6 input_114; [L106] SORT_6 input_115; [L107] SORT_6 input_116; [L108] SORT_3 input_134; [L109] SORT_3 input_135; [L110] SORT_3 input_136; [L111] SORT_3 input_144; [L112] SORT_3 input_153; [L113] SORT_3 input_154; [L114] SORT_3 input_155; [L115] SORT_3 input_158; [L116] SORT_3 input_176; [L117] SORT_3 input_177; [L118] SORT_3 input_178; [L119] SORT_3 input_181; [L120] SORT_3 input_183; [L121] SORT_44 input_197; [L122] SORT_44 input_198; [L123] SORT_44 input_199; [L124] SORT_3 input_529; [L125] SORT_3 input_530; [L126] SORT_3 input_531; [L127] SORT_3 input_532; [L128] SORT_3 input_555; [L129] SORT_3 input_557; [L130] SORT_3 input_559; [L131] SORT_3 input_563; [L132] SORT_3 input_564; [L133] SORT_3 input_565; [L134] SORT_3 input_566; [L135] SORT_3 input_585; [L136] SORT_3 input_589; [L137] SORT_3 input_591; [L138] SORT_3 input_598; [L139] SORT_3 input_600; [L140] SORT_3 input_605; [L141] SORT_3 input_607; [L142] SORT_3 input_611; [L143] SORT_3 input_612; [L144] SORT_3 input_613; [L145] SORT_3 input_614; [L146] SORT_3 input_615; [L147] SORT_3 input_616; [L148] SORT_3 input_617; [L149] SORT_3 input_618; [L150] SORT_3 input_619; [L151] SORT_3 input_620; [L152] SORT_3 input_621; [L153] SORT_3 input_622; [L154] SORT_3 input_629; [L155] SORT_3 input_633; [L156] SORT_3 input_637; [L157] SORT_3 input_641; [L158] SORT_3 input_645; [L159] SORT_3 input_650; [L160] SORT_3 input_656; [L161] SORT_3 input_658; [L162] SORT_3 input_660; [L163] SORT_3 input_662; [L164] SORT_3 input_665; [L165] SORT_3 input_671; [L166] SORT_3 input_673; [L167] SORT_3 input_675; [L168] SORT_3 input_678; [L169] SORT_3 input_684; [L170] SORT_3 input_686; [L171] SORT_3 input_689; [L172] SORT_3 input_695; [L173] SORT_3 input_698; [L174] SORT_3 input_705; [L175] SORT_3 input_710; [L176] SORT_1 input_729; [L177] SORT_1 input_730; [L178] SORT_1 input_731; [L179] SORT_1 input_732; [L180] SORT_1 input_735; [L181] SORT_1 input_737; [L182] SORT_1 input_739; [L183] SORT_1 input_744; [L184] SORT_1 input_746; [L185] SORT_1 input_751; [L186] SORT_3 input_764; [L187] SORT_3 input_765; [L188] SORT_3 input_766; [L190] EXPR __VERIFIER_nondet_ushort() & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L190] SORT_6 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_6; [L191] EXPR __VERIFIER_nondet_ushort() & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L191] SORT_6 state_15 = __VERIFIER_nondet_ushort() & mask_SORT_6; [L192] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L192] SORT_3 state_22 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L193] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L193] SORT_3 state_24 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L194] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L194] SORT_3 state_28 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L195] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L195] SORT_3 state_30 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L196] EXPR __VERIFIER_nondet_uchar() & mask_SORT_37 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L196] SORT_37 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_37; [L197] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L197] SORT_3 state_80 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L198] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L198] SORT_3 state_82 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L199] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L199] SORT_3 state_84 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L200] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L200] SORT_1 state_86 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L201] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L201] SORT_3 state_88 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L202] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_7=0, var_93=2, var_97=1] [L202] SORT_3 state_90 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L204] SORT_6 init_9_arg_1 = var_7; [L205] state_8 = init_9_arg_1 [L206] SORT_6 init_16_arg_1 = var_7; [L207] state_15 = init_16_arg_1 [L208] SORT_3 init_23_arg_1 = var_21; [L209] state_22 = init_23_arg_1 [L210] SORT_3 init_25_arg_1 = var_21; [L211] state_24 = init_25_arg_1 [L212] SORT_3 init_29_arg_1 = var_21; [L213] state_28 = init_29_arg_1 [L214] SORT_3 init_31_arg_1 = var_21; [L215] state_30 = init_31_arg_1 [L216] SORT_37 init_40_arg_1 = var_38; [L217] state_39 = init_40_arg_1 [L218] SORT_3 init_81_arg_1 = var_21; [L219] state_80 = init_81_arg_1 [L220] SORT_3 init_83_arg_1 = var_21; [L221] state_82 = init_83_arg_1 [L222] SORT_3 init_85_arg_1 = var_21; [L223] state_84 = init_85_arg_1 [L224] SORT_1 init_87_arg_1 = var_26; [L225] state_86 = init_87_arg_1 [L226] SORT_3 init_89_arg_1 = var_21; [L227] state_88 = init_89_arg_1 [L228] SORT_3 init_91_arg_1 = var_21; [L229] state_90 = init_91_arg_1 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, state_15=0, state_22=0, state_24=0, state_28=0, state_30=0, state_39=0, state_80=0, state_82=0, state_84=0, state_86=0, state_88=0, state_8=0, state_90=0, var_105=4, var_107=5, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_93=2, var_97=1] [L232] input_2 = __VERIFIER_nondet_uchar() [L233] input_4 = __VERIFIER_nondet_ushort() [L234] input_5 = __VERIFIER_nondet_ushort() [L235] input_114 = __VERIFIER_nondet_ushort() [L236] input_115 = __VERIFIER_nondet_ushort() [L237] input_116 = __VERIFIER_nondet_ushort() [L238] input_134 = __VERIFIER_nondet_ushort() [L239] input_135 = __VERIFIER_nondet_ushort() [L240] input_136 = __VERIFIER_nondet_ushort() [L241] input_144 = __VERIFIER_nondet_ushort() [L242] input_153 = __VERIFIER_nondet_ushort() [L243] input_154 = __VERIFIER_nondet_ushort() [L244] input_155 = __VERIFIER_nondet_ushort() [L245] input_158 = __VERIFIER_nondet_ushort() [L246] input_176 = __VERIFIER_nondet_ushort() [L247] input_177 = __VERIFIER_nondet_ushort() [L248] input_178 = __VERIFIER_nondet_ushort() [L249] input_181 = __VERIFIER_nondet_ushort() [L250] input_183 = __VERIFIER_nondet_ushort() [L251] input_197 = __VERIFIER_nondet_uchar() [L252] input_198 = __VERIFIER_nondet_uchar() [L253] input_199 = __VERIFIER_nondet_uchar() [L254] input_529 = __VERIFIER_nondet_ushort() [L255] input_530 = __VERIFIER_nondet_ushort() [L256] input_531 = __VERIFIER_nondet_ushort() [L257] input_532 = __VERIFIER_nondet_ushort() [L258] input_555 = __VERIFIER_nondet_ushort() [L259] input_557 = __VERIFIER_nondet_ushort() [L260] input_559 = __VERIFIER_nondet_ushort() [L261] input_563 = __VERIFIER_nondet_ushort() [L262] input_564 = __VERIFIER_nondet_ushort() [L263] input_565 = __VERIFIER_nondet_ushort() [L264] input_566 = __VERIFIER_nondet_ushort() [L265] input_585 = __VERIFIER_nondet_ushort() [L266] input_589 = __VERIFIER_nondet_ushort() [L267] input_591 = __VERIFIER_nondet_ushort() [L268] input_598 = __VERIFIER_nondet_ushort() [L269] input_600 = __VERIFIER_nondet_ushort() [L270] input_605 = __VERIFIER_nondet_ushort() [L271] input_607 = __VERIFIER_nondet_ushort() [L272] input_611 = __VERIFIER_nondet_ushort() [L273] input_612 = __VERIFIER_nondet_ushort() [L274] input_613 = __VERIFIER_nondet_ushort() [L275] input_614 = __VERIFIER_nondet_ushort() [L276] input_615 = __VERIFIER_nondet_ushort() [L277] input_616 = __VERIFIER_nondet_ushort() [L278] input_617 = __VERIFIER_nondet_ushort() [L279] input_618 = __VERIFIER_nondet_ushort() [L280] input_619 = __VERIFIER_nondet_ushort() [L281] input_620 = __VERIFIER_nondet_ushort() [L282] input_621 = __VERIFIER_nondet_ushort() [L283] input_622 = __VERIFIER_nondet_ushort() [L284] input_629 = __VERIFIER_nondet_ushort() [L285] input_633 = __VERIFIER_nondet_ushort() [L286] input_637 = __VERIFIER_nondet_ushort() [L287] input_641 = __VERIFIER_nondet_ushort() [L288] input_645 = __VERIFIER_nondet_ushort() [L289] input_650 = __VERIFIER_nondet_ushort() [L290] input_656 = __VERIFIER_nondet_ushort() [L291] input_658 = __VERIFIER_nondet_ushort() [L292] input_660 = __VERIFIER_nondet_ushort() [L293] input_662 = __VERIFIER_nondet_ushort() [L294] input_665 = __VERIFIER_nondet_ushort() [L295] input_671 = __VERIFIER_nondet_ushort() [L296] input_673 = __VERIFIER_nondet_ushort() [L297] input_675 = __VERIFIER_nondet_ushort() [L298] input_678 = __VERIFIER_nondet_ushort() [L299] input_684 = __VERIFIER_nondet_ushort() [L300] input_686 = __VERIFIER_nondet_ushort() [L301] input_689 = __VERIFIER_nondet_ushort() [L302] input_695 = __VERIFIER_nondet_ushort() [L303] input_698 = __VERIFIER_nondet_ushort() [L304] input_705 = __VERIFIER_nondet_ushort() [L305] input_710 = __VERIFIER_nondet_ushort() [L306] input_729 = __VERIFIER_nondet_uchar() [L307] input_730 = __VERIFIER_nondet_uchar() [L308] input_731 = __VERIFIER_nondet_uchar() [L309] input_732 = __VERIFIER_nondet_uchar() [L310] input_735 = __VERIFIER_nondet_uchar() [L311] input_737 = __VERIFIER_nondet_uchar() [L312] input_739 = __VERIFIER_nondet_uchar() [L313] input_744 = __VERIFIER_nondet_uchar() [L314] input_746 = __VERIFIER_nondet_uchar() [L315] input_751 = __VERIFIER_nondet_uchar() [L316] input_764 = __VERIFIER_nondet_ushort() [L317] input_765 = __VERIFIER_nondet_ushort() [L318] input_766 = __VERIFIER_nondet_ushort() [L321] SORT_6 var_10_arg_0 = state_8; [L322] SORT_1 var_10 = var_10_arg_0 >> 0; [L323] SORT_1 var_52_arg_0 = var_10; VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, state_15=0, state_22=0, state_24=0, state_28=0, state_30=0, state_39=0, state_80=0, state_82=0, state_84=0, state_86=0, state_88=0, state_8=0, state_90=0, var_105=4, var_107=5, var_10=0, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_52_arg_0=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_93=2, var_97=1] [L324] EXPR var_52_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, state_15=0, state_22=0, state_24=0, state_28=0, state_30=0, state_39=0, state_80=0, state_82=0, state_84=0, state_86=0, state_88=0, state_8=0, state_90=0, var_105=4, var_107=5, var_10=0, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_93=2, var_97=1] [L324] var_52_arg_0 = var_52_arg_0 & mask_SORT_1 [L325] SORT_11 var_52 = var_52_arg_0; [L326] SORT_11 var_53_arg_0 = var_52; [L327] SORT_11 var_53_arg_1 = var_13; [L328] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L329] SORT_6 var_17_arg_0 = state_15; [L330] SORT_1 var_17 = var_17_arg_0 >> 0; [L331] SORT_1 var_54_arg_0 = var_17; VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, state_15=0, state_22=0, state_24=0, state_28=0, state_30=0, state_39=0, state_80=0, state_82=0, state_84=0, state_86=0, state_88=0, state_8=0, state_90=0, var_105=4, var_107=5, var_10=0, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_17=0, var_21=0, var_26=0, var_38=0, var_534=0, var_53=1, var_54_arg_0=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_93=2, var_97=1] [L332] EXPR var_54_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, state_15=0, state_22=0, state_24=0, state_28=0, state_30=0, state_39=0, state_80=0, state_82=0, state_84=0, state_86=0, state_88=0, state_8=0, state_90=0, var_105=4, var_107=5, var_10=0, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_17=0, var_21=0, var_26=0, var_38=0, var_534=0, var_53=1, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_93=2, var_97=1] [L332] var_54_arg_0 = var_54_arg_0 & mask_SORT_1 [L333] SORT_11 var_54 = var_54_arg_0; [L334] SORT_11 var_55_arg_0 = var_54; [L335] SORT_11 var_55_arg_1 = var_13; [L336] SORT_1 var_55 = var_55_arg_0 == var_55_arg_1; [L337] SORT_1 var_56_arg_0 = var_53; [L338] SORT_1 var_56_arg_1 = var_55; VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, state_15=0, state_22=0, state_24=0, state_28=0, state_30=0, state_39=0, state_80=0, state_82=0, state_84=0, state_86=0, state_88=0, state_8=0, state_90=0, var_105=4, var_107=5, var_10=0, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_17=0, var_21=0, var_26=0, var_38=0, var_534=0, var_56_arg_0=1, var_56_arg_1=1, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_93=2, var_97=1] [L339] EXPR var_56_arg_0 & var_56_arg_1 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, state_15=0, state_22=0, state_24=0, state_28=0, state_30=0, state_39=0, state_80=0, state_82=0, state_84=0, state_86=0, state_88=0, state_8=0, state_90=0, var_105=4, var_107=5, var_10=0, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_17=0, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_93=2, var_97=1] [L339] SORT_1 var_56 = var_56_arg_0 & var_56_arg_1; [L340] SORT_1 var_58_arg_0 = var_56; [L341] SORT_1 var_58 = ~var_58_arg_0; [L342] SORT_1 var_59_arg_0 = var_57; [L343] SORT_1 var_59_arg_1 = var_58; VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, state_15=0, state_22=0, state_24=0, state_28=0, state_30=0, state_39=0, state_80=0, state_82=0, state_84=0, state_86=0, state_88=0, state_8=0, state_90=0, var_105=4, var_107=5, var_10=0, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_17=0, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_59_arg_0=1, var_59_arg_1=-2, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_93=2, var_97=1] [L344] EXPR var_59_arg_0 & var_59_arg_1 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, state_15=0, state_22=0, state_24=0, state_28=0, state_30=0, state_39=0, state_80=0, state_82=0, state_84=0, state_86=0, state_88=0, state_8=0, state_90=0, var_105=4, var_107=5, var_10=0, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_17=0, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_93=2, var_97=1] [L344] SORT_1 var_59 = var_59_arg_0 & var_59_arg_1; [L345] EXPR var_59 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, state_15=0, state_22=0, state_24=0, state_28=0, state_30=0, state_39=0, state_80=0, state_82=0, state_84=0, state_86=0, state_88=0, state_8=0, state_90=0, var_105=4, var_107=5, var_10=0, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_17=0, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_93=2, var_97=1] [L345] var_59 = var_59 & mask_SORT_1 [L346] SORT_1 bad_60_arg_0 = var_59; VAL [bad_60_arg_0=1, mask_SORT_1=1, mask_SORT_295=15, mask_SORT_297=31, mask_SORT_299=63, mask_SORT_301=127, mask_SORT_303=255, mask_SORT_305=511, mask_SORT_307=1023, mask_SORT_309=2047, mask_SORT_312=8191, mask_SORT_314=16383, mask_SORT_316=32767, mask_SORT_37=7, mask_SORT_3=65535, mask_SORT_44=3, mask_SORT_6=4095, state_15=0, state_22=0, state_24=0, state_28=0, state_30=0, state_39=0, state_80=0, state_82=0, state_84=0, state_86=0, state_88=0, state_8=0, state_90=0, var_105=4, var_107=5, var_10=0, var_111=3, var_128=2, var_138=0, var_13=0, var_145=65535, var_17=0, var_21=0, var_26=0, var_38=0, var_534=0, var_57=1, var_626=5, var_630=4, var_634=3, var_638=2, var_642=1, var_646=0, var_93=2, var_97=1] [L347] CALL __VERIFIER_assert(!(bad_60_arg_0)) VAL [\old(cond)=0] [L21] COND TRUE !(cond) VAL [\old(cond)=0] [L21] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 1426 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10287 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10267 mSDsluCounter, 59161 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44846 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2035 IncrementalHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 14315 mSDtfsCounter, 2035 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1443occurred in iteration=6, InterpolantAutomatonStates: 34, 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, 6 MinimizatonAttempts, 2639 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 259 ConstructedInterpolants, 0 QuantifiedInterpolants, 764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 22:53:09,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vsa16.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 45e58736dd2fb3c49049c2685505c5453ccebf8bd699ff36e792e3749e9ae2f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 22:53:11,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 22:53:11,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-12 22:53:11,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 22:53:11,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 22:53:11,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 22:53:11,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 22:53:11,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 22:53:11,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 22:53:11,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 22:53:11,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 22:53:11,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 22:53:11,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 22:53:11,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 22:53:11,963 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 22:53:11,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 22:53:11,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 22:53:11,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 22:53:11,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 22:53:11,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 22:53:11,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 22:53:11,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 22:53:11,968 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 22:53:11,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 22:53:11,968 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 22:53:11,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 22:53:11,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 22:53:11,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 22:53:11,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 22:53:11,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 22:53:11,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 22:53:11,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:53:11,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 22:53:11,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 22:53:11,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 22:53:11,970 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 22:53:11,971 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 22:53:11,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 22:53:11,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 22:53:11,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 22:53:11,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 22:53:11,976 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 22:53:11,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45e58736dd2fb3c49049c2685505c5453ccebf8bd699ff36e792e3749e9ae2f9 [2024-10-12 22:53:12,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 22:53:12,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 22:53:12,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 22:53:12,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 22:53:12,260 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 22:53:12,261 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vsa16.c [2024-10-12 22:53:13,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 22:53:14,219 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 22:53:14,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vsa16.c [2024-10-12 22:53:14,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1750f5f4c/e458efd0f1b44710863174c966771535/FLAG410b5f55a [2024-10-12 22:53:14,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1750f5f4c/e458efd0f1b44710863174c966771535 [2024-10-12 22:53:14,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 22:53:14,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 22:53:14,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 22:53:14,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 22:53:14,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 22:53:14,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:53:14" (1/1) ... [2024-10-12 22:53:14,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@730d17bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:14, skipping insertion in model container [2024-10-12 22:53:14,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 10:53:14" (1/1) ... [2024-10-12 22:53:14,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 22:53:14,740 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.h_Vsa16.c[1247,1260] [2024-10-12 22:53:15,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:53:15,108 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 22:53:15,120 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.h_Vsa16.c[1247,1260] [2024-10-12 22:53:15,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 22:53:15,283 INFO L204 MainTranslator]: Completed translation [2024-10-12 22:53:15,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15 WrapperNode [2024-10-12 22:53:15,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 22:53:15,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 22:53:15,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 22:53:15,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 22:53:15,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,501 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2537 [2024-10-12 22:53:15,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 22:53:15,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 22:53:15,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 22:53:15,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 22:53:15,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,576 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 22:53:15,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 22:53:15,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 22:53:15,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 22:53:15,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 22:53:15,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (1/1) ... [2024-10-12 22:53:15,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 22:53:15,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 22:53:15,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 22:53:15,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 22:53:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 22:53:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 22:53:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 22:53:15,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 22:53:15,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 22:53:15,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 22:53:16,171 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 22:53:16,177 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 22:53:18,609 INFO L? ?]: Removed 244 outVars from TransFormulas that were not future-live. [2024-10-12 22:53:18,609 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 22:53:18,680 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 22:53:18,681 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 22:53:18,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:53:18 BoogieIcfgContainer [2024-10-12 22:53:18,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 22:53:18,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 22:53:18,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 22:53:18,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 22:53:18,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 10:53:14" (1/3) ... [2024-10-12 22:53:18,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1689248d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:53:18, skipping insertion in model container [2024-10-12 22:53:18,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 10:53:15" (2/3) ... [2024-10-12 22:53:18,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1689248d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:53:18, skipping insertion in model container [2024-10-12 22:53:18,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:53:18" (3/3) ... [2024-10-12 22:53:18,690 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Vsa16.c [2024-10-12 22:53:18,707 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 22:53:18,707 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 22:53:18,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 22:53:18,770 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;@2b9094f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 22:53:18,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 22:53:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 22:53:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-12 22:53:18,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:18,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-12 22:53:18,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:18,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:18,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2039185110, now seen corresponding path program 1 times [2024-10-12 22:53:18,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:53:18,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921410481] [2024-10-12 22:53:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:18,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:53:18,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:53:18,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:53:18,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 22:53:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:19,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-12 22:53:19,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:53:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:19,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:53:19,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:53:19,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921410481] [2024-10-12 22:53:19,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921410481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:19,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:19,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 22:53:19,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888530120] [2024-10-12 22:53:19,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:19,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:53:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:53:19,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:53:19,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:53:19,587 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:19,886 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2024-10-12 22:53:19,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:53:19,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-12 22:53:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:19,897 INFO L225 Difference]: With dead ends: 45 [2024-10-12 22:53:19,897 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 22:53:19,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:53:19,904 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:19,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 51 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:53:19,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 22:53:19,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2024-10-12 22:53:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-12 22:53:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-10-12 22:53:19,974 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 6 [2024-10-12 22:53:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:19,974 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-10-12 22:53:19,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 22:53:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-10-12 22:53:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 22:53:19,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:19,975 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:19,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 22:53:20,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:53:20,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:20,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:20,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1214251534, now seen corresponding path program 1 times [2024-10-12 22:53:20,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:53:20,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706035465] [2024-10-12 22:53:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:20,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:53:20,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:53:20,179 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:53:20,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 22:53:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:20,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-12 22:53:20,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:53:20,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 22:53:20,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:53:20,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:53:20,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706035465] [2024-10-12 22:53:20,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706035465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:20,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:20,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:53:20,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165522214] [2024-10-12 22:53:20,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:20,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:53:20,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:53:20,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:53:20,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:53:20,670 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 22:53:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:20,903 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-10-12 22:53:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:53:20,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-12 22:53:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:20,904 INFO L225 Difference]: With dead ends: 35 [2024-10-12 22:53:20,904 INFO L226 Difference]: Without dead ends: 33 [2024-10-12 22:53:20,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:53:20,906 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:20,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 60 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:53:20,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-12 22:53:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-10-12 22:53:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-12 22:53:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-10-12 22:53:20,915 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2024-10-12 22:53:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:20,915 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-10-12 22:53:20,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 22:53:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-10-12 22:53:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-12 22:53:20,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:20,916 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:20,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-12 22:53:21,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:53:21,119 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:21,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash 449741068, now seen corresponding path program 1 times [2024-10-12 22:53:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:53:21,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950158046] [2024-10-12 22:53:21,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:21,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:53:21,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:53:21,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:53:21,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 22:53:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:21,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-12 22:53:21,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:53:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 22:53:21,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:53:21,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:53:21,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950158046] [2024-10-12 22:53:21,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950158046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:21,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:21,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 22:53:21,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498489486] [2024-10-12 22:53:21,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:21,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 22:53:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:53:21,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 22:53:21,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 22:53:21,563 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 22:53:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:21,894 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2024-10-12 22:53:21,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 22:53:21,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-12 22:53:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:21,900 INFO L225 Difference]: With dead ends: 39 [2024-10-12 22:53:21,900 INFO L226 Difference]: Without dead ends: 37 [2024-10-12 22:53:21,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:53:21,901 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:21,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 22:53:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-12 22:53:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-10-12 22:53:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 22:53:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-10-12 22:53:21,918 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 18 [2024-10-12 22:53:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:21,918 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-10-12 22:53:21,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 22:53:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-10-12 22:53:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 22:53:21,919 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:21,923 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:21,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-12 22:53:22,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:53:22,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:22,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:22,126 INFO L85 PathProgramCache]: Analyzing trace with hash 381129124, now seen corresponding path program 1 times [2024-10-12 22:53:22,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:53:22,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191123283] [2024-10-12 22:53:22,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:22,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:53:22,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:53:22,133 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:53:22,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-12 22:53:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:22,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-10-12 22:53:22,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:53:23,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 22:53:23,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 22:53:23,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:53:23,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191123283] [2024-10-12 22:53:23,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191123283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 22:53:23,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 22:53:23,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 22:53:23,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608751629] [2024-10-12 22:53:23,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 22:53:23,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:53:23,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:53:23,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:53:23,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 22:53:23,004 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:53:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:23,217 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2024-10-12 22:53:23,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:53:23,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-10-12 22:53:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:23,218 INFO L225 Difference]: With dead ends: 43 [2024-10-12 22:53:23,218 INFO L226 Difference]: Without dead ends: 41 [2024-10-12 22:53:23,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:53:23,219 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:23,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 22:53:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-12 22:53:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-10-12 22:53:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 22:53:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-10-12 22:53:23,229 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 24 [2024-10-12 22:53:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:23,229 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-10-12 22:53:23,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 22:53:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-10-12 22:53:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-12 22:53:23,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:23,230 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:23,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-12 22:53:23,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:53:23,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:23,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:23,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1747608466, now seen corresponding path program 1 times [2024-10-12 22:53:23,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:53:23,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628749776] [2024-10-12 22:53:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:23,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:53:23,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:53:23,439 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:53:23,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-12 22:53:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:24,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-12 22:53:24,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:53:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 22:53:24,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:53:25,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 22:53:25,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628749776] [2024-10-12 22:53:25,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1628749776] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 22:53:25,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [179428306] [2024-10-12 22:53:25,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 22:53:25,543 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-12 22:53:25,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-12 22:53:25,550 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-12 22:53:25,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-12 22:53:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 22:53:26,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-12 22:53:26,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 22:53:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 22:53:26,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 22:53:27,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [179428306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 22:53:27,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 22:53:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2024-10-12 22:53:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215409815] [2024-10-12 22:53:27,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 22:53:27,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 22:53:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 22:53:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 22:53:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-12 22:53:27,914 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 22:53:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 22:53:28,216 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-10-12 22:53:28,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 22:53:28,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-10-12 22:53:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 22:53:28,219 INFO L225 Difference]: With dead ends: 56 [2024-10-12 22:53:28,219 INFO L226 Difference]: Without dead ends: 54 [2024-10-12 22:53:28,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-12 22:53:28,220 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 22:53:28,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 51 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 22:53:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-12 22:53:28,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2024-10-12 22:53:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-12 22:53:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-10-12 22:53:28,236 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2024-10-12 22:53:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 22:53:28,236 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-10-12 22:53:28,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 22:53:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-10-12 22:53:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 22:53:28,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 22:53:28,237 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 22:53:28,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-10-12 22:53:28,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-12 22:53:28,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:53:28,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 22:53:28,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 22:53:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1651022418, now seen corresponding path program 2 times [2024-10-12 22:53:28,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 22:53:28,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68112734] [2024-10-12 22:53:28,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 22:53:28,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 22:53:28,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 22:53:28,648 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 22:53:28,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-12 22:53:29,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 22:53:29,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 22:53:29,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-12 22:53:29,421 INFO L278 TraceCheckSpWp]: Computing forward predicates...